Secure Quantum Computation with Classical Communication
Secure Software Leasing from Standard Assumptions
Post-quantum Resettably-Sound Zero Knowledge
Secure Software Leasing Without Assumptions
The Round Complexity of Quantum Zero-Knowledge
Rate-1 Quantum Fully Homomorphic Encryption
Unifying Presampling via Concentration Bounds
Quantum Key-length Extension
Relationships between quantum IND-CPA notions
Classical Binding for Quantum Commitments
Unclonable Encryption, Revisited
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs
Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness
Tight Security Bounds for Micali's SNARGs
Acyclicity Programming for Sigma-Protocols.-Statistical ZAPs from Group-Based Assumptions
Generalized Proofs of Knowledge with Fully Dynamic Setup
Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions
On expected polynomial runtime in cryptography
Information-Theoretically Secure MPC against Mixed Dynamic Adversaries
Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation
Adaptive Security of Multi-Party Protocols, Revisited.-On Actively-Secure Elementary MPC Reductions
Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions.