| Publication | Date of Publication | Type |
|---|
| Information-theoretic broadcast-optimal MPC | 2026-04-24 | Paper |
| Broadcast-optimal secure computation from black-box oblivious transfer | 2026-04-23 | Paper |
| Universally composable SNARKs with transparent setup without programmable random oracle | 2026-02-06 | Paper |
| Round-optimal black-box multiparty computation from polynomial-time assumptions | 2025-12-02 | Paper |
| Black-box (and fast) non-malleable zero knowledge | 2024-12-13 | Paper |
| Broadcast-optimal two round MPC with asynchronous peer-to-peer channels | 2024-10-16 | Paper |
| Broadcast-optimal four-round MPC in the plain model | 2024-08-02 | Paper |
| Multiparty computation with covert security and public verifiability | 2024-06-25 | Paper |
List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Minimizing setup in broadcast-optimal two round MPC
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Four-round black-box non-malleable schemes from one-way permutations
Theory of Cryptography | 2023-08-14 | Paper |
On sufficient oracles for secure computation with identifiable abort
Lecture Notes in Computer Science | 2023-07-25 | Paper |
| Round-optimal multi-party computation with identifiable abort | 2022-08-30 | Paper |
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
| Broadcast-optimal two round MPC with an honest majority | 2022-04-22 | Paper |
| Multi-client functional encryption for separable functions | 2021-12-21 | Paper |
| Publicly verifiable zero knowledge from (collapsing) blockchains | 2021-12-21 | Paper |
| Balancing privacy and accountability in blockchain identity management | 2021-12-20 | Paper |
| How to extract useful randomness from unreliable sources | 2021-12-01 | Paper |
| Publicly verifiable proofs from blockchains | 2020-01-28 | Paper |
| Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments | 2018-12-06 | Paper |
| Round-optimal secure two-party computation from trapdoor permutations | 2018-01-19 | Paper |
| Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds | 2018-01-19 | Paper |
| Four-round concurrent non-malleable commitments from one-way functions | 2017-11-15 | Paper |
Concurrent non-malleable commitments (and more) in 3 rounds
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Online/offline OR composition of sigma protocols
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
Theory of Cryptography | 2016-04-08 | Paper |
Improved OR-composition of sigma-protocols
Theory of Cryptography | 2016-04-08 | Paper |
