Eli Ben-Sasson
Eli Ben-Sasson
Professor of Computer Science, Technion
Email verificata su cs.technion.ac.il - Home page
TitoloCitata daAnno
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
8842014
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
5771999
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
5771999
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
3652013
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
2812014
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
2712006
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
2712006
Short PCPs with polylog query complexity
E Ben-Sasson, M Sudan
SIAM Journal on Computing 38 (2), 551-607, 2008
187*2008
Space complexity in propositional calculus
M Alekhnovich, E Ben-Sasson, AA Razborov, A Wigderson
SIAM Journal on Computing 31 (4), 1184-1211, 2002
1642002
Some 3CNF properties are hard to test
E Ben-Sasson, P Harsha, S Raskhodnikova
SIAM Journal on Computing 35 (1), 1-21, 2005
1592005
Near optimal separation of tree-like and general resolution
E Ben-Sasson, R Impagliazzo, A Wigderson
Combinatorica 24 (4), 585-603, 2004
1372004
Near optimal separation of tree-like and general resolution
E Ben-Sasson, R Impagliazzo, A Wigderson
Combinatorica 24 (4), 585-603, 2004
1372004
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
1342003
Scalable zero knowledge via cycles of elliptic curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza
Algorithmica 79 (4), 1102-1160, 2017
1322017
Pseudorandom generators in propositional proof complexity
M Alekhnovich, E Ben-Sasson, AA Razborov, A Wigderson
SIAM Journal on Computing 34 (1), 67-88, 2004
121*2004
Scalable, transparent, and post-quantum secure computational integrity.
E Ben-Sasson, I Bentov, Y Horesh, M Riabzev
IACR Cryptology ePrint Archive 2018, 46, 2018
1082018
Short PCPs verifiable in polylogarithmic time
E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan
20th Annual IEEE Conference on Computational Complexity (CCC'05), 120-134, 2005
1022005
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
922015
Size-space tradeoffs for resolution
E Ben-Sasson
SIAM Journal on Computing 38 (6), 2511-2525, 2009
90*2009
Space complexity of random formulae in resolution
E Ben‐Sasson, N Galesi
Random Structures & Algorithms 23 (1), 92-109, 2003
882003
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20