A Relationship between One-Wayness and Correlation Intractability
- 29 October 1999
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Towards realizing random oracles: Hash functions that hide all partial informationPublished by Springer Nature ,1997
- On the Composition of Zero-Knowledge Proof SystemsSIAM Journal on Computing, 1996
- Definitions and properties of zero-knowledge proof systemsJournal of Cryptology, 1994
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- IP = PSPACEJournal of the ACM, 1992
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Limits on the provable consequences of one-way permutationsPublished by Association for Computing Machinery (ACM) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986