Speaker: Dr. Sanjay K Madria, Curators’ Distinguished Professor, Department of Computer Science, Missouri University of Science and Technology, Rolla, MO 65409, USA

Title of the Talk: Efficient Revocation in Attribute-based Encryption Scheme for Secure Data Sharing in Cloud

Biography: Sanjay K Madria is a Curators’ Distinguished Professor in the Department of Computer Science at the Missouri University of Science and Technology (formerly, University of Missouri-Rolla, USA). He has published over 285+ Journal and conference papers in the areas of cybersecurity, mobile and sensor computing, Big data and cloud computing, and data analytics. He won five IEEE best papers awards in conferences such as IEEE MDM and IEEE SRDS. He is a co-author of a book (published with his two Ph.D. graduates) on Secure Sensor Cloud published by Morgan and Claypool in Dec. 2018. He has graduated 20 PhDs and 33 MS thesis students, with 8 current PhDs. NSF, NIST, ARL, ARO, AFRL, DOE, Boeing, CDC-NIOSH, ORNL, Honeywell, and others have funded his research projects of over $18M. He has been awarded JSPS (Japanese Society for Promotion of Science) invitational visiting scientist fellowship, and ASEE (American Society of Engineering Education) fellowship. In 2012 and in 2019, he was awarded NRC Fellowship by National Academies, US. He is ACM Distinguished Scientist and served as an ACM and IEEE Distinguished Speaker He is an IEEE Senior Member as well as IEEE Golden Core Awardee.

Abstract: Attribute-based encryption (ABE) is a prominent cryptographic tool for secure data sharing in the cloud because it can be used to enforce very expressive and fine-grained access control on outsourced data. The revocation in ABE remains a challenging problem as most of the revocation techniques available today, suffer from the collusion attack. The revocable ABE schemes which are collusion resistant require the aid of a semi-trusted manager to achieve revocation. More specifically, the semi-trusted manager needs to update the secret keys of non-revoked users followed by a revocation. This introduces computation and communication overhead and increases the overall security vulnerability. In this work, we propose a revocable ABE scheme that is collusion resistant and does not require any semi-trusted entity. In our scheme, the secret keys of the non-revoked users are never affected. Our decryption requires only an additional pairing operation compared to the baseline ABE scheme. We are able to achieve these at the cost of a little increase (compared to the baseline scheme) in the size of the secret key and the ciphertext. Experimental results show that our scheme outperforms the relatable existing SOA schemes.