Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP
Authors:
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 772-783
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NPBRICS Report Series, 1997
- Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments1997
- Statistical Secrecy and Multi-Bit CommitmentsBRICS Report Series, 1996
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, 1993
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum resource zero knowledge proofs1989
- 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
- The complexity of perfect zero-knowledge1987
- Probabilistic encryptionJournal of Computer and System Sciences, 1984