I am an associate professor in the EECS Department at UC Berkeley,
affiliated with the Theory and Security research groups.
I am an author of several zkSNARK libraries (such as libsnark) and arkworks.
I am a coinventor of Zerocash, cofounder of Zcash, and cofounder of StarkWare Industries.
My work has been recognized by a Sloan Research Fellowship (2021), an Okawa Foundation Research Grant (2020), a nomination in MIT's TR35 (2018), and Google Faculty Research Awards (2018 and 2017).
Please use this bio and photo for announcements.
Research interests: I am broadly interested in Theoretical Computer Science and Computer Security. Specific interests include theoretical and applied cryptography, complexity theory, privacyenhancing technologies, and quantum information.
[P5] 
A PCP Theorem for Interactive Proofs
Gal Arnon,
Alessandro Chiesa,
Eylon Yogev
Cryptology ePrint Archive,
Report 2021/915


[P4] 
PostQuantum Succinct Arguments
Cryptology ePrint Archive,
Report 2021/334


[P3] 
Tight Security Bounds for Micali’s SNARGs
Alessandro Chiesa,
Eylon Yogev
Cryptology ePrint Archive,
Report 2021/188


[P2] 
ZeroKnowledge Succinct Arguments with a LinearTime Prover
Jonathan Bootle,
Alessandro Chiesa,
Siqi Liu
Cryptology ePrint Archive,
Report 2020/1527


[P1] 
Reducing Participation Costs via Incremental Verification for Ledger Systems
Cryptology ePrint Archive,
Report 2020/1522


[C44] 
Sumcheck Arguments and their Applications
Jonathan Bootle,
Alessandro Chiesa,
Katerina Sotiraki
CRYPTO 2021
(41st International Cryptology Conference)


[C43] 
Subquadratic SNARGs in the Random Oracle Model
Alessandro Chiesa,
Eylon Yogev
CRYPTO 2021
(41st International Cryptology Conference)


[C42] 
ProofCarrying Data without Succinct Arguments
CRYPTO 2021
(41st International Cryptology Conference)


[C41] 
ProofCarrying Data from Accumulation Schemes
TCC 2020
(18th Theory of Cryptography Conference)


[C40] 
Barriers for Succinct Arguments in the Random Oracle Model
Alessandro Chiesa,
Eylon Yogev
TCC 2020
(18th Theory of Cryptography Conference)


[C39] 
LinearTime Arguments with Sublinear Verification from Tensor Codes
Jonathan Bootle,
Alessandro Chiesa,
Jens Groth
TCC 2020
(18th Theory of Cryptography Conference)


[C38] 
Fractal: PostQuantum and Transparent Recursive Proofs from Holography
Alessandro Chiesa,
Dev Ojha,
Nicholas Spooner
EUROCRYPT 2020
(39th International Conference on the Theory and Applications of Cryptographic Techniques)


[C37] 
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
EUROCRYPT 2020
(39th International Conference on the Theory and Applications of Cryptographic Techniques)


[C36] 
On the Impossibility of Probabilistic Proofs in Relativized Worlds
Alessandro Chiesa,
Siqi Liu
ITCS 2020
(11th Conference on Innovations in Theoretical Computer Science)


[C35] 
On Local Testability in the NonSignaling Setting
Alessandro Chiesa,
Peter Manohar,
Igor Shinkar
ITCS 2020
(11th Conference on Innovations in Theoretical Computer Science)


[C34] 
ZEXE: Enabling Decentralized Private Computation
S&P 2020
(41st IEEE Symposium on Security and Privacy)


[C33] 
Relaxed Locally Correctable Codes with NearlyLinear Block Length and Constant Query Complexity
Alessandro Chiesa,
Tom Gur,
Igor Shinkar
SODA 2020
(31st Symposium on Discrete Algorithms)


[C32] 
Succinct Arguments in the Quantum Random Oracle Model
Alessandro Chiesa,
Peter Manohar,
Nicholas Spooner
TCC 2019
(17th Theory of Cryptography Conference)
QIP 2020
(23rd Conference on Quantum Information Processing)


[C31] 
LinearSize ConstantQuery IOPs for Delegating Computation
TCC 2019
(17th Theory of Cryptography Conference)


[C30] 
Aurora: Transparent Succinct Arguments for R1CS
Eli BenSasson,
Alessandro Chiesa,
Michael Riabzev,
Nicholas Spooner,
Madars Virza,
Nicholas P. Ward
EUROCRYPT 2019
(38th International Conference on the Theory and Applications of Cryptographic Techniques)


