How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
The notion of security for probabilistic cryptosystems
Proceedings on Advances in cryptology---CRYPTO '86
Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Extended Notions of Security for Multicast Public Key Cryptosystems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
RSA-OAEP Is Secure under the RSA Assumption
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Multi-recipient Public-Key Encryption with Shortened Ciphertext
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Simplified OAEP for the RSA and Rabin Functions
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Confirmer signature schemes secure against adaptive adversaries
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Public-key encryption in a multi-user setting: security proofs and improvements
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation
Proceedings of the 13th ACM conference on Computer and communications security
Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Certificate-based fair exchange protocol of signatures from pairings
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient ID-based multi-decrypter encryption with short ciphertexts
Journal of Computer Science and Technology
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Certified Encryption Revisited
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Multi-recipient Public-Key Encryption from Simulators in Security Proofs
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
A closer look at PKI: security and efficiency
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Identity-based broadcast encryption with constant size ciphertexts and private keys
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Randomness reuse: extensions and improvements
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
A brief history of provably-secure public-key encryption
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Generic constructions of stateful public key encryption and their applications
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
A generic method for reducing ciphertext length of reproducible KEMs in the RO model
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Efficient broadcast encryption with personalized messages
ProvSec'10 Proceedings of the 4th international conference on Provable security
Acquiring key privacy from data privacy
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
On the integration of public key data encryption and public key encryption with keyword search
ISC'06 Proceedings of the 9th international conference on Information Security
Secure cryptographic workflow in the standard model
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Multi-receiver identity-based key encapsulation with shortened ciphertext
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient multi-receiver identity-based encryption and its application to broadcast encryption
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Efficient and provably secure multi-receiver identity-based signcryption
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
A diffie-hellman key exchange protocol without random oracles
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Public key encryption for the forgetful
Cryptography and Security
Computer Networks: The International Journal of Computer and Telecommunications Networking
Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Sanitizable signatures with several signers and sanitizers
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Public key encryption with conjunctive keyword search and its extension to a multi-user system
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Unrestricted aggregate signatures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Future Generation Computer Systems
| Hi-index | 0.00 |
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.