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

@inproceedings{Bitansky2012FromEC,
  title={From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again},
  author={Nir Bitansky and R. Canetti and A. Chiesa and Eran Tromer},
  booktitle={ITCS '12},
  year={2012}
}
  • Nir Bitansky, R. Canetti, +1 author Eran Tromer
  • Published in ITCS '12 2012
  • Computer Science
  • 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
    The Hunting of the SNARK
    85
    Succinct non-Interactive arguments
    1
    Interactive Oracle Proofs
    83
    Lattice-Based zk-SNARKs from Square Span Programs
    15
    On the Size of Pairing-Based Non-interactive Arguments
    169

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 90 REFERENCES

    Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

    To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=2090263.