Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Nir Bitansky, Alessandro Chiesa. Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. In Reihaneh Safavi-Naini, Ran Canetti, editors, Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings. Volume 7417 of Lecture Notes in Computer Science, pages 255-272, Springer, 2012. [doi]

The following publications are possibly variants of this publication:

Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency BenefitsNir Bitansky, Alessandro Chiesa. iacr, 2012:461, 2012. [doi]

Succinct Non-Interactive Arguments via Linear Interactive ProofsNir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth. iacr, 2012:718, 2012. [doi]

Succinct Non-Interactive Arguments via Linear Interactive ProofsNir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth. joc, 35(3):15, 2022. [doi]

Succinct Non-interactive Arguments via Linear Interactive ProofsNir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth. In TCC. 2013: 315-333 [doi]

Erratum: Succinct Non-interactive Arguments via Linear Interactive ProofsNir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth. In TCC. 2013: [doi]

runs on WebDSL