Jonathan Katz
Moti Yung
- 1.M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A concrete security treatment of symmetric encryption. In 38th Annual Symposium on Foundations of Computer Science, pages 394-403, 1997.]] Google Scholar
Digital Library
- 2.M. Bellare, A. Desai, D. Pointcheval, and P. P~ogaway. Relations among notions of security for public-key encryption schemes. Advances in Cryptology--CRYPTO '98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998.]] Google ScholarDigital Library
- 3.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.J. Wiener ed., Springer-Verlag, 1999.]] Google ScholarDigital Library
- 4.G. DiCrescenzo, Y. Ishai, and R. Ostrovsky. Noninteractive and non-malleable commitment. In Proceedings of the 30th Annual Symposium on Theory of Computing, pages 141-150, 1998.]] Google ScholarDigital Library
- 5.D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography, in Proceedings of the ~3rd Annual Symposium on Theory of Computing, pages 542-552, 1991. Also: manuscript, December 1998 (to appear: SIAM Journal on Computing).]] Google ScholarDigital Library
- 6.O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the A CM, 33(4): 792-807, 1986.]] Google ScholarDigital Library
- 7.O. Goldreich. Foundations of cryptography. Class notes, Spring 1989, Technion University.]] Google ScholarDigital Library
- 8.O. Goldreich. A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptography, 6: 21-53, 1993. Manuscript, 1998.]]Google ScholarDigital Library
- 9.S. Goldwasser and M. Bellare. Lecture notes on cryptography. Manuscript, 1997.]]Google Scholar
- 10.S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28: 270- 299, 1984:]]Google ScholarCross Ref
- 11.J. H~tad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. on Computing, 28(4): 1364-1396, 1999.]] Google ScholarDigital Library
- 12.R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography. In 30th Annual Symposium on Foundations of Computer Sci. ence, pages 230-235, 1989.]]Google ScholarDigital Library
- 13.J. Katz and M. Yung. Unforgeable encryption and adaptively secure modes of operation. Manuscript, January, 2000.]]Google Scholar
- 14.M. Luby. Pseudorandomness and cryptographic applications, chapter 14. Princeton University Press, 1996.]] Google ScholarDigital Library
- 15.S. Micali, C. Rackoff, and R. Sloan. The notion of security for probabilistic cryptosystems. SIAM J. on Computing, 17(2): 412-426, April 1988.]] Google ScholarDigital Library
- 16.M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In 'Proceedings of the 2~nd Annual A CM Symposium on Theory of Computing, pages 427-437, 1990.]] Google ScholarDigital Library
- 17.C. Rackoff and D. Simon. Non-interactive zeroknowledge 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.]] Google ScholarDigital Library
- 18.A. Sahai. Non-malleable non-interactive zeroknowledge and achieving chosen-ciphertext security. In j Oth Annual Symposium on Foundations of Computer Science, pages 543-553, 1999.]] Google ScholarDigital Library
- 19.A.C. Yao. Theory and applications of trapdoor functions. In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, 1982.]]Google ScholarDigital Library
Index Terms
- Complete characterization of security notions for probabilistic private-key encryption
Recommendations
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of private-key encryption. Extending ...
Building Key-Private Public-Key Encryption Schemes
ACISP '09: Proceedings of the 14th Australasian Conference on Information Security and PrivacyIn the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts corresponding to the same message and identity, but generated using different TA ...
Public-Key encryption from ID-Based encryption without one-time signature
OTM'06: Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part IDesign a secure public key encryption scheme and its security proof are one of the main interests in cryptography In 2004, Canetti, Halevi and Katz [8] constructed a public key encryption (PKE) from a selective identity-based encryption scheme with a ...
Comments