Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
Authors:
- 16 December 1999
- book chapter
- Published by Springer Nature
- p. 467-484
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions2001
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs2001
- Image density is complete for non-interactive-SZK1998
- Randomness-efficient non-interactive zero knowledgeLecture Notes in Computer Science, 1997
- The knowledge complexity of quadratic residuosity languagesTheoretical Computer Science, 1994
- Proof verification and hardness of approximation problems1992
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Non-Interactive Zero-Knowledge with Preprocessing1990
- Perfect zero-knowledge in constant rounds1990
- Non-Interactive Zero-Knowledge Proof Systems1988