Alessandro Chiesa

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021

Subquadratic SNARGs in the Random Oracle Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Tight Security Bounds for Micali's SNARGs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Sumcheck Arguments and their Applications.

[BibT_eX]

[DOI]

Jonathan Bootle

Katerina Sotiraki

IACR Cryptol. ePrint Arch., 2021

A PCP Theorem for Interactive Proofs.

[BibT_eX]

[DOI]

Gal Arnon

IACR Cryptol. ePrint Arch., 2021

Post-Quantum Succinct Arguments.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

On Axis-Parallel Tests for Tensor Product Codes.

[BibT_eX]

[DOI]

Theory Comput., 2020

Barriers for Succinct Arguments in the Random Oracle Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Reducing Participation Costs via Incremental Verification for Ledger Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Proof-Carrying Data from Accumulation Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Proof-Carrying Data without Succinct Arguments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Zero-Knowledge Succinct Arguments with a Linear-Time Prover.

[BibT_eX]

[DOI]

Jonathan Bootle

Siqi Liu

IACR Cryptol. ePrint Arch., 2020

Linear-Time Arguments with Sublinear Verification from Tensor Codes.

[BibT_eX]

[DOI]

Jonathan Bootle

Jens Groth

IACR Cryptol. ePrint Arch., 2020

Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity.

[BibT_eX]

[DOI]

Tom Gur

Electron. Colloquium Comput. Complex., 2020

Recursive Proof Composition from Accumulation Schemes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019

On Cycles of Pairing-Friendly Elliptic Curves.

[BibT_eX]

[DOI]

Lynn Chua

Matthew Weidner

SIAM J. Appl. Algebra Geom., 2019

Fractal: Post-Quantum and Transparent Recursive Proofs from Holography.

[BibT_eX]

[DOI]

Dev Ojha

IACR Cryptol. ePrint Arch., 2019

Succinct Arguments in the Quantum Random Oracle Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

On the Impossibility of Probabilistic Proofs in Relativized Worlds.

[BibT_eX]

[DOI]

Siqi Liu

IACR Cryptol. ePrint Arch., 2019

Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Linear-Size Constant-Query IOPs for Delegating Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

On Local Testability in the Non-Signaling Setting.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

2018

DIZK: A Distributed Zero Knowledge Proof System.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Zexe: Enabling Decentralized Private Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Aurora: Transparent Succinct Arguments for R1CS.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Probabilistic Checking against Non-Signaling Strategies from Linearity Testing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Testing Linearity against Non-Signaling Strategies.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Oblix: An Efficient Oblivious Search Index.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

2017

The Hunting of the SNARK.

[BibT_eX]

[DOI]

J. Cryptol., 2017

Proofs of Proximity for Distribution Testing.

[BibT_eX]

[DOI]

Tom Gur

Electron. Colloquium Comput. Complex., 2017

A Zero Knowledge Sumcheck and its Applications.

[BibT_eX]

[DOI]

Michael A. Forbes

Electron. Colloquium Comput. Complex., 2017

Scalable Zero Knowledge Via Cycles of Elliptic Curves.

[BibT_eX]

[DOI]

Algorithmica, 2017

Zero Knowledge Protocols from Succinct Constraint Detection.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Interactive Oracle Proofs with Constant Rate and Query Complexity.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Decentralized Anonymous Micropayments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Interactive Oracle Proofs.

[BibT_eX]

[DOI]

Eli Ben-Sasson

IACR Cryptol. ePrint Arch., 2016

Computational integrity with a public random string from quasi-linear PCPs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

On Probabilistic Checking in Perfect Zero Knowledge.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

2015

Shorter arithmetization of nondeterministic computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Cluster Computing in Zero Knowledge.

[BibT_eX]

[DOI]

Eran Tromer

Madars Virza

IACR Cryptol. ePrint Arch., 2015

Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

2014

Succinct non-Interactive arguments.

[BibT_eX]

[DOI]

PhD thesis, 2014

Zerocash: Decentralized Anonymous Payments from Bitcoin.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Knightian Robustness of the Vickrey Mechanism.

[BibT_eX]

[DOI]

CoRR, 2014

Knightian Robustness of Single-Parameter Domains.

[BibT_eX]

[DOI]

CoRR, 2014

Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions.

[BibT_eX]

[DOI]

CoRR, 2014

Knightian Robustness from Regret Minimization.

[BibT_eX]

[DOI]

CoRR, 2014

Bridging Utility Maximization and Regret Minimization.

[BibT_eX]

[DOI]

CoRR, 2014

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture.

[BibT_eX]

[DOI]

Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

2013

Succinct Non-Interactive Arguments for a von Neumann Architecture.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Improved Soundness for QMA with Multiple Provers

[BibT_eX]

[DOI]

Michael A. Forbes

Chic. J. Theor. Comput. Sci., 2013

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

On the concrete efficiency of probabilistically-checkable proofs.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits.

[BibT_eX]

[DOI]

Nir Bitansky

IACR Cryptol. ePrint Arch., 2012

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Mechanism design with approximate valuations.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011

From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Knightian Auctions

[BibT_eX]

[DOI]

CoRR, 2011

Going Beyond Pollution Attacks: Forcing Byzantine Clients to Code Correctly

[BibT_eX]

[DOI]

CoRR, 2011

2010

Proof-Carrying Data and Hearsay Arguments from Signature Cards.

[BibT_eX]

[DOI]