| Publication | Date of Publication | Type |
|---|
| On weak NIZKs, one-way functions and amplification | 2026-02-06 | Paper |
| On the power of oblivious state preparation | 2026-02-04 | Paper |
| How to achieve non-malleability in one or two rounds | 2025-08-06 | Paper |
| Breaking the three round barrier for non-malleable commitments | 2025-08-06 | Paper |
| Unclonable non-interactive zero-knowledge | 2025-07-03 | Paper |
| Software with certified deletion | 2024-11-13 | Paper |
| Weakening assumptions for publicly-verifiable deletion | 2024-08-15 | Paper |
| On black-box verifiable outsourcing | 2024-08-01 | Paper |
| Weak zero-knowledge via the Goldreich-Levin theorem | 2024-06-26 | Paper |
| Refuting the dream XOR lemma via ideal obfuscation and resettable MPC | 2024-06-25 | Paper |
Publicly-verifiable deletion via target-collapsing functions
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Cryptography with certified deletion
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Round-optimal black-box MPC in the plain model
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
On non-uniform security for black-box non-interactive CCA commitments
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
A new framework for quantum oblivious transfer
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Black-box reusable NISC with random oracles
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Round-optimal black-box secure computation from two-round malicious OT
Theory of Cryptography | 2023-08-14 | Paper |
| Two-round maliciously secure computation with super-polynomial simulation | 2023-03-31 | Paper |
| Round-optimal black-box protocol compilers | 2022-08-30 | Paper |
| COA-secure obfuscation and applications | 2022-08-30 | Paper |
| SNARGs for P from sub-exponential DDH and QR | 2022-08-30 | Paper |
| Approximation of functions by Stancu variant of genuine Gupta-Srivastava operators | 2022-05-25 | Paper |
| On the round complexity of black-box secure MPC | 2022-04-22 | Paper |
| Improved computational extractors and their applications | 2022-04-22 | Paper |
| Compact ring signatures from learning with errors | 2022-03-31 | Paper |
One-way functions imply secure computation in a quantum world
(available as arXiv preprint) | 2022-03-31 | Paper |
On the round complexity of secure quantum computation
(available as arXiv preprint) | 2022-03-31 | Paper |
| On statistical security in two-party computation | 2022-03-23 | Paper |
Weak Zero-Knowledge beyond the Black-Box Barrier
SIAM Journal on Computing | 2022-02-08 | Paper |
| On the CCA compatibility of public-key infrastructure | 2021-12-21 | Paper |
Post-quantum multi-party computation
(available as arXiv preprint) | 2021-12-08 | Paper |
| Black-box non-interactive non-malleable commitments | 2021-12-08 | Paper |
| Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments | 2021-12-08 | Paper |
| Low error efficient computational extractors in the CRS model | 2021-12-01 | Paper |
| Statistical ZAP arguments | 2021-12-01 | Paper |
| Non-interactive non-malleability from quantum supremacy | 2020-03-09 | Paper |
Weak zero-knowledge beyond the black-box barrier
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Succinct delegation for low-space non-deterministic computation
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Round optimal black-box ``commit-and-prove'' | 2018-12-11 | Paper |
| Upgrading to functional encryption | 2018-12-11 | Paper |
| Promise zero knowledge and its applications to round optimal MPC | 2018-09-26 | Paper |
| Statistical witness indistinguishability (and more) in two messages | 2018-07-17 | Paper |
| Round optimal concurrent MPC via strong simulation | 2018-01-19 | Paper |
| Round optimal concurrent non-malleability from polynomial hardness | 2018-01-19 | Paper |
| Do distributed differentially-private protocols require oblivious transfer? | 2017-12-19 | Paper |
| Distinguisher-dependent simulation in two rounds and its applications | 2017-11-15 | Paper |
Unconditional UC-secure computation with (stronger-malicious) PUFs
Lecture Notes in Computer Science | 2017-06-13 | Paper |
How to Generate and Use Universal Samplers
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Secure computation from elastic noisy channels
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
All complete functionalities are reversible
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Statistical randomized encodings: a complexity theoretic view
Automata, Languages, and Programming | 2015-10-27 | Paper |
Black-box separations for differentially private protocols
Lecture Notes in Computer Science | 2015-01-06 | Paper |
