Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)
- 1 January 1999
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 271-280
- https://doi.org/10.1007/3-540-48523-6_24
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with PreprocessingPublished by Springer Science and Business Media LLC ,2001
- Randomness-efficient non-interactive zero knowledgeLecture Notes in Computer Science, 1997
- Short Discreet ProofsLecture Notes in Computer Science, 1996
- The knowledge complexity of quadratic residuosity languagesTheoretical Computer Science, 1994
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Dispersers, deterministic amplification, and weak random sourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984