| Publication | Date of Publication | Type |
|---|
| Randomness recoverable secret sharing schemes | 2024-11-22 | Paper |
| Lower-bounds on public-key operations in PIR | 2024-11-13 | Paper |
| Laconic branching programs from the Diffie-Hellman assumption | 2024-11-12 | Paper |
Randomness recoverable secret sharing schemes
Journal of Cryptology | 2024-10-11 | Paper |
| Lower bounds on assumptions behind registration-based encryption | 2024-08-02 | Paper |
| scientific article; zbMATH DE number 7829234 (Why is no real title available?) | 2024-04-09 | Paper |
Algebraic restriction codes and their applications
Algorithmica | 2023-12-13 | Paper |
Credibility in private set membership
Lecture Notes in Computer Science | 2023-11-16 | Paper |
On the worst-case inefficiency of CGKA
Theory of Cryptography | 2023-08-14 | Paper |
How to build a trapdoor function from an encryption scheme
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| Laconic private set intersection and applications | 2023-04-13 | Paper |
| Amortizing rate-1 OT and applications to PIR and PSI | 2023-04-13 | Paper |
Master-key KDM-secure IBE from pairings
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| Compact ring signatures from learning with errors | 2022-03-31 | Paper |
| Two-round oblivious transfer from CDH or LPN | 2022-03-23 | Paper |
| Efficient range-trapdoor functions and applications: rate-1 OT and more | 2021-12-01 | Paper |
| Limits on the power of garbling techniques for public-key encryption | 2020-06-30 | Paper |
| Rate-1 trapdoor functions from the Diffie-Hellman problem | 2020-05-11 | Paper |
| New techniques for efficient trapdoor functions and applications | 2020-02-04 | Paper |
| Registration-based encryption from standard assumptions | 2020-01-28 | Paper |
| Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations | 2018-12-11 | Paper |
| Registration-based encryption: removing private-key generator from IBE | 2018-12-11 | Paper |
| Trapdoor functions from the computational Diffie-Hellman assumption | 2018-09-26 | Paper |
| New constructions of identity-based and key-dependent message secure encryption schemes | 2018-05-16 | Paper |
| Linear-time zero-knowledge proofs for arithmetic circuit satisfiability | 2018-02-23 | Paper |
Reproducible circularly secure bit encryption: applications and realizations
Journal of Cryptology | 2018-02-15 | Paper |
Toward fine-grained blackbox separations between semantic and circular-security notions
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Reproducible circularly-secure bit encryption: applications and realizations
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Gambling, computational information and encryption security
Lecture Notes in Computer Science | 2015-09-24 | Paper |
Computational soundness of coinductive symbolic security under active attacks
Theory of Cryptography | 2013-03-18 | Paper |
