‣
2023
Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup
Preprint
‣
2022
Witness Encryption for Succinct Functional Commitments and Applications
Preprint
Impossibilities in Succinct Arguments: Black-box Extraction and More
Structure-Preserving Compilers from New Notions of Obfuscations
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators
Linear-map Vector Commitments and their Practical Applications
Caulk: Lookup Arguments in Sublinear Time
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups
Witness-Authenticated Key Exchange Revisited: Improved Models, Simpler Constructions, Extensions to Groups
‣
2021
Succinct Zero-Knowledge Batch Proofs for Set Accumulators
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers
Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions
ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines
Rinocchio: SNARKs for Ring Arithmetic
MyOPE: Malicious securitY for Oblivious Polynomial Evaluation
SnarkPack: Practical SNARK Aggregation
What Makes Fiat--Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
Count Me In!
Extendability for Threshold Ring Signatures
‣
2020
Single Secret Leader Election
Subversion-resilient enhanced privacy ID
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage
‣
2019
PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge
Preprint