Abstract
This paper addresses the security of public-key cryptosystems in a “multi-user” setting, namely in the presence of attacks involving the encryption of related messages under different public keys, as exemplified by Håstad’s classical attacks on RSA. We prove that security in the single-user setting implies security in the multi-user setting as long as the former is interpreted in the strong sense of “indistinguishability,” thereby pin-pointing many schemes guaranteed to be secure against Håstad-type attacks. We then highlight the importance, in practice, of considering and improving the concrete security of the general reduction, and present such improvements for two Diffie-Hellman based schemes, namely El Gamal and Cramer-Shoup.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
O. Baudron, D. Pointcheval and J. Stern, “Extended notions of security for multicast public key cryptosystems,” Manuscript.
M. Bellare, A. Boldyreva, and S. Micali, “Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements,” Full version of this paper, available via http://www-cse.ucsd.edu/users/mihir.
M. Bellare, A. Desai, E. Jokipii and P. Rogaway, “A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation,” Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
M. Bellare, P. Rogaway, “Optimal asymmetric encryption — How to encrypt with RSA,” Advances in Cryptology — Eurocrypt 94 Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994.
M. Bellare and A. Sahai, “Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization,” Advances in Cryptology — Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999.
R. Cramer and V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack,” Advances in Cryptology — Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998.
D. Dolev, C. Dwork, and M. Naor, “Non-malleable cryptography,” Proceedings of the 23rd Annual Symposium on Theory of Computing, ACM, 1991.
T. ElGamal, “A public key cryptosystem and signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol 31, 1985, pp. 469–472.
S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Science, Vol. 28, 1984, pp. 270–299.
J. Håstad, “Solving simultaneous modular equations of low degree,” SIAM J. on Computing Vol. 17, No. 2, April 1988.
M. Naor and O. Reingold, “Number-theoretic constructions of efficient pseudorandom functions,” Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
RSA Laboratories, “PKCS-1,” http://www.rsasecurity.com/rsalabs/pkcs/pkcs-1/.
C. Rackoff and D. Simon, “Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack,” Advances in Cryptology — Crypto 91 Proceedings, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991.
V. Shoup, “On formal models for secure key exchange,” Theory of Cryptography Library Record 99-12, http://philby.ucsd.edu/cryptolib/.
M. Stadler, “Publicly verifiable secret sharing,” Advances in Cryptology — Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.
Y. Tsiounis and M. Yung, “On the security of El Gamal based encryption,” Proceedings of the First International workshop on practice and theory in Public Key Cryptography (PKC’98), Lecture Notes in Computer Science Vol. 1431, H. Imai and Y. Zheng eds., Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Boldyreva, A., Micali, S. (2000). Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. In: Preneel, B. (eds) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45539-6_18
Download citation
DOI: https://doi.org/10.1007/3-540-45539-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67517-4
Online ISBN: 978-3-540-45539-4
eBook Packages: Springer Book Archive