[C29] 
Probabilistic Checking against NonSignaling Strategies from Linearity Testing
Alessandro Chiesa,
Peter Manohar,
Igor Shinkar
ITCS 2019
(10th Conference on Innovations in Theoretical Computer Science)


[C28] 
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
FOCS 2018
(59th IEEE Symposium on Foundations of Computer Science)
QIP 2019
(22nd Conference on Quantum Information Processing)


[C27] 
DIZK: A Distributed Zero Knowledge Proof System
USENIX Security 2018
(27th USENIX Security Symposium)


[C26] 
Testing Linearity against NonSignaling Strategies
Alessandro Chiesa,
Peter Manohar,
Igor Shinkar
CCC 2018
(33rd Computational Complexity Conference)


[C25] 
Oblix: An Efficient Oblivious Search Index
S&P 2018
(39th IEEE Symposium on Security and Privacy)


[C24] 
Proofs of Proximity for Distribution Testing
Alessandro Chiesa,
Tom Gur
ITCS 2018
(9th Conference on Innovations in Theoretical Computer Science)


[C23] 
Zero Knowledge Protocols from Succinct Constraint Detection
Eli BenSasson,
Alessandro Chiesa,
Michael A. Forbes,
Ariel Gabizon,
Michael Riabzev,
Nicholas Spooner
TCC 2017
(15th Theory of Cryptography Conference)


[C22] 
On AxisParallel Tests for Tensor Product Codes
Alessandro Chiesa,
Peter Manohar,
Igor Shinkar
RANDOM 2017
(21st International Workshop on Randomization and Computation)


[C21] 
Interactive Oracle Proofs with Constant Rate and Query Complexity
ICALP 2017
(44th International Colloquium on Automata, Languages, and Programming)


[C20] 
Decentralized Anonymous Micropayments
EUROCRYPT 2017
(36th International Conference on the Theory and Applications of Cryptographic Techniques)


[C19] 
Computational Integrity with a Public Random String from Quasilinear PCPs
Eli BenSasson,
Iddo BenTov,
Alessandro Chiesa,
Ariel Gabizon,
Daniel Genkin,
Matan Hamilis,
Evgenya Pergament,
Michael Riabzev,
Mark Silberstein,
Eran Tromer,
Madars Virza
EUROCRYPT 2017
(36th International Conference on the Theory and Applications of Cryptographic Techniques)


[C18] 
Interactive Oracle Proofs
Eli BenSasson,
Alessandro Chiesa,
Nicholas Spooner
TCC 2016B
(14th Theory of Cryptography Conference)


[C17] 
QuasilinearSize Zero Knowledge from LinearAlgebraic PCPs
TCC 2016A
(13th Theory of Cryptography Conference)


[C16] 
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs
S&P 2015
(36th IEEE Symposium on Security and Privacy)


[C15] 
Cluster Computing in Zero Knowledge
Alessandro Chiesa,
Eran Tromer,
Madars Virza
EUROCRYPT 2015
(34th International Conference on the Theory and Applications of Cryptographic Techniques)


[C14] 
Scalable Zero Knowledge via Cycles of Elliptic Curves
CRYPTO 2014
(34th International Cryptology Conference)


[C13] 
Succinct NonInteractive Zero Knowledge for a von Neumann Architecture
USENIX Security 2014
(23rd USENIX Security Symposium)


[C12] 
Knightian Self Uncertainty in the VCG Mechanism for Unrestricted Combinatorial Auctions
Alessandro Chiesa,
Silvio Micali,
Zeyuan Allen Zhu
EC 2014
(15th ACM Conference on Economics and Computation)


[C11] 
Zerocash: Decentralized Anonymous Payments from Bitcoin
Eli BenSasson,
Alessandro Chiesa,
Christina L. Garman,
Matthew D. Green,
Ian Miers,
Eran Tromer,
Madars Virza
S&P 2014
(35th IEEE Symposium on Security and Privacy)


[C10] 
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
CRYPTO 2013
(33rd International Cryptology Conference)


[C09] 
On the Concrete Efficiency of ProbabilisticallyCheckable Proofs
STOC 2013
(45th ACM Symposium on the Theory of Computing)


[C08] 
Recursive Composition and Bootstrapping for SNARKs and ProofCarrying Data
STOC 2013
(45th ACM Symposium on the Theory of Computing)


