| Publication | Date of Publication | Type |
|---|
| Pairing-based functional commitments for circuits with shorter parameters | 2026-09-29 | Paper |
Lattice-based multi-authority/client attribute-based encryption for circuits
IACR Communications in Cryptology | 2026-09-09 | Paper |
Simple watermarking pseudorandom functions from extractable pseudorandom generators
IACR Communications in Cryptology | 2026-08-25 | Paper |
| A Gaussian leftover hash lemma for modules over number fields | 2026-07-24 | Paper |
| Look ahead! Practical CCA-secure steganography: cover-source switching meets lattice Gaussian sampling | 2026-07-24 | Paper |
| Pilvi: lattice threshold PKE with small decryption shares and improved security | 2026-04-23 | Paper |
| Partial lattice trapdoors: how to split lattice trapdoors, literally | 2026-04-13 | Paper |
| RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract) | 2026-04-13 | Paper |
| Lattice-based obfuscation from NTRU and equivocal LWE | 2026-02-06 | Paper |
| Hollow LWE: a new spin. Unbounded updatable encryption from LWE and PCE | 2025-12-02 | Paper |
| Vanishing short integer solution, revisited. Reductions, trapdoors, homomorphic signatures for low-degree polynomials | 2025-07-29 | Paper |
| Lattice-based proof-friendly signatures from vanishing short integer solutions | 2025-07-29 | Paper |
| RoK, paper, SISsors toolkit for lattice-based succinct arguments (extended abstract) | 2025-07-03 | Paper |
| Traitor tracing without trusted authority from registered functional encryption | 2025-07-03 | Paper |
Leaky LWE: learning with errors with semi-adaptive secret- and error-leakage
IACR Communications in Cryptology | 2025-01-01 | Paper |
| Chainable functional commitments for unbounded-depth circuits | 2024-08-02 | Paper |
Lattice-based timed cryptography
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Lattice-based succinct arguments from vanishing polynomials (extended abstract)
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Efficient laconic cryptography from learning with errors
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Quantum rewinding for many-round protocols
Theory of Cryptography | 2023-08-14 | Paper |
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
| Multi-client oblivious RAM with poly-logarithmic communication | 2023-03-21 | Paper |
| Forward-secure searchable encryption on labeled bipartite graphs | 2022-07-01 | Paper |
| Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices | 2022-04-22 | Paper |
| A geometric approach to homomorphic secret sharing | 2021-12-21 | Paper |
| On computational shortcuts for information-theoretic PIR | 2021-12-01 | Paper |
| Subvector commitments with application to succinct arguments | 2020-05-20 | Paper |
| Incremental proofs of sequential work | 2020-02-06 | Paper |
| Efficient invisible and unlinkable sanitizable signatures | 2020-01-28 | Paper |
| Multi-key homomorphic signatures unforgeable under insider corruption | 2019-01-23 | Paper |
| Homomorphic secret sharing for low degree polynomials | 2019-01-23 | Paper |
| Another look at anonymous communication. Security and modular constructions | 2017-10-23 | Paper |
Cryptography for parallel RAM from indistinguishability obfuscation
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Trapdoors for ideal lattices with applications
Information Security and Cryptology | 2015-11-25 | Paper |
