One Message Proof Systems with Known Space Verifiers
- 13 July 2001
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Multiple non-interactive zero knowledge proofs based on a single random stringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finite state verifiers IIJournal of the ACM, 1992
- One-message statistical Zero-Knowledge Proofs and space-bounded verifierPublished by Springer Nature ,1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Witness indistinguishable and witness hiding protocolsPublished by Association for Computing Machinery (ACM) ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Published by Association for Computing Machinery (ACM) ,1986