| Publication | Date of Publication | Type |
|---|
On quantum simulation-soundness
IACR Communications in Cryptology | 2026-09-09 | Paper |
Unconditional quantum cryptography with a bounded number of keys
IACR Communications in Cryptology | 2026-09-09 | Paper |
| A modular approach to succinct arguments for QMA | 2026-07-29 | Paper |
Publicly verifiable deletion: general compilers from minimal assumptions
Journal of Cryptology | 2026-06-30 | Paper |
| Fully-homomorphic encryption from lattice isomorphism | 2026-04-24 | Paper |
| Slightly sublinear trapdoor hash functions and PIR from low-noise LPN | 2026-04-24 | Paper |
| Computational monogamy of entanglement and non-interactive quantum key distribution | 2026-04-24 | Paper |
| Threshold signatures from one-way functions | 2026-04-24 | Paper |
| How to verify that a small device is quantum, unconditionally | 2026-04-24 | Paper |
| Simple and general counterexamples for private-coin evasive LWE | 2026-02-06 | Paper |
| Pseudorandom obfuscation and applications | 2026-02-06 | Paper |
| Key-homomorphic computations for RAM: fully succinct randomised encodings and more | 2026-02-04 | Paper |
| Compiled nonlocal games from any trapdoor claw-free function | 2026-02-04 | Paper |
| A new world in the depths of Microcrypt: separating OWSGs and quantum money from QEFID | 2025-12-02 | Paper |
| Black-box non-interactive zero knowledge from vector trapdoor hash | 2025-12-02 | Paper |
| Laconic conditional disclosure of secrets and applications | 2025-08-12 | Paper |
| Registration-based encryption in the plain model | 2025-07-29 | Paper |
| Unclonable commitments and proofs | 2025-07-25 | Paper |
| Key-homomorphic and aggregate verifiable random functions | 2025-07-23 | Paper |
| Traitor tracing without trusted authority from registered functional encryption | 2025-07-03 | Paper |
| Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup | 2025-01-10 | Paper |
| Exponential quantum one-wayness and EFI pairs | 2025-01-10 | Paper |
| Time-lock puzzles from lattices | 2024-12-13 | Paper |
| Robust quantum public-key encryption with applications to quantum key distribution | 2024-12-13 | Paper |
| Software with certified deletion | 2024-11-13 | Paper |
| Time-lock puzzles with efficient batch solving | 2024-11-12 | Paper |
| Registered (inner-product) functional encryption | 2024-09-13 | Paper |
| Distributed broadcast encryption from bilinear groups | 2024-09-13 | Paper |
| Two-round concurrent 2PC from sub-exponential LWE | 2024-08-30 | Paper |
| Weakening assumptions for publicly-verifiable deletion | 2024-08-15 | Paper |
| Public-key encryption with quantum keys | 2024-08-15 | Paper |
Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
Journal of Cryptology | 2024-07-10 | Paper |
| Weak zero-knowledge via the Goldreich-Levin theorem | 2024-06-26 | Paper |
| Factoring and pairings are not necessary for iO: circular-secure LWE suffices | 2024-06-24 | Paper |
| stoRNA: stateless transparent proofs of storage-time | 2024-06-19 | Paper |
| scientific article; zbMATH DE number 7829234 (Why is no real title available?) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829236 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829247 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
| Interaction-preserving compilers for secure computation | 2024-04-09 | Paper |
On concurrent multi-party quantum computation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | 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 |
Algebraic restriction codes and their applications
Algorithmica | 2023-12-13 | Paper |
Efficient laconic cryptography from learning with errors
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Multi-key and multi-input predicate encryption from learning with errors
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Transparent batchable time-lock puzzles and applications to Byzantine consensus
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Laconic function evaluation for Turing machines
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
Theory of Cryptography | 2023-08-14 | Paper |
Quantum rewinding for many-round protocols
Theory of Cryptography | 2023-08-14 | Paper |
Steganography-free zero-knowledge
Theory of Cryptography | 2023-08-14 | Paper |
A note on the post-quantum security of (ring) signatures
Public-Key Cryptography – PKC 2022 | 2023-08-10 | Paper |
Subset predicate encryption and its applications
Cryptology and Network Security | 2023-08-02 | Paper |
Candidate iO from homomorphic encryption schemes
Journal of Cryptology | 2023-07-26 | Paper |
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Succinct classical verification of quantum computation
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Succinct classical verification of quantum computation
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
How to build a trapdoor function from an encryption scheme
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| The round complexity of quantum zero-knowledge | 2023-03-31 | Paper |
| Rate-1 quantum fully homomorphic encryption | 2023-03-31 | Paper |
| Two-round maliciously secure computation with super-polynomial simulation | 2023-03-31 | Paper |
| Multi-client oblivious RAM with poly-logarithmic communication | 2023-03-21 | Paper |
| A combinatorial approach to quantum random functions | 2023-03-21 | Paper |
| Tight verifiable delay functions | 2022-12-16 | Paper |
| Arithmetic garbling from bilinear maps | 2022-08-25 | Paper |
Everlasting UC commitments from fully malicious PUFs
Journal of Cryptology | 2022-07-15 | Paper |
| Maliciously secure multi-client ORAM | 2022-07-01 | Paper |
| Compact ring signatures from learning with errors | 2022-03-31 | Paper |
| A geometric approach to homomorphic secret sharing | 2021-12-21 | Paper |
Post-quantum multi-party computation
(available as arXiv preprint) | 2021-12-08 | Paper |
| Unbounded multi-party computation from learning with errors | 2021-12-08 | Paper |
| Candidate iO from homomorphic encryption schemes | 2021-12-01 | Paper |
| Statistical Zaps and new oblivious transfer protocols | 2021-12-01 | Paper |
| Multi-key fully-homomorphic encryption in the plain model | 2021-12-01 | Paper |
| Constant ciphertext-rate non-committing encryption from standard assumptions | 2021-12-01 | Paper |
| Minting mechanism for proof of stake blockchains | 2021-02-23 | Paper |
| Subvector commitments with application to succinct arguments | 2020-05-20 | Paper |
| Homomorphic time-lock puzzles and applications | 2020-05-20 | Paper |
| Rate-1 trapdoor functions from the Diffie-Hellman problem | 2020-05-11 | Paper |
| Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles | 2020-04-30 | Paper |
| Trapdoor hash functions and their applications | 2020-03-09 | Paper |
| Incremental proofs of sequential work | 2020-02-06 | Paper |
| Efficient invisible and unlinkable sanitizable signatures | 2020-01-28 | Paper |
| Homomorphic secret sharing for low degree polynomials | 2019-01-23 | Paper |
| Efficient ring signatures in the standard model | 2018-03-08 | Paper |
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
