| Publication | Date of Publication | Type |
|---|
| OCash: fully anonymous payments between blockchain light clients | 2025-07-29 | Paper |
| The power of NAPs: compressing OR-proofs via collision-resistant hashing | 2025-07-23 | Paper |
| Jackpot: non-interactive aggregatable lotteries | 2025-07-03 | Paper |
| Extractable witness encryption for KZG commitments and efficient laconic OT | 2025-07-03 | Paper |
| FRIDA: data availability sampling from FRI | 2024-12-13 | Paper |
| Interactive non-malleable codes against desynchronizing attacks in the multi-party setting | 2024-11-22 | Paper |
| Distributed shuffling in adversarial environments | 2024-11-22 | Paper |
| Stronger lower bounds for leakage-resilient secret sharing | 2024-10-16 | Paper |
| Multiparty computation with covert security and public verifiability | 2024-06-25 | Paper |
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
How to compress encrypted data
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7788479 (Why is no real title available?) | 2024-01-15 | Paper |
Threshold private set intersection with better communication complexity
Lecture Notes in Computer Science | 2023-11-16 | Paper |
| scientific article; zbMATH DE number 7759457 (Why is no real title available?) | 2023-11-02 | Paper |
On sufficient oracles for secure computation with identifiable abort
Lecture Notes in Computer Science | 2023-07-25 | Paper |
| Secret sharing lower bound: either reconstruction is hard or shares are long | 2022-12-16 | Paper |
| Non-malleable secret sharing against bounded joint-tampering attacks in the plain model | 2022-12-07 | Paper |
| Black-box transformations from passive to covert security with public verifiability | 2022-11-09 | Paper |
Property-preserving hash functions for Hamming distance from standard assumptions
(available as arXiv preprint) | 2022-08-30 | Paper |
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
| On publicly-accountable zero-knowledge and small shuffle arguments | 2021-12-21 | Paper |
| Robust property-preserving hash functions for Hamming distance and more | 2021-12-08 | Paper |
| The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free | 2021-12-08 | Paper |
| Lower bounds for leakage-resilient secret sharing | 2021-12-01 | Paper |
| Lower bounds for multi-server oblivious RAMs | 2021-12-01 | Paper |
| Perfectly secure oblivious RAM with sublinear bandwidth overhead | 2020-05-05 | Paper |
| Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures | 2020-03-09 | Paper |
| The communication complexity of threshold private set intersection | 2020-03-09 | Paper |
Continuously non-malleable codes with split-state refresh
Theoretical Computer Science | 2019-01-18 | Paper |
| Yet another compiler for active security or: efficient MPC over arbitrary rings | 2018-09-26 | Paper |
Continuously non-malleable codes with split-state refresh
Applied Cryptography and Network Security | 2018-08-10 | Paper |
| Compact zero-knowledge proofs of small Hamming weight | 2018-05-29 | Paper |
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Nearly optimal verifiable data streaming
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Webtrust -- a comprehensive authenticity and integrity framework for HTTP
Applied Cryptography and Network Security | 2014-07-07 | Paper |
