Sotabase

Career

· Cryptography Architect, TripleBlind2023–2024
· Associate Professor, George Mason University2015–
· Research Scientist, Applied Communication Sciences / Vencore Labs2012–2015
· Computing Innovations Fellow (Postdoctoral Researcher), Columbia University2010–2012
· PhD in Computer Science, University of Maryland2010–
· MS, Computer Science, University of Maryland2008–
· BA, Computer Science, Columbia University2003–

Publications (18)

Complete fairness in secure two-party computation
Symposium on the Theory of Computing · 2008
149
cited
On Complete Primitives for Fairness
Theory of Cryptography Conference · 2010
33
cited
Spreading the Privacy Blanket: Differentially Oblivious Shuffling for Differential Privacy
IACR Cryptology ePrint Archive · 2021
18
cited
Notes on Complexity Theory
2015
9
cited
Secure Computation with Sublinear Amortized Work
IACR Cryptology ePrint Archive · 2011
8
cited
On the Relationship Between Functional Encryption and Fully Homomorphic Encryption
2011
3
cited
Declarative, Distributed Configuration 1
2014
1
cited
1 Randomized Time Complexity
2018
1 Randomized Time Complexity 1 . 1 How Large is BPP ?
2015
Amortized Sublinear Secure Multi Party Computation
2011
Notes on Complexity Theory 1 Randomized Time Complexity
2015
Notes on Complexity Theory Last updated : November , 2015 Lecture 8 Notes
2015
Notes on Complexity Theory Last updated : September , 2015 Lecture 5 Notes
2015
Notes on Complexity Theory Lecture 11
2011
PSPACE , zero knowledge
2018
Recursion theorem , NP-completeness
Session details: Session 5D: Secure Computation
2020
Turing Machines , P , NP and NP-completeness
2018
Sotabase