Publications
2025
-
FCSecurely Computing One-Sided Matching Markets
-
PreprintOn Composing AGM-Secure Functionalities with Cryptographic Proofs: Applications to Unbounded-Depth IVC and More
-
PreprintWhen Can We Incrementally Prove Computations of Arbitrary Depth?
-
JoCFiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model)
-
TCCHow to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach
-
CCSRamen: Souper Fast Three-Party Computation for RAM Programs
-
EUROCRYPTWitness-Succinct Universally-Composable SNARKs
-
EUROCRYPTFiat–Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model)
-
ASIACRYPTReverse Firewalls for Adaptively Secure MPC Without Setup
-
USENIXSWIFT: Super-fast and Robust Privacy-Preserving Machine Learning