Quantifying knowledge complexity
- 9 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- On the composition of zero-knowledge proof systemsPublished by Springer Science and Business Media LLC ,2005
- Privacy, additional information, and communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Quantifying knowledge complexitycomputational complexity, 1999
- Everything Provable is Provable in Zero-KnowledgeLecture Notes in Computer Science, 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
- The complexity of perfect zero-knowledgePublished by Association for Computing Machinery (ACM) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A complexity theoretic approach to randomnessPublished by Association for Computing Machinery (ACM) ,1983
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979