Complete characterization of security notions for probabilistic private-key encryption

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Complete characterization of security notions for probabilistic private-key encryption

Full text

Pdf (974 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-second annual ACM symposium on Theory of computing table of contents

Portland, Oregon, United States

Pages: 245 - 254

Year of Publication: 2000

ISBN:1-58113-184-4

Authors

Jonathan Katz	Department of Computer Science, Columbia University
Moti Yung	CertCo, NY

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 50, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/335305.335335 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Mihir Bellare , Anand Desai , Eron Jokipii , Phillip Rogaway, A Concrete Security Treatment of Symmetric Encryption, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.394, October 19-22, 1997
	2	Mihir Bellare , Anand Desai , David Pointcheval , Phillip Rogaway, Relations Among Notions of Security for Public-Key Encryption Schemes, Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, p.26-45, August 23-27, 1998
	3	Mihir Bellare , Amit Sahai, Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.519-536, August 15-19, 1999
	4	Giovanni Di Crescenzo , Yuval Ishai , Rafail Ostrovsky, Non-interactive and non-malleable commitment, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.141-150, May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276722]
	5	Danny Dolev , Cynthia Dwork , Moni Naor, Non-malleable cryptography, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.542-552, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103474]
	6	Oded Goldreich , Shafi Goldwasser , Silvio Micali, How to construct random functions, Journal of the ACM (JACM), v.33 n.4, p.792-807, Oct. 1986 [doi>10.1145/6490.6503]
	7	Oded Goldreich, Foundations of Cryptography: Basic Tools, Cambridge University Press, New York, NY, 2000
	8	O. Goldreich. A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptography, 6: 21-53, 1993. Manuscript, 1998.
	9	S. Goldwasser and M. Bellare. Lecture notes on cryptography. Manuscript, 1997.
	10	S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28: 270- 299, 1984:
	11	Johan HÅstad , Russell Impagliazzo , Leonid A. Levin , Michael Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, v.28 n.4, p.1364-1396, Aug. 1999 [doi>10.1137/S0097539793244708]
	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.
	13	J. Katz and M. Yung. Unforgeable encryption and adaptively secure modes of operation. Manuscript, January, 2000.
	14	Michael George Luby , Luby Michael, Pseudorandomness and Cryptographic Applications, Princeton University Press, Princeton, NJ, 1994
	15	Silvio Micali , Charles Rackoff , Bob Sloan, The notion of security for probabilistic cryptosystems, SIAM Journal on Computing, v.17 n.2, p.412-426, April 1988 [doi>10.1137/0217025]
	16	M. Naor , M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.427-437, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100273]
	17	Charles Rackoff , Daniel R. Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.433-444, August 11-15, 1991
	18	Amit Sahai, Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.543, October 17-18, 1999
	19	A.C. Yao. Theory and applications of trapdoor functions. In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, 1982.

CITED BY 7

	Shouhuai Xu, On the security of group communication schemes based on symmetric key cryptosystems, Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks, November 07-07, 2005, Alexandria, VA, USA
	John Black , Hector Urtubia, Side-Channel Attacks on Symmetric Encryption Schemes: The Case for Authenticated Encryption, Proceedings of the 11th USENIX Security Symposium, p.327-338, August 05-09, 2002
	Jonathan Katz , Bruce Schneier, A chosen ciphertext attack against several e-mail encryption protocols, Proceedings of the 9th conference on USENIX Security Symposium, p.18-18, August 14-17, 2000, Denver, Colorado
	Phillip Rogaway , Mihir Bellare , John Black, OCB: A block-cipher mode of operation for efficient authenticated encryption, ACM Transactions on Information and System Security (TISSEC), v.6 n.3, p.365-403, August 2003
	Phillip Rogaway , Mihir Bellare , John Black , Ted Krovetz, OCB: a block-cipher mode of operation for efficient authenticated encryption, Proceedings of the 8th ACM conference on Computer and Communications Security, November 05-08, 2001, Philadelphia, PA, USA
	Oded Goldreich, Cryptography and cryptographic protocols, Distributed Computing, v.16 n.2-3, p.177-199, September 2003
	Oded Goldreich, Foundations of cryptography: a primer, Foundations and Trends® in Theoretical Computer Science, v.1 n.1, p.1-116, April 2005