2026 Alessandro Chiesa: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	30	13827	13405	218	217	97	9721

Overview

Alessandro Chiesa is affiliated with the École Polytechnique Fédérale de Lausanne in Switzerland. Their research primarily focuses on areas within computer science, particularly in cryptography and computational theory.

Their work spans several main fields and subfields of study, including:

Computer Science
Artificial Intelligence
Computational Theory and Mathematics
Information Systems
Computer Networks and Communications
Computer Vision and Pattern Recognition

Chiesa's research topics are concentrated around cryptography and data security, as well as related computational and theoretical aspects of computer science. The main topics they have covered include:

Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptographic Implementations and Security
Security and Verification in Computing
Blockchain Technology Applications and Security
Logic, Programming, and Type Systems
Logic, Reasoning, and Knowledge

Their frequent co-authors reflect a collaboration pattern with notable researchers such as:

Eylon Yogev
Nicholas Spooner
Jonathan Bootle
Gal Arnon
Giacomo Fenzi

Chiesa has published articles in several academic venues, with a concentration in lecture notes and journals related to cryptology and theoretical computer science. Frequent publication venues include:

Lecture Notes in Computer Science
Journal of Cryptology
SIAM Journal on Computing
Journal of the ACM
ACM Transactions on Computation Theory

Some recent papers by Alessandro Chiesa include:

Succinct Non-Interactive Arguments via Linear Interactive Proofs, 2022, Journal of Cryptology
Fractal: Post-quantum and Transparent Recursive Proofs from Holography, 2020, Lecture Notes in Computer Science
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity, 2022, SIAM Journal on Computing
Spatial Isolation Implies Zero Knowledge Even in a Quantum World, 2022, Journal of the ACM
Testing Linearity against Non-signaling Strategies, 2020, ACM Transactions on Computation Theory

Best Publications

Zerocash: Decentralized Anonymous Payments from Bitcoin

Eli Ben Sasson;Alessandro Chiesa;Christina Garman;Matthew Green

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

Eli Ben-Sasson;Alessandro Chiesa;Daniel Genkin;Eran Tromer

752
Citations
SNARKs for C : verifying program executions succinctly and in zero knowledge

Eli Ben-Sasson;Alessandro Chiesa;Daniel Genkin;Eran Tromer

752
Citations
Succinct non-interactive zero knowledge for a von Neumann architecture

Eli Ben-Sasson;Alessandro Chiesa;Eran Tromer;Madars Virza

596
Citations
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

Nir Bitansky;Ran Canetti;Alessandro Chiesa;Eran Tromer

582
Citations
Succinct non-interactive arguments via linear interactive proofs

Nir Bitansky;Alessandro Chiesa;Yuval Ishai;Omer Paneth

379
Citations
Aurora: Transparent Succinct Arguments for R1CS

Eli Ben-Sasson;Alessandro Chiesa;Michael Riabzev;Nicholas Spooner

370
Citations
Recursive composition and bootstrapping for SNARKS and proof-carrying data

Nir Bitansky;Ran Canetti;Alessandro Chiesa;Eran Tromer

350
Citations
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS

Alessandro Chiesa;Yuncong Hu;Mary Maller;Pratyush Mishra

343
Citations
Scalable Zero Knowledge Via Cycles of Elliptic Curves

Eli Ben-Sasson;Alessandro Chiesa;Eran Tromer;Madars Virza

320
Citations
Interactive Oracle Proofs

Eli Ben-Sasson;Alessandro Chiesa;Nicholas Spooner

298
Citations
Zerocash: Decentralized Anonymous Payments from Bitcoin.

Eli Ben-Sasson;Alessandro Chiesa;Christina Garman;Matthew Green

278
Citations
Scalable Zero Knowledge Via Cycles of Elliptic Curves

Eli Ben-Sasson;Alessandro Chiesa;Eran Tromer;Madars Virza

240
Citations
The Hunting of the SNARK

Unknown

230
Citations
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

Eli Ben-Sasson;Alessandro Chiesa;Matthew Green;Eran Tromer

198
Citations
Oblix: An Efficient Oblivious Search Index

Pratyush Mishra;Rishabh Poddar;Jerry Chen;Alessandro Chiesa

188
Citations
ZEXE: Enabling Decentralized Private Computation

Sean Bowe;Alessandro Chiesa;Matthew Green;Ian Miers

142
Citations
Fractal: Post-quantum and Transparent Recursive Proofs from Holography

Alessandro Chiesa;Dev Ojha;Nicholas Spooner

131
Citations
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems.

Eli Ben-Sasson;Alessandro Chiesa;Daniel Genkin;Eran Tromer

104
Citations
Cluster Computing in Zero Knowledge.

Alessandro Chiesa;Eran Tromer;Madars Virza

88
Citations
Cluster Computing in Zero Knowledge

Alessandro Chiesa;Eran Tromer;Madars Virza

88
Citations
Computational Integrity with a Public Random String from Quasi-Linear PCPs

Eli Ben-Sasson;Iddo Bentov;Alessandro Chiesa;Ariel Gabizon

86
Citations
Proof-Carrying Data and Hearsay Arguments from Signature Cards.

Alessandro Chiesa;Eran Tromer

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

Eli Ben-Sasson;Alessandro Chiesa;Daniel Genkin;Eran Tromer

76
Citations

Frequent Co-Authors

Eli Ben-Sasson Technion – Israel Institute of Technology

Eran Tromer Tel Aviv University

Zeyuan Allen-Zhu Meta Platforms, Inc.

Silvio Micali MIT

Daniel Genkin Georgia Institute of Technology

Matthew Green Johns Hopkins University

Ran Canetti Boston University

Raluca Ada Popa University of California, Berkeley

Rafail Ostrovsky University of California, Los Angeles

Yuval Ishai Technion – Israel Institute of Technology

External Links

Personal website of Alessandro Chiesa

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online education opens a wealth of options for those interested in Computer Science. Whether you’re just starting your journey or looking to advance your career, choosing the right program matters. For newcomers, earning an associate's degree online offers a flexible, affordable first step. These programs typically cover core concepts and can boost both job prospects and readiness for further study.

For students concerned about cost, consider enrolling in one of the cheap online colleges that deliver quality education on a budget. Additionally, applicants with academic challenges can explore college with low gpa requirements, ensuring more accessible routes to degree completion.

Ambitious learners seeking career advancement should research graduate degrees that are worth it in Computer Science. These master’s programs are in high demand and often lead to some of the fastest-growing and best-paying tech roles. No matter your path, today’s online options make studying Computer Science in the USA more accessible than ever.