| Publication | Date of Publication | Type |
|---|
Goldreich-Krawczyk revisited: a note on the zero knowledge of proofs of knowledge
IACR Communications in Cryptology | 2026-09-09 | Paper |
| Context-dependent threshold decryption and its applications | 2026-04-23 | Paper |
| Straight-line knowledge extraction for multi-round protocols | 2026-02-06 | Paper |
| Traceable verifiable random functions | 2026-02-04 | Paper |
| From one-time to two-round reusable multi-signatures without nested forking | 2025-07-25 | Paper |
| Proactive refresh for accountable threshold signatures | 2025-05-23 | Paper |
| Traceable secret sharing: strong security and efficient constructions | 2024-12-13 | Paper |
| Accountability for misbehavior in threshold decryption via threshold traitor tracing | 2024-12-13 | Paper |
Tighter security for Schnorr identification and signatures: a high-moment forking lemma for -protocols
Journal of Cryptology | 2024-07-10 | Paper |
| A fully-constructive discrete-logarithm preprocessing algorithm with an optimal time-space tradeoff | 2024-06-25 | Paper |
| Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups | 2024-06-25 | Paper |
| Out-of-band authenticated group key exchange: from strong authentication to immediate key delivery | 2023-11-02 | Paper |
Non-malleable vector commitments via local equivocability
Journal of Cryptology | 2023-10-25 | Paper |
| Simple and efficient batch verification techniques for verifiable delay functions | 2023-04-13 | Paper |
| Non-malleable vector commitments via local equivocability | 2023-04-13 | Paper |
| Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions | 2022-12-07 | Paper |
| Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols | 2022-03-31 | Paper |
| Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions | 2022-03-23 | Paper |
From fairness to full security in multiparty computation
Journal of Cryptology | 2022-01-06 | Paper |
| Generic-group delay functions require hidden-order groups | 2021-12-01 | Paper |
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Journal of Cryptology | 2021-09-10 | Paper |
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Theory of Cryptography | 2018-12-11 | Paper |
| The security of lazy users in out-of-band authentication | 2018-12-06 | Paper |
From fairness to full security in multiparty computation
Lecture Notes in Computer Science | 2018-10-17 | Paper |
| Out-of-band authentication in group messaging: computational, statistical, optimal | 2018-09-12 | Paper |
Characterization of secure multiparty computation without broadcast
Journal of Cryptology | 2018-05-28 | Paper |
Characterization of secure multiparty computation without broadcast
Theory of Cryptography | 2016-03-23 | Paper |
