Security-preserving hardness-amplification for any regular one-way function

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Security-preserving hardness-amplification for any regular one-way function

Full text

Pdf (770 KB)

Source

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

Atlanta, Georgia, United States

Pages: 169 - 178

Year of Publication: 1999

ISBN:1-58113-067-8

Authors

Giovanni Di Crescenzo	Computer Science and Engineering Department, University of California San Diego, La Jolla, CA
Russell Impagliazzo	Computer Science and Engineering Department, University of California San Diego, La Jolla, CA

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): 25, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/301250.301296 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 , Joe Kilian , Phillip Rogaway, The Security of Cipher Block Chaining, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.341-358, August 21-25, 1994
	2	M. Ben-Or , O. Goldreich , S. Goldwasser , J. Håstad , J. Kilian , S. Micali , P. Rogaway, Everything provable is provable in zero-knowledge, Proceedings on Advances in cryptology, p.37-56, February 1990, Santa Barbara, California, United States
	3	Manuel Blum , Silvio Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing, v.13 n.4, p.850-864, Nov. 1984 [doi>10.1137/0213053]
	4	A. De Santis and P. Persiano, Zero-Knowledge Proofs oj~ Knowledge without Interaction, in Proc. of FOCS 92.
	5	G. Di Crescenzo, T. Malkin, and R. Ostrovsky, Single Database Private Information Retrieval Implies Oblivious Transfer, manuscript, Nov 1998.
	6	W. DitIie and M. Hellman, New Directions in Cryptography, in IEEE Transaction in Information Theory, 22, 1976.
	7	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]
	8	O. Gotdreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security- Preserving Amplification o.f Hardness, in Proc. of FOCS 9O.
	9	Oded Goldreich , Hugo Krawczyk , Michael Luby, On the existence of pseudorandom generators, SIAM Journal on Computing, v.22 n.6, p.1163-1175, Dec. 1993 [doi>10.1137/0222069]
	10	O. Goldreich and L. Levin, A Hard-Core Predicate .for any One-Way Function, in Proc. of FOCS 9O.
	11	O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology o.f Cryptographic Design, in Proc. of FOCS 86.
	12	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989 [doi>10.1137/0218012]
	13	Shafi Goldwasser , Silvio Micali , Ronald L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, v.17 n.2, p.281-308, April 1988 [doi>10.1137/0217017]
	14	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]
	15	Amir Herzberg , Michael Luby, Pubic Randomness in Cryptography, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, p.421-432, August 16-20, 1992
	16	R. Impagliazzo and S. Rudich, Limits on the Provable Consequences o.f One-Way Permutations, in Proc. of STOC 91.
	17	Russell Impagliazzo , Moti Yung, Direct Minimum-Knowledge Computations, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.40-51, August 16-20, 1987
	18	Leonid A. Levin, One-way functions and Pseudorandom generators, Combinatorica, v.7 n.4, p.357-363, Dec, 1987 [doi>10.1007/BF02579323]
	19	Michael George Luby , Luby Michael, Pseudorandomness and Cryptographic Applications, Princeton University Press, Princeton, NJ, 1994
	20	Michael Luby , Charles Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, v.17 n.2, p.373-386, April 1988 [doi>10.1137/0217022]
	21	M. Naor, Bit Commitment using Pseudorandomhess, in Proc. of CRYPTO 91.
	22	M. Naor , M. Yung, Universal one-way hash functions and their cryptographic applications, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.33-43, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73011]
	23	R. Ostrovsky, and A. Wigderson, One-way Functions are Essential .for Non-Trivial Zero- Knowledge, in Proc. of ISTCS 93.
	24	J. Rompel, One-way functions are necessary and sufficient for secure signatures, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.387-394, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100269]
	25	A. Yao, Theory and Applications of Trapdoor Functions, in Proc..of FOCS 82.