A note on negligible functions

Journal of Cryptology

Volumn 15, Issue 4, 2002, Pages 271-284

  Bellare, Mihir ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Error probability; Negligible functions; One way functions; Zero knowledge arguments

Indexed keywords

ERROR ANALYSIS; FUNCTIONS; KNOWLEDGE ACQUISITION; PROBABILITY; SECURITY OF DATA;

NEGLIGIBLE FUNCTIONS; ONE-WAY FUNCTIONS; SECURITY PARAMETERS; ZERO-KNOWLEDGE ARGUMENTS;

CRYPTOGRAPHY;

EID: 2942747407     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-002-0116-x     Document Type: Article

References (9)

1. M. Bellare and O. Goldreich. On defining proofs of knowledge. Advances in Cryptology - CRYPTO '92, Lecture Notes in Computer Science, Vol. 740, E. Brickell, ed., Springer-Verlag, Berlin, 1992, pp. 390-420.
2. M. Bellare, M. Jakobsson, and M. Yung. Round-optimal zero-knowledge arguments based on any one-way function. Advances in Cryptology - EUKOCRYPT '97, Lecture Notes in Computer Science, Vol. 1233, W. Fumy, ed., Springer-Verlag, Berlin, 1997, pp. 280-305.
3. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, Vol. 37, 1988, pp. 156-189.
4. G. Brassard and C. Crépeau. Non-transitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond. Proceedings of the 27th Symposium on Foundations of Computer Science, IEEE, New York, 1986, pp. 188-195.
5. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge, 2001.
6. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, Vol. 18, No. 1, February 1989, pp. 186-208.
7. L. Levin. One-way functions and pseudorandom generators. Combinatorica, Vol. 7, No. 4, 1987, pp. 357363.
8. M. Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes, Princeton University Press, Princeton, NJ, 1996.
9. M. Naor, R. Ostrovsky, R. Venkatasan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology, Vol. 11, No. 2, 1998, pp. 87-108.