From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

@inproceedings{Bitansky2011FromEC,
  title={From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again},
  author={Nir Bitansky and Ran Canetti and Alessandro Chiesa and Eran Tromer},
  booktitle={ITCS},
  year={2011}
}
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-sound proofs where the verifier's work is essentially independent of the complexity of the NP nondeterministic verifier) has been an intriguing question for the past two decades. Other than CS proofs in the random oracle model [Micali, FOCS '94], the only existing candidate construction is based on an elaborate assumption that is tailored to a specific protocol [Di Crescenzo and Lipmaa, CiE '08… CONTINUE READING
Highly Cited
This paper has 221 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 141 extracted citations

222 Citations

02040'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 222 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…