Abstract
In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the equivalence and show that polynomial-time pseudo-randomness is not always necessary for the equivalence.
Chapter PDF
References
M. Bellare, A. Boldyreva, and S. Micali. Public-key encryption in a multi-user setting: Security proofs and improvements. In B. Preneel, editor, Advances in Cryptology-EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 259–274. Springer-Verlag, 2000.
M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In H. Krawczyk, editor, Advances in Cryptology-CRYPTO’98, volume 1462 of Lecture Notes in Computer Science, pages 26–45. Springer-Verlag, 1998.
M. Bellare, S. Goldwasser, and D. Micciancio. Pseudo-random number generation within cryptographic algorithms: The DSS case. In B. S. Kaliski Jr., editor, Advances in Cryptology-CRYPTO’97, volume 1294 of Lecture Notes in Computer Science, pages 277–291. Springer-Verlag, 1997.
M. Bellare and A. Sahai. Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In M. Wiener, editor, Advances in Cryptology-CRYPTO’99, volume 1666 of Lecture Notes in Computer Science, pages 519–536. Springer-Verlag, 1999.
L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM Journal on Computing, 15(2):364–383, 1986.
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850–864, 1984.
J. Boyar. Inferring sequences produced by pseudo-random number generators. Journal of the Association for Computing Machinery, 36(1):129–141, 1989.
D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 542–552. ACM Press, 1991.
A. M. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and A. Shamir. Reconstructing truncated integer variables satisfying linear congruences. SIAM Journal on Computing, 17(2):262–280, 1988.
O. Goldreich. Foundation of Cryptography (Fragment of a Book-Version 2.03), 1998.
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4):792–807, 1986.
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270–299, 1984.
D. E. Knuth. The Art of Computer Programming, volume 2. Seminumerical Algorithms. Addison-Wesley, 3rd edition, 1998.
T. Koshiba. A theory of randomness for public key cryptosystems: The ElGamal cryptosystem case. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A(4):614–619, 2000.
H. Krawczyk. How to predict congruential generators. Journal of Algorithms, 13(4):527–545, 1992.
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton Univ. Press, 1996.
A. J. Menezes, P. C. van Oorschot, and S. A. Vanestone. Handbook of Applied Cryptography. CRC Press, 1997.
S. Micali, C. Racko., and B. Sloan. The notion of security for probabilistic cryptosystems. SIAM Journal on Computing, 17(2):412–426, 1988.
M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 427–437. ACM Press, 1990.
C. Racko. and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, Advances in Cryptology-CRYPTO’91, volume 576 of Lecture Notes in Computer Science, pages 433–444. Springer-Verlag, 1992.
A. Shamir. On the generation of cryptographically strong pseudorandom sequences. ACM Transactions on Computer Systems, 1(1):38–44, 1983.
J. Stern. Secret linear congruential generators are not cryptographically secure. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 421–426. IEEE Computer Society Press, 1987.
A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80–91. IEEE Computer Society Press, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koshiba, T. (2001). A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive