2-round zero knowledge and proof auditors

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 322-331

  Dwork, Cynthia ^a   Stockmeyer, Larry ^a  

^a NONE

Author keywords

Advice bound; Cryptography; Interactive proof systems; Timed protocol; Zap; Zero knowledge

Indexed keywords

CRYPTOGRAPHY; NETWORK PROTOCOLS; POLES AND ZEROS; POLYNOMIALS; PROBABILITY; RESOURCE ALLOCATION;

INTERACTIVE PROOF SYSTEM; PROOF AUDITORS; ZERO KNOWLEDGE PROOF SYSTEM;

COMPUTATION THEORY;

EID: 0036036761     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509957.509958     Document Type: Conference Paper

References (26)

1. A public-key cryptosystem with worst-case/average-case equivalence
2. How to go beyond the black-box simulation barrier
3. Resettably sound zero-knowledge and its applications
4. Timed commitments
5. Resettable zero-knowledge
6. Black-box concurrent zero-knowledge requires Ω̃(log n) rounds
7. Pricing via processing (or: combatting junk mail)
8. Zaps and their applications
9. Concurrent zero-knowledge
10. Concurrent zero-knowledge: Reducing the need for timing constraints
11. 2-round zero knowledge and proof auditors
12. Zero knowledge proofs of knowledge in two rounds
13. Witness indistinguishable and witness hiding protocols
14. Eliminating decryption errors in the Ajtai-Dwork cryptosystem
15. How to construct constant-round zero-knowledge proof systems for NP
16. On the composition of zero knowledge proof systems
17. Almost all primes can be quickly certified
18. Probabilistic encryption
19. The knowledge complexity of interactive proof systems
20. An efficient non-interactive zero-knowledge proof system for NP with general assumptions
21. Lower bounds for zero knowledge on the internet
22. On concurrent and resettable zero-knowledge proofs for NP
23. On the concurrent composition of zero-knowledge proofs
24. On data banks and privacy homomorphisms
25. A note on the round-complexity of concurrent zero-knowledge