| Publication | Date of Publication | Type |
|---|
| Traceable bottom-up secret sharing and law and order on community social key recovery | 2026-03-23 | Paper |
| Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler | 2025-07-29 | Paper |
| Scalable multiparty computation from non-linear secret sharing | 2024-12-13 | Paper |
| On the round complexity of fully secure solitary MPC with honest majority | 2024-08-02 | Paper |
Cryptography with weights: MPC, encryption and signatures
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Round-optimal oblivious transfer and MPC from computational CSIDH
Lecture Notes in Computer Science | 2023-11-24 | Paper |
A more complete analysis of the signal double ratchet algorithm
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
| Efficient and tight oblivious transfer from PKE with tight multi-user security | 2022-11-09 | Paper |
| Adaptively secure threshold symmetric-key encryption | 2022-07-06 | Paper |
| Reusable two-round MPC from DDH | 2022-03-23 | Paper |
| BETA: biometric-enabled threshold authentication | 2021-12-21 | Paper |
Continuously non-malleable codes in the split-state model
Journal of Cryptology | 2020-11-06 | Paper |
| Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13 | 2020-05-27 | Paper |
| Continuous space-bounded non-malleable codes from stronger proofs-of-space | 2020-05-20 | Paper |
| Approximate trapdoors for lattices and smaller hash-and-sign signatures | 2020-05-11 | Paper |
| Obfuscation from low noise multilinear maps | 2019-03-29 | Paper |
| Block-wise non-malleable codes | 2017-12-19 | Paper |
| Non-malleable codes for space-bounded tampering | 2017-11-15 | Paper |
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Bounded tamper resilience: how to go beyond the algebraic barrier
Journal of Cryptology | 2017-03-02 | Paper |
Secure Obfuscation in a Weak Multilinear Map Model
Theory of Cryptography | 2016-12-22 | Paper |
The Exact Round Complexity of Secure Computation
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Two round multiparty computation via multi-key FHE
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Non-adaptive programmability of random oracle
Theoretical Computer Science | 2015-10-08 | Paper |
The Chaining Lemma and its application
Lecture Notes in Computer Science | 2015-09-24 | Paper |
A tamper and leakage resilient von Neumann architecture
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Efficient non-malleable codes and key-derivation for poly-size tampering circuits
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Continuous non-malleable codes
Theory of Cryptography | 2014-02-18 | Paper |
Bounded tamper resilience: how to go beyond the algebraic barrier
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
