Improved Efficient Arguments
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 311-324
- https://doi.org/10.1007/3-540-44750-4_25
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiple non-interactive zero knowledge proofs based on a single random stringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Checking computations in polylogarithmic timePublished by Association for Computing Machinery (ACM) ,1991
- On-line algorithms for path selection in a nonblocking networkPublished by Association for Computing Machinery (ACM) ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Zero knowledge proofs of identityPublished by Association for Computing Machinery (ACM) ,1987