Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 658 LNCS, Issue , 1993, Pages 341-355

  Damgård, Ivan ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Commitment scheme; Hash function; Proof system; Random string; Satisfying assignment

Indexed keywords

HASH FUNCTIONS; PROGRAMMABLE LOGIC CONTROLLERS; TIMING CIRCUITS;

COMMITMENT SCHEME; NON-INTERACTIVE PROTOCOLS; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; PERFECT ZERO-KNOWLEDGE; PROOF SYSTEM; RANDOM STRING; SATISFYING ASSIGNMENTS; STATISTICAL ZERO KNOWLEDGE;

NETWORK PROTOCOLS;

EID: 84957705311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47555-9_28     Document Type: Conference Paper

References (20)

1. Brassard, Chaum and Crépeau: “Minimum Disclosure Proofs of Knowledge”, JCSS, vol. 37 (1988) pp. 156–189.
2. Blum, Feldman and Micali: “Non-intercative Zero-Knowledge Proof Systems and Applications”, Proceedings of STOC 88.
3. Boyar, Krentel and Kurtz: “A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs”, J. Cryptology, vol 2, no.2.
4. Chaum, Damgård and van de Graaf: “Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result”, Proc. of Crypto 87, Springer Verlag.
5. Damgård: “On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs”, Proc. of Crypto 89.
6. Damgård: “A Design Principle for Hash Functions”, Proc. of Crypto 89.
7. Fiat, Feige and Shamir: “Zero-Knowledge Proofs of Identity” J. Cryptology, vol 1, pp. 77–94.
8. Feige and Shamir: “Zero-Knowledge Proofs of Knowledge in two Rounds”, Proc. of Crypto 90.
9. Feige, Lapidot and Shamir: “Multiple Non-Interactive Zero-Knowledge Proof based on a Single Random String”, Proc. of FOCS 90.
10. Fortnow: “The Complexity of Perfect Zero-Knowledge”, Proc. of STOC 87.
11. Goldwasser and Micali: “Probabilistic Encryption”, JCSS, vol.28 (1984), pp.270–299.
12. Goldwasser, Micali and Rackoff: “The Knowledge Complexity of Interactive Proof Systems”, Proc. of STOC 85.
13. Killian, Micali and Ostrovski: “Minimum Resource Zero-knowledge Proofs”, Proc. of Crypto 89.
14. A Lapidot and D Shamir: “Publicly Verifiable Non-Interactive Zero-Knowledge Proofs”, Proc. of Crypto 90.
15. Naor: “Bit Commitments using Pseudo-Randomness”, Proc. of Crypto 89.
16. Naor and Impagliazzo: “Efficient Cryptographic Schemes Provavbly as Secure as Subset Sum”, Proc. of STOC 89.
17. Naor and Yung: “Universal One-Way Hash Functions and their Cryptographic Applications”, Proc. of STOC 90.
18. Blum, De Santis, Micali and Persiano: “Non-Interactive Zero-Knowledge”, SIAM J. Computing, Vol.20, no.6, 1991.
19. De Santis, Micali and A Persiano: “Non-Interactive Zero-knowledge with Preprocessing”, Proc. of Crypto 88.
20. De Santis and Persiano: “Public-Randomness in Public-Key Cryptography”, Proc. of EuroCrypt 90.