#### DMCA

## How to Construct Constant-Round Zero-Knowledge Proof Systems for NP (1995)

Venue: | Journal of Cryptology |

Citations: | 162 - 8 self |

### Citations

1233 | The knowledge complexity of interactive proof systems - GOLDWASSER, MICALI, et al. - 1989 |

952 | A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks - Goldwasser, Micali, et al. - 1988 |

853 | Pseudorandom generators from any oneway function", 21st STOC - Levin, Luby - 1989 |

418 | Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems - Goldreich, Micali, et al. - 1991 |

339 | Minimum Disclosure Proofs of Knowledge - Brassard, Chaum, et al. - 1988 |

271 | Bit commitment using pseudorandomness - Naor - 1991 |

210 | Robust NonInteractive Zero Knowledge - Santis, Crescenzo, et al. - 2001 |

207 | On the Composition of Zero-Knowledge Proof Systems - Goldreich, Krawczyk - 1996 |

172 | A note on efficient zero-knowledge proofs and arguments - Kilian - 1992 |

111 | Zero-Knowledge Proofs of Knowledge in Two Rounds - Feige, Shamir - 1990 |

89 | Knowledge complexity of interactive proofs - Goldwasser, Micali, et al. - 1985 |

76 | A uniform complexity treatment of encryption and zero-knowledge - Goldreich - 1993 |

67 |
Hard-core predicates for any one-way function
- Goldreich, Levin
- 1989
(Show Context)
Citation Context ...n to exist provided that one-way functions exist [ 14], [ 13]. A much simpler commitment scheme can be constructed using any one-ways174 O. Goldreich and A. Kahan permutation f . Using the results in =-=[9]-=-, we may assume without loss of generality that the permutation f has a hard-core predicate, denoted b. Construction 1 (Simple Bit Commitment). Let f : {0, 1}* ~ {0, 1}* be a one-way permutation, and ... |

55 | Pseudo-random generators under Uniform Assumptions - Hastad - 1990 |

44 | Constant-round perfect zeroknowledge computationally convincing protocols - Brassard, Crépeau, et al. - 1991 |

43 | Coin Flipping by Phone - Blum - 1982 |

29 | Discrete logarithm implementation of perfect zero-knowledge blobs - Boyar, Kurtz, et al. - 1990 |

10 | On the complexity of bounded-interaction and non-interactive zero-knowledge proofs - Kilian - 1994 |

8 | A Hard-Core Predicate to any One-Way Function", 21st STOC - Goldreich, Levin - 1989 |

1 |
On the C•mp•siti•n •f Zer•-Kn•w•edge Pr••f Systems
- G••dreich, Krawcyzk•
- 1996
(Show Context)
Citation Context ..., the protocol which results from parallel execution of the basic protocol, sufficiently many times, cannot be proven zero-knowledge using a universal simulator which uses the verifier as a black-box =-=[8]-=-. We note that all known zero-knowledge protocols are proven to be zero-knowledge using such a universal simulator, and, furthermore, that it is hard to conceive an alternative way of proving that a p... |