On monotone formula closure of SZK
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 454-465
- https://doi.org/10.1109/sfcs.1994.365745
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- Quantifying knowledge complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Interactive Hashing Simplifies Zero-Knowledge Protocol DesignPublished by Springer Nature ,2001
- Computational Complexity and Knowledge ComplexitySIAM Journal on Computing, 1998
- Definitions and properties of zero-knowledge proof systemsJournal of Cryptology, 1994
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Everything Provable is Provable in Zero-KnowledgePublished by Springer Nature ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Designing programs that check their workPublished by Association for Computing Machinery (ACM) ,1989
- Secret sharing scheme realizing general access structureElectronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988