Proof-Carrying Data and Hearsay Arguments from Signature Cards. - Alessandro Chiesa; Eran Tromer (ICS, 2010)

Going Beyond Pollution Attacks: Forcing Byzantine Clients to Code Correctly - Raluca A. Popa; Alessandro Chiesa; Tural Badirkhanli; Muriel Médard (CoRR, 2011)

Knightian Auctions - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2011)

From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Eran Tromer (IACR Cryptol. ePrint Arch., 2011)

Mechanism design with approximate valuations. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (ITCS, 2012)

On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. - Eli Ben-Sasson; Alessandro Chiesa; Daniel Genkin; Eran Tromer (Electron. Colloquium Comput. Complex., 2012)

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. - Eli Ben-Sasson; Alessandro Chiesa; Daniel Genkin; Eran Tromer (IACR Cryptol. ePrint Arch., 2012)

Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits. - Nir Bitansky; Alessandro Chiesa (IACR Cryptol. ePrint Arch., 2012)

Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Eran Tromer (IACR Cryptol. ePrint Arch., 2012)

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. - Eli Ben-Sasson; Alessandro Chiesa; Daniel Genkin; Eran Tromer (ITCS, 2013)

On the concrete efficiency of probabilistically-checkable proofs. - Eli Ben-Sasson; Alessandro Chiesa; Daniel Genkin; Eran Tromer (STOC, 2013)

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. - Nir Bitansky; Alessandro Chiesa; Yuval Ishai; Rafail Ostrovsky; Omer Paneth (TCC, 2013)

Improved Soundness for QMA with Multiple Provers - Alessandro Chiesa; Michael A. Forbes 001 (Chic. J. Theor. Comput. Sci., 2013)

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. - Eli Ben-Sasson; Alessandro Chiesa; Daniel Genkin; Eran Tromer; Madars Virza (IACR Cryptol. ePrint Arch., 2013)

Succinct Non-Interactive Arguments for a von Neumann Architecture. - Eli Ben-Sasson; Alessandro Chiesa; Eran Tromer; Madars Virza (IACR Cryptol. ePrint Arch., 2013)

Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (EC, 2014)

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. - Eli Ben-Sasson; Alessandro Chiesa; Eran Tromer; Madars Virza (USENIX Security Symposium, 2014)

Bridging Utility Maximization and Regret Minimization. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Robustness from Regret Minimization. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Robustness of Single-Parameter Domains. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Robustness of the Vickrey Mechanism. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Zerocash: Decentralized Anonymous Payments from Bitcoin. - Eli Ben-Sasson; Alessandro Chiesa; Christina Garman; Matthew Green 001; Ian Miers; Eran Tromer; Madars Virza (IACR Cryptol. ePrint Arch., 2014)

Succinct non-Interactive arguments. - Alessandro Chiesa (2014)

Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs. - Eli Ben-Sasson; Alessandro Chiesa; Matthew Green 001; Eran Tromer; Madars Virza (IEEE Symposium on Security and Privacy, 2015)

Cluster Computing in Zero Knowledge. - Alessandro Chiesa; Eran Tromer; Madars Virza (IACR Cryptol. ePrint Arch., 2015)

Shorter arithmetization of nondeterministic computations. - Alessandro Chiesa; Zeyuan Allen Zhu (Theor. Comput. Sci., 2015)

On Probabilistic Checking in Perfect Zero Knowledge. - Eli Ben-Sasson; Alessandro Chiesa; Michael A. Forbes 001; Ariel Gabizon; Michael Riabzev; Nicholas Spooner (Electron. Colloquium Comput. Complex., 2016)

Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. - Eli Ben-Sasson; Alessandro Chiesa; Ariel Gabizon; Michael Riabzev; Nicholas Spooner (Electron. Colloquium Comput. Complex., 2016)

Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. - Eli Ben-Sasson; Alessandro Chiesa; Ariel Gabizon; Madars Virza (Electron. Colloquium Comput. Complex., 2016)

Computational integrity with a public random string from quasi-linear PCPs. - Eli Ben-Sasson; Iddo Bentov; Alessandro Chiesa; Ariel Gabizon; Daniel Genkin; Matan Hamilis; Evgenya Pergament; Michael Riabzev; Mark Silberstein; Eran Tromer; Madars Virza (IACR Cryptol. ePrint Arch., 2016)

Interactive Oracle Proofs. - Eli Ben-Sasson; Alessandro Chiesa; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2016)

Decentralized Anonymous Micropayments. - Alessandro Chiesa; Matthew Green 001; Jingcheng Liu 001; Peihan Miao 001; Ian Miers; Pratyush Mishra (IACR Cryptol. ePrint Arch., 2016)

Interactive Oracle Proofs with Constant Rate and Query Complexity. - Eli Ben-Sasson; Alessandro Chiesa; Ariel Gabizon; Michael Riabzev; Nicholas Spooner (ICALP, 2017)

