Ben-Michael, Eli
99  Ergebnisse:
Personensuche X
?
1

Linear-Size Constant-Query IOPs for Delegating Computation:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
 
?
2

Scalable Zero Knowledge with No Trusted Setup:

, In: Advances in Cryptology – CRYPTO 2019; Lecture Notes in Computer Science,
Ben-Sasson, Eli ; Bentov, Iddo ; Horesh, Yinon. - p. 701-732 , 2019
 
?
3

Aurora: Transparent Succinct Arguments for R1CS:

, In: Advances in Cryptology – EUROCRYPT 2019; Lecture Notes in Computer Science,
 
?
4

Space complexity in propositional calculus:

, In: Proceedings of the thirty-second annual ACM symposium on Theory of computing,
 
?
5

Contributors:

, In: Plant Biotechnology and Agriculture,
Altman, Arie ; Baumann, Ute ; Beckles, Diane M.... - p. xxi-xxiii , 2012
 
?
6

Contributors:

, In: The Ovary,
Amsterdam, Abraham ; Au, Heng-Kien ; Auersperg, Nelly... - p. xv-xviii , 2004
 
?
8

Proximity Gaps for Reed–Solomon Codes:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Ben-Sasson, Eli ; Carmon, Dan ; Ishai, Yuval.. - p. 900-909 , 2020
 
?
9

Evaluating Expert Curation in a Baby Milestone Tracking App:

, In: Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems,
 
?
10

Worst-case to average case reductions for the distance to a..:

, In: Proceedings of the 33rd Computational Complexity Conference,
 
?
11

Baby CROINC : an online, crowd-based, expert-curated sys..:

, In: Proceedings of the 11th EAI International Conference on Pervasive Computing Technologies for Healthcare,
 
?
12

Fast Multiplication in Binary Fields on GPUs via Register C..:

, In: Proceedings of the 2016 International Conference on Supercomputing,
 
?
13

On the concrete efficiency of probabilistically-checkable p..:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,
 
?
14

A new family of locally correctable codes based on degree-l..:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,
Ben-Sasson, Eli ; Gabizon, Ariel ; Kaplan, Yohay.. - p. 833-842 , 2013
 
?
15

Fast reductions from RAMs to delegatable succinct constrain..:

, In: Proceedings of the 4th conference on Innovations in Theoretical Computer Science,
 
1-15