Resettably-sound zero-knowledge and its applications

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 116-125

  Barak, B ^a   Goldreich, O ^a   Goldwasser, S ^a   Lindell, Y ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; RANDOM PROCESSES;

BLACK-BOX SIMULATORS;

CRYPTOGRAPHY;

EID: 0035163053     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. On defining proofs of knowledge
2. Certifying permutations: Non-interactive zero-knowledge based on any trapdoor permutation
3. Resettable zero-knowledge
4. Efficient concurrent zeroknowledge in the auxiliary string model
5. Non-malleable cryptography
6. Zaps and their applications
7. Zero-knowledge proofs of identity
8. Multiple non-interactive zero-knowledge proofs under general assumptions
9. Witness indistinguishability and witness hiding protocols
10. How to prove yourself: Practical solution to identification and signature problems
11. On completeness and soundness in interactive proof systems
12. How to construct random functions
13. How to construct constant-round zero-knowledge proof systems for NP
14. On the composition of zero-knowledge proof systems
15. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
16. Definitions and properties of zero-knowledge proof systems
17. The knowledge complexity of interactive proof systems
18. Concurrent and resettable zero-knowledge in poly-logarithmic rounds
19. Min-round resettable zero-knowledge in the public-key model
20. Soundness in the public-key model
21. On the concurrent composition of zero-knowledge proofs