Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 196-214
- https://doi.org/10.1007/3-540-48071-4_14
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A discrete logarithm implementation of perfect zero-knowledge blobsJournal of Cryptology, 1990
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Efficient cryptographic schemes provably as secure as subset sumPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the ResultPublished by Springer Nature ,1988
- Random self-reducibility and zero knowledge interactive proofs of possession of informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982