One-way functions, hard on average problems, and statistical zero-knowledge proofs
- 10 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-138
- https://doi.org/10.1109/sct.1991.160253
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- The (true) complexity of statistical zero knowledgePublished by Association for Computing Machinery (ACM) ,1990
- Pseudo-random generators under uniform assumptionsPublished by Association for Computing Machinery (ACM) ,1990
- No better ways to generate hard NP instances than picking uniformly at randomPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- One-way functions are essential for complexity based cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Average Case Complete ProblemsSIAM Journal on Computing, 1986
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1984
- New directions in cryptographyIEEE Transactions on Information Theory, 1976