Zero Knowledge Protocols from Succinct Constraint Detection. - Eli Ben-Sasson; Alessandro Chiesa; Michael A. Forbes 001; Ariel Gabizon; Michael Riabzev; Nicholas Spooner (TCC (2), 2017)

Scalable Zero Knowledge Via Cycles of Elliptic Curves. - Eli Ben-Sasson; Alessandro Chiesa; Eran Tromer; Madars Virza (Algorithmica, 2017)

A Zero Knowledge Sumcheck and its Applications. - Alessandro Chiesa; Michael A. Forbes 001; Nicholas Spooner (Electron. Colloquium Comput. Complex., 2017)

Proofs of Proximity for Distribution Testing. - Alessandro Chiesa; Tom Gur (Electron. Colloquium Comput. Complex., 2017)

On Axis-Parallel Tests for Tensor Product Codes. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2017)

The Hunting of the SNARK. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Shafi Goldwasser; Huijia Lin; Aviad Rubinstein; Eran Tromer (J. Cryptol., 2017)

Oblix: An Efficient Oblivious Search Index. - Pratyush Mishra; Rishabh Poddar; Jerry Chen; Alessandro Chiesa; Raluca Ada Popa (IEEE Symposium on Security and Privacy, 2018)

Spatial Isolation Implies Zero Knowledge Even in a Quantum World. - Alessandro Chiesa; Michael A. Forbes 001; Tom Gur; Nicholas Spooner (Electron. Colloquium Comput. Complex., 2018)

Testing Linearity against Non-Signaling Strategies. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2018)

Probabilistic Checking against Non-Signaling Strategies from Linearity Testing. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2018)

Aurora: Transparent Succinct Arguments for R1CS. - Eli Ben-Sasson; Alessandro Chiesa; Michael Riabzev; Nicholas Spooner; Madars Virza; Nicholas P. Ward (IACR Cryptol. ePrint Arch., 2018)

Zexe: Enabling Decentralized Private Computation. - Sean Bowe; Alessandro Chiesa; Matthew Green 001; Ian Miers; Pratyush Mishra; Howard Wu (IACR Cryptol. ePrint Arch., 2018)

DIZK: A Distributed Zero Knowledge Proof System. - Howard Wu; Wenting Zheng; Alessandro Chiesa; Raluca Ada Popa; Ion Stoica (IACR Cryptol. ePrint Arch., 2018)

On Local Testability in the Non-Signaling Setting. - Alessandro Chiesa; Peter Manohar; Igor Shinkar (Electron. Colloquium Comput. Complex., 2019)

Linear-Size Constant-Query IOPs for Delegating Computation. - Eli Ben-Sasson; Alessandro Chiesa; Lior Goldberg; Tom Gur; Michael Riabzev; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2019)

Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. - Alessandro Chiesa; Yuncong Hu; Mary Maller; Pratyush Mishra; Psi Vesely; Nicholas P. Ward (IACR Cryptol. ePrint Arch., 2019)

On the Impossibility of Probabilistic Proofs in Relativized Worlds. - Alessandro Chiesa; Siqi Liu 005 (IACR Cryptol. ePrint Arch., 2019)

Succinct Arguments in the Quantum Random Oracle Model. - Alessandro Chiesa; Peter Manohar; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2019)

Fractal: Post-Quantum and Transparent Recursive Proofs from Holography. - Alessandro Chiesa; Dev Ojha; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2019)

On Cycles of Pairing-Friendly Elliptic Curves. - Alessandro Chiesa; Lynn Chua; Matthew Weidner (SIAM J. Appl. Algebra Geom., 2019)

Recursive Proof Composition from Accumulation Schemes. - Benedikt Bünz; Alessandro Chiesa; Pratyush Mishra; Nicholas Spooner (TCC (2), 2020)

Linear-Time Arguments with Sublinear Verification from Tensor Codes. - Jonathan Bootle; Alessandro Chiesa; Jens Groth (IACR Cryptol. ePrint Arch., 2020)

Zero-Knowledge Succinct Arguments with a Linear-Time Prover. - Jonathan Bootle; Alessandro Chiesa; Siqi Liu 005 (IACR Cryptol. ePrint Arch., 2020)

Proof-Carrying Data without Succinct Arguments. - Benedikt Bünz; Alessandro Chiesa; William Lin; Pratyush Mishra; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2020)

Proof-Carrying Data from Accumulation Schemes. - Benedikt Bünz; Alessandro Chiesa; Pratyush Mishra; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2020)

Reducing Participation Costs via Incremental Verification for Ledger Systems. - Weikeng Chen; Alessandro Chiesa; Emma Dauterman; Nicholas P. Ward (IACR Cryptol. ePrint Arch., 2020)

Barriers for Succinct Arguments in the Random Oracle Model. - Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2020)

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier. - Alessandro Chiesa; Fermi Ma; Nicholas Spooner; Mark Zhandry (FOCS, 2021)

