On the composition of zero-knowledge proof systems
- 11 December 2005
- book chapter
- Published by Springer Nature
- Vol. 25 (1) , 268-282
- https://doi.org/10.1007/bfb0032038
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Perfect zero-knowledge in constant roundsPublished by Association for Computing Machinery (ACM) ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- On the cunning power of cheating verifiers: Some observations about zero knowledge proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Random self-reducibility and zero knowledge interactive proofs of possession of informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- On a Set of Almost Deterministic $k$-Independent Random VariablesThe Annals of Probability, 1974