Title :
One-way functions, hard on average problems, and statistical zero-knowledge proofs
Author :
Ostrovsky, Rafail
Author_Institution :
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
fDate :
30 Jun-3 Jul 1991
Abstract :
The author studies connections among one-way functions, hard on the average problems, and statistical zero-knowledge proofs. In particular, he shows how these three notions are related and how the third notion can be better characterized, assuming the first one
Keywords :
computational complexity; cryptography; statistical analysis; average problems; hard; one-way functions; statistical zero-knowledge proofs; Complexity theory; Computer science; Cryptography; Digital signatures; Laboratories; Polynomials; Probability;
Conference_Titel :
Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
Conference_Location :
Chicago, IL
Print_ISBN :
0-8186-2255-5
DOI :
10.1109/SCT.1991.160253