Post-Quantum Succinct Arguments. - Alessandro Chiesa; Fermi Ma; Nicholas Spooner; Mark Zhandry (Electron. Colloquium Comput. Complex., 2021)

A PCP Theorem for Interactive Proofs. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2021)

Sumcheck Arguments and their Applications. - Jonathan Bootle; Alessandro Chiesa; Katerina Sotiraki (IACR Cryptol. ePrint Arch., 2021)

Tight Security Bounds for Micali's SNARGs. - Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2021)

Subquadratic SNARGs in the Random Oracle Model. - Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2021)

A PCP Theorem for Interactive Proofs and Applications. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (EUROCRYPT (2), 2022)

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier. - Jonathan Bootle; Alessandro Chiesa; Siqi Liu 005 (EUROCRYPT (2), 2022)

A Toolbox for Barriers on Interactive Oracle Proofs. - Gal Arnon; Amey Bhangale; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field. - Jonathan Bootle; Alessandro Chiesa; Ziyi Guan; Siqi Liu 005 (IACR Cryptol. ePrint Arch., 2022)

Gemini: Elastic SNARKs for Diverse Environments. - Jonathan Bootle; Alessandro Chiesa; Yuncong Hu; Michele Orrù (IACR Cryptol. ePrint Arch., 2022)

On Succinct Non-Interactive Arguments in Relativized Worlds. - Megan Chen; Alessandro Chiesa; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2022)

Succinct Non-Interactive Arguments via Linear Interactive Proofs. - Nir Bitansky; Alessandro Chiesa; Yuval Ishai; Rafail Ostrovsky; Omer Paneth (J. Cryptol., 2022)

Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. - Alessandro Chiesa; Tom Gur; Igor Shinkar (SIAM J. Comput., 2022)

Eos: Efficient Private Delegation of zkSNARK Provers. - Alessandro Chiesa; Ryan Lehmkuhl; Pratyush Mishra; Yinuo Zhang (USENIX Security Symposium, 2023)

IOPs with Inverse Polynomial Soundness Error. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2023)

Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. - Jonathan Bootle; Alessandro Chiesa; Katerina Sotiraki (IACR Cryptol. ePrint Arch., 2023)

Proof-Carrying Data From Arithmetized Random Oracles. - Megan Chen; Alessandro Chiesa; Tom Gur; Jack O'Connor; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2023)

Concrete Security for Succinct Arguments from Vector Commitments. - Alessandro Chiesa; Marcel Dall'Agnol; Ziyi Guan; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2023)

Security Bounds for Proof-Carrying Data from Straightline Extractors. - Alessandro Chiesa; Ziyi Guan; Shahar Samocha; Eylon Yogev (IACR Cryptol. ePrint Arch., 2023)

On Parallel Repetition of PCPs. - Alessandro Chiesa; Ziyi Guan; Burcu Yildiz (IACR Cryptol. ePrint Arch., 2023)

STIR: Reed-Solomon Proximity Testing with Fewer Queries. - Gal Arnon; Alessandro Chiesa; Giacomo Fenzi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification. - Gal Arnon; Alessandro Chiesa; Giacomo Fenzi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Relativized Succinct Arguments in the ROM Do Not Exist. - Annalisa Barbara; Alessandro Chiesa; Ziyi Guan (IACR Cryptol. ePrint Arch., 2024)

Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. - Alessandro Chiesa; Marcel Dall'Agnol; Ziyi Guan; Nicholas Spooner; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

zkSNARKs in the ROM with Unconditional UC-Security. - Alessandro Chiesa; Giacomo Fenzi (IACR Cryptol. ePrint Arch., 2024)

A Time-Space Tradeoff for the Sumcheck Prover. - Alessandro Chiesa; Elisabetta Fedele; Giacomo Fenzi; Andrew Zitek-Estrada (IACR Cryptol. ePrint Arch., 2024)

Time-Space Trade-Offs for Sumcheck. - Anubhav Baweja; Alessandro Chiesa; Elisabetta Fedele; Giacomo Fenzi; Pratyush Mishra; Tushar Mopuri; Andrew Zitek-Estrada (IACR Cryptol. ePrint Arch., 2025)

Linear-Time Accumulation Schemes. - Benedikt Bünz; Alessandro Chiesa; Giacomo Fenzi; William Wang (IACR Cryptol. ePrint Arch., 2025)

Quantum Rewinding for IOP-Based Succinct Arguments. - Alessandro Chiesa; Marcel Dall'Agnol; Zijing Di; Ziyi Guan; Nicholas Spooner (IACR Cryptol. ePrint Arch., 2025)

On the Fiat-Shamir Security of Succinct Arguments from Functional Commitments. - Alessandro Chiesa; Ziyi Guan; Christian Knabenhans; Zihan Yu (IACR Cryptol. ePrint Arch., 2025)

A Fiat-Shamir Transformation From Duplex Sponges. - Alessandro Chiesa; Michele Orrù (IACR Cryptol. ePrint Arch., 2025)