- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c6 |      | Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer: Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. ITCS 2013: 401-414 |
| c5 | | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth: Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013: 315-333 |
| 2012 | ||
| c4 | | Nir Bitansky, Alessandro Chiesa: Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. CRYPTO 2012: 255-272 |
| c3 | | Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu: Mechanism design with approximate valuations. ITCS 2012: 34-38 |
| c2 | | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. ITCS 2012: 326-349 |
| i10 | | Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer: On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. Electronic Colloquium on Computational Complexity (ECCC) 19: 45 (2012) |
| i9 | | Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer: Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. IACR Cryptology ePrint Archive 2012: 71 (2012) |
| i8 | | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. IACR Cryptology ePrint Archive 2012: 95 (2012) |
| i7 | | Nir Bitansky, Alessandro Chiesa: Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits. IACR Cryptology ePrint Archive 2012: 461 (2012) |
| i6 | | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth: Succinct Non-Interactive Arguments via Linear Interactive Proofs. IACR Cryptology ePrint Archive 2012: 718 (2012) |
| 2011 | ||
| i5 | | Raluca A. Popa, Alessandro Chiesa, Tural Badirkhanli, Muriel Médard: Going Beyond Pollution Attacks: Forcing Byzantine Clients to Code Correctly. CoRR abs/1108.2080 (2011) |
| i4 | | Alessandro Chiesa, Michael A. Forbes: Improved Soundness for QMA with Multiple Provers. CoRR abs/1108.2098 (2011) |
| i3 | | |
| i2 | | Alessandro Chiesa, Michael A. Forbes: Improved Soundness for QMA with Multiple Provers. Electronic Colloquium on Computational Complexity (ECCC) 18: 110 (2011) |
| i1 | | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. IACR Cryptology ePrint Archive 2011: 443 (2011) |
| 2010 | ||
| c1 | | Alessandro Chiesa, Eran Tromer: Proof-Carrying Data and Hearsay Arguments from Signature Cards. ICS 2010: 310-331 |
Colors in the list of coauthors
Last update Sun May 19 01:00:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page