| Publication | Date of Publication | Type |
|---|
| Universally composable transaction order fairness: refined definitions and adaptive security | 2026-03-31 | Paper |
| Universally composable SNARKs with transparent setup without programmable random oracle | 2026-02-06 | Paper |
| Black-box constant-round secure 2PC with succinct communication | 2025-12-02 | Paper |
| Round-optimal black-box multiparty computation from polynomial-time assumptions | 2025-12-02 | Paper |
| Universal adaptor signatures from blackbox multi-party computation | 2025-10-31 | Paper |
| Black-box (and fast) non-malleable zero knowledge | 2024-12-13 | Paper |
| Universal composable transaction serialization with order fairness | 2024-12-04 | Paper |
| Agile cryptography: a universally composable approach | 2024-08-15 | Paper |
| Broadcast-optimal four-round MPC in the plain model | 2024-08-02 | Paper |
List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
| Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions | 2023-11-10 | Paper |
Four-round black-box non-malleable schemes from one-way permutations
Theory of Cryptography | 2023-08-14 | Paper |
Efficient NIZK arguments with straight-line simulation and extraction
Cryptology and Network Security | 2023-07-28 | Paper |
Etherless Ethereum Tokens: simulating native tokens in Ethereum
Journal of Computer and System Sciences | 2023-04-21 | Paper |
| Oblivious transfer from trapdoor permutations in minimal rounds | 2023-04-13 | Paper |
| On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs | 2022-12-16 | Paper |
| Round-optimal multi-party computation with identifiable abort | 2022-08-30 | Paper |
| Round optimal secure multiparty computation from minimal assumptions | 2022-03-23 | Paper |
| Multi-client functional encryption for separable functions | 2021-12-21 | Paper |
| Threshold garbled circuits and ad hoc secure computation | 2021-12-08 | Paper |
| Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era | 2021-02-23 | Paper |
| Combining private set intersection with secure two-party computation | 2018-10-17 | 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 |
