Image density is complete for non-interactive-SZK
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 784-795
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Randomness-efficient non-interactive zero knowledgeLecture Notes in Computer Science, 1997
- Knowledge on the average---perfect, statistical and logarithmic1995
- Definitions and properties of zero-knowledge proof systemsJournal of Cryptology, 1994
- The knowledge complexity of quadratic residuosity languagesTheoretical Computer Science, 1994
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Statistical zero-knowledge languages can be recognized in two roundsJournal of Computer and System Sciences, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Private coins versus public coins in interactive proof systems1986
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979