Sotabase

Career

· Postdoctoral Scholar (CIFellow), University of Washington2021–
· Intern, Google2019–
· Graduate Fellow, FACT Center, IDC Herzliya, Israel2016–2018
· PhD: Computer Science, Columbia University2015–2020
· Visiting Graduate Student, Simons Institute (UC Berkeley)2015–
· Masters: Computer Science, Columbia University2014–2015
· Bachelor of Arts: Science in Society Program, Wesleyan University2006–2010

Publications (36)

Proofs of Useful Work
IACR Cryptology ePrint Archive · 2017
129
cited
Garbling Gadgets for Boolean and Arithmetic Circuits
IACR Cryptology ePrint Archive · 2016
81
cited
Proofs of Work from Worst-Case Assumptions
IACR Cryptology ePrint Archive · 2018
66
cited
Average-case fine-grained hardness
Electron. Colloquium Comput. Complex. · 2017
62
cited
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
International Conference on the Theory and Application of Cryptographic Techniques · 2016
55
cited
Garbled Neural Networks are Practical
IACR Cryptology ePrint Archive · 2019
49
cited
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
IACR Cryptology ePrint Archive · 2018
37
cited
Non-Malleable Codes for Small-Depth Circuits
IEEE Annual Symposium on Foundations of Computer Science · 2018
35
cited
Non-Malleable Codes for Decision Trees
IACR Cryptology ePrint Archive · 2019
23
cited
Non-Malleable Codes Against Bounded Polynomial Time Tampering
IACR Cryptology ePrint Archive · 2019
21
cited
Experimental evaluation of digitally-verifiable photonic computing for blockchain and cryptocurrency
Optica · 2022
19
cited
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?
Information Technology Convergence and Services · 2020
17
cited
Randomness Extraction from Somewhat Dependent Sources
Electron. Colloquium Comput. Complex. · 2019
15
cited
Exploring the Boundaries of Topology-Hiding Computation
International Conference on the Theory and Application of Cryptographic Techniques · 2018
13
cited
Towards Optical Proof of Work
2020
10
cited
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust
Annual International Cryptology Conference · 2020
9
cited
New Ways to Garble Arithmetic Circuits
International Conference on the Theory and Application of Cryptographic Techniques · 2023
9
cited
(Nondeterministic) Hardness vs. Non-Malleability
Electron. Colloquium Comput. Complex. · 2022
9
cited
Non-Malleability against Polynomial Tampering
IACR Cryptology ePrint Archive · 2020
7
cited
Theory of Computing
2013
7
cited
Sotabase
Marshall Ball | Researcher Profile | Sotabase | Sotabase