| Publication | Date of Publication | Type |
|---|
On optimal tightness for key exchange with full forward secrecy via key confirmation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Security analysis of the WhatsApp end-to-end encrypted backup protocol
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
Lecture Notes in Computer Science | 2023-11-24 | Paper |
| Subversion-resilient authenticated encryption without random oracles | 2023-11-10 | Paper |
Symmetric Key Exchange with Full Forward Security and Robust Synchronization
Lecture Notes in Computer Science | 2023-05-26 | Paper |
Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
Lecture Notes in Computer Science | 2023-05-26 | Paper |
Practical invalid curve attacks on TLS-ECDH
Computer Security -- ESORICS 2015 | 2022-08-19 | Paper |
| On fingerprinting attacks and length-hiding encryption | 2022-07-06 | Paper |
| Simple Security Definitions for and Constructions of 0-RTT Key Exchange | 2022-07-01 | Paper |
| Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) | 2022-06-24 | Paper |
| Authenticated key exchange and signatures with tight security in the standard model | 2022-05-18 | Paper |
| More efficient digital signatures with tight multi-user security | 2021-12-21 | Paper |
| Subversion-resilient public key encryption with practical watchdogs | 2021-12-21 | Paper |
| Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance | 2021-12-21 | Paper |
| Tightly-secure authenticated key exchange, revisited | 2021-12-08 | Paper |
On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
Journal of Cryptology | 2021-08-10 | Paper |
Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
Journal of Cryptology | 2021-07-30 | Paper |
Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
Journal of Cryptology | 2021-06-28 | Paper |
| Offline witness encryption with semi-adaptive security | 2021-02-23 | Paper |
| On the real-world instantiability of admissible hash functions and efficient verifiable random functions | 2020-07-21 | Paper |
| Highly efficient key exchange protocols with optimal tightness | 2020-03-09 | Paper |
Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
Advances in Cryptology – EUROCRYPT 2019 | 2020-02-06 | Paper |
On tight security proofs for Schnorr signatures
Journal of Cryptology | 2019-06-20 | Paper |
| Short digital signatures and ID-KEMs via truncation collision resistance | 2019-01-23 | Paper |
| Simple and more efficient PRFs with tight security from LWE and matrix-DDH | 2019-01-23 | Paper |
How to build time-lock encryption
Designs, Codes and Cryptography | 2018-10-10 | Paper |
| Practical and tightly-secure digital signatures and authenticated key exchange | 2018-09-26 | Paper |
Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
Advances in Cryptology – EUROCRYPT 2018 | 2018-07-17 | Paper |
Authenticated confidential channel establishment and the security of TLS-DHE
Journal of Cryptology | 2018-02-15 | Paper |
| Multi-key authenticated encryption with corruptions: reductions are lossy | 2018-01-19 | Paper |
How to Generate and Use Universal Samplers
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Public-key encryption with simulation-based selective-opening security and compact ciphertexts
Theory of Cryptography | 2016-12-22 | Paper |
On the impossibility of tight cryptographic reductions
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Tightly secure signatures and public-key encryption
Designs, Codes and Cryptography | 2016-06-27 | Paper |
Verifiable random functions from standard assumptions
Theory of Cryptography | 2016-03-23 | Paper |
On the selective opening security of practical public-key encryption schemes
Lecture Notes in Computer Science | 2015-08-27 | Paper |
One-round key exchange with strong security: an efficient and generic construction in the standard model
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Tightly-secure authenticated key exchange
Theory of Cryptography | 2015-07-06 | Paper |
Verifiable random functions from weaker assumptions
Theory of Cryptography | 2015-07-06 | Paper |
Confined guessing: new signatures from standard assumptions
Journal of Cryptology | 2015-03-25 | Paper |
On tight security proofs for Schnorr signatures
Lecture Notes in Computer Science | 2015-01-16 | Paper |
On the analysis of cryptographic assumptions in the generic ring model
Journal of Cryptology | 2013-06-27 | Paper |
Practical signatures from standard assumptions
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Tightly Secure Signatures and Public-Key Encryption
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the security of TLS-DHE in the standard model
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Waters signatures with optimal security reduction
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
| Black-box models of computation in cryptology. | 2012-07-10 | Paper |
Short signatures from weaker assumptions
Lecture Notes in Computer Science | 2011-12-02 | Paper |
The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Generic Compilers for Authenticated Key Exchange
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
On the analysis of cryptographic assumptions in the generic ring model
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
On the Equivalence of Generic Group Models
Provable Security | 2009-01-27 | Paper |
On Black-Box Ring Extraction and Integer Factorization
Automata, Languages and Programming | 2008-08-19 | Paper |
