Follow
Eli Ben-Sasson
Eli Ben-Sasson
Co-founder & President, StarkWare
No verified email - Homepage
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
26032014
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
8952014
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
8512013
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
6911999
Scalable, transparent, and post-quantum secure computational integrity
E Ben-Sasson, I Bentov, Y Horesh, M Riabzev
Cryptology ePrint Archive, 2018
6892018
Aurora: Transparent succinct arguments for R1CS
E Ben-Sasson, A Chiesa, M Riabzev, N Spooner, M Virza, NP Ward
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
4442019
Robust PCPs of proximity, shorter PCPs and applications to coding
E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
3692004
Scalable zero knowledge via cycles of elliptic curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza
Algorithmica 79, 1102-1160, 2017
3592017
Interactive oracle proofs
E Ben-Sasson, A Chiesa, N Spooner
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
3372016
Short PCPs with polylog query complexity
E Ben-Sasson, M Sudan
SIAM Journal on Computing 38 (2), 551-607, 2008
267*2008
Scalable zero knowledge with no trusted setup
E Ben-Sasson, I Bentov, Y Horesh, M Riabzev
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
2522019
Fast reed-solomon interactive oracle proofs of proximity
E Ben-Sasson, I Bentov, Y Horesh, M Riabzev
45th international colloquium on automata, languages, and programming (icalp …, 2018
2252018
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
2252015
Space complexity in propositional calculus
M Alekhnovich, E Ben-Sasson, A Wigderson
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
2022000
Design of symmetric-key primitives for advanced cryptographic protocols
A Aly, T Ashur, E Ben-Sasson, S Dhooghe, A Szepieniec
IACR Transactions on Symmetric Cryptology, 1-45, 2020
2002020
Some 3CNF properties are hard to test
E Ben-Sasson, P Harsha, S Raskhodnikova
Proceedings of the thirty-fifth annual acm symposium on theory of computing …, 2003
1892003
Near optimal separation of tree-like and general resolution
E Ben-Sasson*, R Impagliazzo, A Wigderson
Combinatorica 24 (4), 585-603, 2004
1762004
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
1652003
Pseudorandom generators in propositional proof complexity
M Alekhnovich, E Ben-Sasson, AA Razborov, A Wigderson
SIAM Journal on Computing 34 (1), 67-88, 2004
151*2004
Near-linear unconditionally-secure multiparty computation with a dishonest minority
E Ben-Sasson, S Fehr, R Ostrovsky
Annual Cryptology Conference, 663-680, 2012
1462012
The system can't perform the operation now. Try again later.
Articles 1–20