[C07] 
Succinct NonInteractive Arguments via Linear Interactive Proofs
TCC 2013
(10th Theory of Cryptography Conference)


[C06] 
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems
ITCS 2013
(4th Conference on Innovations in Theoretical Computer Science)


[C05] 
Succinct Arguments from MultiProver Interactive Proofs and their Efficiency Benefits
Nir Bitansky,
Alessandro Chiesa
CRYPTO 2012
(32nd International Cryptology Conference)


[C04] 
From Extractable Collision Resistance to Succinct NonInteractive Arguments of Knowledge, and Back Again
ITCS 2012
(3rd Conference on Innovations in Theoretical Computer Science)


[C03] 
Mechanism Design with Approximate Valuations
Alessandro Chiesa,
Silvio Micali,
Zeyuan Allen Zhu
ITCS 2012
(3rd Conference on Innovations in Theoretical Computer Science)


[C02] 
ProofCarrying Data and Hearsay Arguments from Signature Cards
Alessandro Chiesa,
Eran Tromer
ITCS 2010
(1st Conference on Innovations in Theoretical Computer Science)


[C01] 
A Security Analysis of the Boston T
Zackary Anderson,
Alessandro Chiesa,
Samuel McVeety,
Russell Ryan
DEF CON 16
(hacker convention in Las Vegas in 2008)


[J09] 
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
Journal of the ACM,
to appear


[J08] 
On AxisParallel Tests for Tensor Product Codes
Alessandro Chiesa,
Peter Manohar,
Igor Shinkar
Theory of Computing Journal,
Volume 6, Article 5, September 2020


[J07] 
Testing Linearity against NonSignaling Strategies
Alessandro Chiesa,
Peter Manohar,
Igor Shinkar
ACM Transactions on Computation Theory,
Volume 12, Issue 3, May 2020


[J06] 
On Cycles of PairingFriendly Elliptic Curves
Alessandro Chiesa,
Lynn Chua,
Matthew Weidner
SIAM Journal on Applied Algebra and Geometry,
Volume 3, Issue 2, pages 175–192, April 2019


[J05] 
Scalable Zero Knowledge via Cycles of Elliptic Curves
Algorithmica,
Volume 79, Issue 4, pages 11021160, December 2017


[J04] 
The Hunting of the SNARK
Nir Bitansky,
Ran Canetti,
Alessandro Chiesa,
Shafi Goldwasser,
Huijia Lin,
Aviad Rubinstein,
Eran Tromer
Journal of Cryptology,
Volume 30, Issue 4, pages 9891066, October 2017


[J03] 
Knightian Analysis of the Vickrey Mechanism
Alessandro Chiesa,
Silvio Micali,
Zeyuan Allen Zhu
Econometrica,
Volume 83, Issue 5, pages 17271754, September 2015


[J02] 
Improved Soundness for QMA with Multiple Provers
Alessandro Chiesa,
Michael A. Forbes


[J01] 
Proofcarrying data: Secure computation on untrusted platforms
Alessandro Chiesa,
Eran Tromer
The Next Wave: The NSA's review of emerging technologies,
Vol.19, No.2, 2012


[T2] 
Succinct NonInteractive Arguments
Ph.D. thesis (September 2014)
MIT EECS Department
Advised by Prof. Silvio Micali


[T1] 
ProofCarrying Data
M.Eng. thesis (June 2010)
MIT EECS Department
Advised by Prof. Ronald L. Rivest and Prof. Eran Tromer


I joined UC Berkeley's faculty in the summer of 2015.
Prior to that, I spent one year as a postdoctoral researcher at ETH Zürich; my host was Prof. Thomas Holenstein.
I earned my Ph.D. in the Theory of Computation group in CSAIL at MIT; my doctoral thesis advisor was Prof. Silvio Micali.
I earned my M.Eng. in the same group; my master's thesis advisors were Prof. Eran Tromer and Prof. Ron Rivest.
I earned my S.B. in Mathematics and my S.B. in Computer Science at MIT; outside of classes and labs, I rowed for the heavyweight varsity crew team at MIT.
A list of my old coursework while at MIT can be found here.
Before coming to MIT, I lived in Varese, Italy, where I was born in 1987. While in Italy, I attended the European School of Varese from kindergarten through high school; this school is part of the system of European Schools, which awards students the European Baccalaureate.
I enjoy many outdoor sports, including biking, climbing, mountaineering, and running.
The best way to contact me is via the email at the top of this page.
My office is located in 683 Soda Hall.