Paper Info
Title
Randomness Re-use in Multi-recipient Encryption Schemeas
Abstract
Kurosawa showed how one could design multi-receiver encryption schemes achieving savings in bandwidth and computation relative to the naive methods. We broaden the investigation. We identify new types of attacks possible in multi-recipient settings, which were overlooked by the previously suggested models, and specify an appropriate model to incorporate these types of attacks. We then identify a general paradigm that underlies his schemes and also others, namely the re-use of randomness: ciphertexts sent to different receivers by a single sender are computed using the same underlying coins. In order to avoid case by case analysis of encryption schemes to see whether they permit secure randomness re-use, we provide a condition, or test, that when applied to an encryption scheme shows whether or not the associated randomness re-using version of the scheme is secure. As a consequence, our test shows that randomness re-use is secure in the strong sense for asymmetric encryption schemes such as El Gamal, Cramer-Shoup, DHIES, and Boneh and Franklin's escrow El Gamal.
Year
DOI
Venue
2003
10.1007/3-540-36288-6_7
Public Key Cryptography
Keywords
Field
DocType
randomness re-use,appropriate model,case analysis,el gamal,secure randomness re-use,associated randomness,asymmetric encryption scheme,multi-recipient encryption schemeas,encryption scheme,multi-receiver encryption scheme,escrow el gamal,provable security,randomness,encryption
Multiple encryption,Broadcast encryption,Computer science,Computer security,Cryptography,Theoretical computer science,Encryption,40-bit encryption,Probabilistic encryption,Public-key cryptography,Randomness
Conference
Volume
ISSN
ISBN
2567
0302-9743
3-540-00324-X
Citations 
PageRank 
References 
80
3.10
22
Authors
3
Name
Order
Citations
PageRank
Mihir Bellare1164371481.16
Alexandra Boldyreva22297114.80
Jessica Staddon31762128.75