Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements

By Mihir Bellare, Alexandra Boldyreva, Silvio Micali. International Conference on the Theory and Application of Cryptographic Techniques, 2000

549 citations recorded by the source corpus.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/f6bfabcc8120e36b1a197f8493ef037b6eea929b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Guide to Elliptic Curve Cryptography (2004, background): “247 Acronyms AES Advanced Encryption Standard AIA Almost Inverse Algorithm ANSI American National Standards Institute ASIC Application-Specific Integrated Circuit BEA Binary Extended Algorithm DES Data Encryption Standard DH Diffie-Hellman DHP Diffie-Hellman Problem DL Discrete Logarithm DLP Discret”
A Proposal for an ISO Standard for Public Key Encryption (2001, background): “This advantage becomes even more pronounced when one analyzes the security of many messages encrypted under a single public key (as formally modeled in [ BBM00 ]).”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, background): “Note that this notion is different from multi-recipient public key encryption [4, 5, 22], where the sender wants to send one (different) message to each receiver.”
Key-Privacy in Public-Key Encryption (2001, methodology): “In this settingwe prove that the Cramer-Shoup scheme meets the notion of IK-CCA assumingthe DDH problem is hard in Gq. Our proof exploits ideas in [12, 3 ].”
Scalable Protocols for Authenticated Group Key Exchange (2003, methodology): “To obtain a tighter concrete security reduction, we instead use the random self-reducibility [38], [ 5 ] of the DDH assumption.”
A model for asynchronous reactive systems and its application to secure message transmission (2001, background): “A similar multi-user scenario has been considered i n [4], but no decryption request for any of the ciphertexts pro duced by a correct machine is allowed there.”
A Survey of Provably Secure Searchable Encryption (2014, unknown): “The idea is to use multireceiver PKE [Baudron et al. 2000; Bellare et al. 2000, 2007a] and randomness reuse [Kurosawa 2002; Bellare et al. 2003] to improve the computation and communication complexity.”
Secure Matrix Multiplication with MapReduce (2017, unknown): “Paillier’s scheme is an IND-CPA scheme [18], we recall the key generation, the encryption and decryption algorithms.”
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack (2003, background): “See also [ BBM00 ] for another generalization of the denition of adaptive chosen ciphertext attack to a setting involving many users and messages.”
A Protocol for Privately Reporting Ad Impressions at Scale (2016, background): “This approach is well known to be secure under the assumption that the Decisional Diﬃe-Hellman problem is hard in G [12, 28].”
Identity-Based Encryption from the Weil Pairing (2001, background): “In [4] the authors show that that multiuser IND-CCA is reducible to single user IND-CCA using a standard hybrid argument.”
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords (2001, background): “Given quadruple (g; h; s; t) and group G, it runs the initialization as follows: a; b; ` Zq g1 = g; g2 = ga; c = gb; d = g` H UOWH Publish parameters (q; g1; g2; h; c; d;H) and group G hpwCiC2Client f1; : : : ;Ng By a random self-reducibility property [28,1], the simulator can generate sT ; tT (for ”
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, methodology): “To remedy this limitation, public key broadcast encryption [14] and multi-user systems [8,9] can be good solutions.”
Deterministic and Efficiently Searchable Encryption (2007, background): “This is known to be equivalent (with loss in security by a factor less than or equal to the total number of LR-queries made) to allowing only one such query [8].”