Eli Ben-Sasson

Cited by

	All	Since 2017
Citations	8791	5604
h-index	39	30
i10-index	71	50

1400

700

350

1050

200120022003200420052006200720082009201020112012201320142015201620172018201920202021202236 64 83 76 113 121 108 188 165 183 171 198 315 278 323 572 557 800 1022 1192 1318 712

Public access

View all

21 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Alessandro ChiesaUC BerkeleyVerified email at berkeley.edu
Eran TromerTel Aviv University + Columbia UniversityVerified email at cs.tau.ac.il
Madars VirzaMIT Media LabVerified email at mit.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerified email at cs.harvard.edu
Prahladh HarshaTata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
Ariel GabizonVerified email at cs.technion.ac.il
Daniel GenkinGeorgia TechVerified email at gatech.edu
Nick SpoonerUniversity of WarwickVerified email at warwick.ac.uk
Swastik KoppartyUniversity of TorontoVerified email at cs.toronto.edu
Matthew GreenJohns Hopkins UniversityVerified email at cs.jhu.edu
Christina GarmanPurdue UniversityVerified email at purdue.edu
Ian MiersUniversity of MarylandVerified email at umd.edu
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.edu
Jakob NordströmUniversity of Copenhagen and Lund UniversityVerified email at di.ku.dk
Mark SilbersteinAssociate Professor, Technion, IsraelVerified email at ee.technion.ac.il
Rafail OstrovskyNorman E. Friedman Distinguished Professor of Computer Science and MathematicsVerified email at cs.ucla.edu
Eden SaigTechnion, IsraelVerified email at cs.technion.ac.il
Nicholas WardGraduate Student, UC BerkeleyVerified email at berkeley.edu

Eli Ben-Sasson

Co-founder & President, StarkWare

Verified email at starkware.co - Homepage

theoretical computer science cryptography blockchains cryptocurrencies zero knowledge proofs


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Zerocash: Decentralized anonymous payments from bitcoin EB Sasson, A Chiesa, C Garman, M Green, I Miers, E Tromer, M Virza 2014 IEEE symposium on security and privacy, 459-474, 2014	1812	2014
Short proofs are narrow—resolution made simple E Ben-Sasson, A Wigderson Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	653	1999
Short proofs are narrow—resolution made simple E Ben-Sasson, A Wigderson Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	653	1999
SNARKs for C: Verifying program executions succinctly and in zero knowledge E Ben-Sasson, A Chiesa, D Genkin, E Tromer, M Virza Annual cryptology conference, 90-108, 2013	621	2013
Succinct non-interactive zero knowledge for a von Neumann architecture E Ben-Sasson, A Chiesa, E Tromer, M Virza Proceedings of the 23rd USENIX Security Symposium, Security 14, 2014	592	2014
Scalable, transparent, and post-quantum secure computational integrity E Ben-Sasson, I Bentov, Y Horesh, M Riabzev Cryptology ePrint Archive, 2018	347	2018
Robust PCPs of proximity, shorter PCPs, and applications to coding E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan SIAM Journal on Computing 36 (4), 889-974, 2006	328	2006
Robust PCPs of proximity, shorter PCPs, and applications to coding E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan SIAM Journal on Computing 36 (4), 889-974, 2006	328	2006
Scalable zero knowledge via cycles of elliptic curves E Ben-Sasson, A Chiesa, E Tromer, M Virza Algorithmica 79 (4), 1102-1160, 2017	245	2017
Short PCPs with polylog query complexity E Ben-Sasson, M Sudan SIAM Journal on Computing 38 (2), 551-607, 2008	237*	2008
Aurora: Transparent succinct arguments for R1CS E Ben-Sasson, A Chiesa, M Riabzev, N Spooner, M Virza, NP Ward Annual international conference on the theory and applications of …, 2019	221	2019
Space complexity in propositional calculus M Alekhnovich, E Ben-Sasson, AA Razborov, A Wigderson SIAM Journal on Computing 31 (4), 1184-1211, 2002	191	2002
Interactive oracle proofs E Ben-Sasson, A Chiesa, N Spooner Theory of Cryptography Conference, 31-60, 2016	188	2016
Some 3CNF properties are hard to test E Ben-Sasson, P Harsha, S Raskhodnikova SIAM Journal on Computing 35 (1), 1-21, 2005	181	2005
Near optimal separation of tree-like and general resolution E Ben-Sasson*, R Impagliazzo, A Wigderson Combinatorica 24 (4), 585-603, 2004	164	2004
Near optimal separation of tree-like and general resolution E Ben-Sasson*, R Impagliazzo, A Wigderson Combinatorica 24 (4), 585-603, 2004	164	2004
Near optimal separation of tree-like and general resolution E Ben-Sasson*, R Impagliazzo, A Wigderson Combinatorica 24 (4), 585-603, 2004	164	2004
Secure sampling of public parameters for succinct zero knowledge proofs E Ben-Sasson, A Chiesa, M Green, E Tromer, M Virza 2015 IEEE Symposium on Security and Privacy, 287-304, 2015	159	2015
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets E Ben-Sasson, M Sudan, S Vadhan, A Wigderson Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	155	2003
Pseudorandom generators in propositional proof complexity M Alekhnovich, E Ben-Sasson, AA Razborov, A Wigderson SIAM Journal on Computing 34 (1), 67-88, 2004	140*	2004

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors