Complete characterization of security notions for probabilistic private-key encryption

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 245-254

  Katz, Jonathan ^a   Yung, Moti ^b  

^a Department of Applied Physics and Applied Mathematics   (United States)

^b CertCo   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHOSEN CIPHERTEXT ATTACK; CHOSEN-PLAINTEXT ATTACK; ENCRYPTION METHODS; INDISTINGUISHABILITY; NON-MALLEABILITY; POLYNOMIAL-TIME; PRIVATE-KEY ENCRYPTION; SECURITY NOTION; PROBABILISTIC PRIVATE-KEY ENCRYPTIONS;

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; CRYPTOGRAPHY; DATA STRUCTURES; EQUIVALENCE CLASSES; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS;

CRYPTOGRAPHY; SECURITY OF DATA;

EID: 0033704913     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335335     Document Type: Conference Paper

References (20)

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.
2. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. 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.
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.
4. G. DiCrescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and non-malleable commitment. In Proceedings of the 30th Annual Symposium on Theory of Computing, pages 141-150, 1998.
5. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography, in Proceedings of the 23rd Annual Symposium on Theory of Computing, pages 542-552, 1991.
6. Also: manuscript, December 1998 (to appear: SIAM Journal on Computing).
7. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33 (4): 792-807, 1986.
8. O. Goldreich. Foundations of cryptography. Class notes, Spring 1989, Technion University.
9. O. Goldreich. A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptography, 6: 21-53, 1993. Manuscript, 1998.
10. S. Goldwasser and M. Bellare. Lecture notes on cryptography. Manuscript, 1997.
11. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System sciences, 28: 270-299, 1984
12. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. on Computing, 28 (4): 1364-1396, 1999.
13. R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography. In 30th Annual Symposium on Foundations of Computer Science, pages 230-235, 1989.
14. J. Katz and M. Yung. Unforgeable encryption and adaptively secure modes of operation. Manuscript, January, 2000.
15. M. Luby. Pseudorandomness and cryptographic applications, chapter 14. Princeton University Press, 1996.
16. S. Micali, C. Rackoff, and R. Sloan. The notion of security for probabilistic cryptosystems. SIAM J. on Computing, 17 (2): 412-426, April 1988.
17. 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, 1990.
18. 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.
19. A. Sahai. Non-malleable non-interactive zero-knowledge and achieving chosen-ciphertext security. In 40th Annual Symposium on Foundations of Computer Science, pages 543-553, 1999.
20. A.C. Yao. Theory and applications of trapdoor functions. In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, 1982.