Crypto Seminar
— 5:30pm
Location:
In Person and Virtual - ET
-
Group Watch Blelloch-Skees Conference Room, Gates Hillman 8115 and Zoom
Speaker:
NOEMI GLAESER
,
Ph.D. Student, Department of Computer Science, University of Maryland, and the, Max Planck Institute for Security & Privacy
https://nglaeser.github.io/
Efficient Registration-Based Encryption
Registration-based encryption (RBE) was recently introduced as an alternative to identity-based encryption (IBE), to resolve the key-escrow problem: In RBE, the trusted authority is substituted with a weaker entity, called the key curator, who has no knowledge of any secret key. Users generate keys on their own and then publicly register their identities and their corresponding public keys to the key curator. RBE is a promising alternative to IBE, retaining many of its advantages while removing the key-escrow problem, the major drawback of IBE. Unfortunately, all existing constructions of RBE use cryptographic schemes in a non black-box way, which makes them prohibitively expensive. It has been estimated that the size of an RBE ciphertext would be in the order of terabytes (though no RBE has even been implemented).
In this work, we propose a new approach to construct RBE, from standard assumptions in bilinear groups. Our scheme is black-box and it is concretely highly efficient—a ciphertext is 914 bytes. To substantiate this claim, we implemented a prototype of our scheme and we show that it scales to millions of users. The public parameters of the scheme are on the order of kilobytes. The most expensive operation (registration) takes at most a handful of seconds, whereas the encryption and decryption runtimes are on the order of milliseconds. This is the first-ever implementation of an RBE scheme and demonstrates that the practical deployment of RBE is already possible with today’s hardware.
Group Watch Party and Zoom Participation.
See announcement. Crypto Seminar Channel
Event Website:
https://sites.google.com/view/crypto-seminar/home