| Publication | Date of Publication | Type |
|---|
Integrating causality in messaging channels
| 2024-11-13 | Paper |
Searching for ELFs in the cryptographic forest
| 2024-08-02 | Paper |
The indifferentiability of the duplex and its practical applications
| 2024-06-26 | Paper |
Robust channels: handling unreliable networks in the record layers of QUIC and DTLS 1.3
Journal of Cryptology | 2024-03-11 | Paper |
Nostradamus goes quantum
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Signatures and Security Notions
Asymmetric Cryptography | 2023-08-04 | Paper |
A random oracle for all of us
Progress in Cryptology - AFRICACRYPT 2022 | 2023-06-02 | Paper |
Cryptographic analysis of the Bluetooth secure connection protocol suite
Lecture Notes in Computer Science | 2023-05-12 | Paper |
Security reductions for white-box key-storage in mobile payments
| 2023-03-21 | Paper |
Information-Theoretic Security of Cryptographic Channels
1515.94067 | 2022-12-21 | Paper |
Zero round-trip time for the extended access control protocol
| 2022-08-25 | Paper |
Multipath TLS 1.3
| 2022-06-24 | Paper |
Towards post-quantum security for signal's X3DH handshake
| 2022-03-25 | Paper |
The theory of hash functions and random oracles. An approach to modern cryptography
Information Security and Cryptography | 2022-03-08 | Paper |
Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
| 2021-12-21 | Paper |
Signatures from sequential-OR proofs
| 2021-12-01 | Paper |
A cryptographic analysis of the TLS 1.3 handshake protocol
Journal of Cryptology | 2021-09-10 | Paper |
On the memory fault resilience of TLS 1.3
| 2021-07-06 | Paper |
Modeling memory faults in signature and authenticated encryption schemes
| 2020-08-05 | Paper |
Hybrid key encapsulation mechanisms and authenticated key exchange
| 2020-02-25 | Paper |
How to sign with white-boxed AES
| 2020-01-14 | Paper |
Simulatable channels: extended security that is universally composable and easier to prove
| 2019-01-23 | Paper |
Invisible sanitizable signatures and public-key encryption are equivalent
| 2018-08-10 | Paper |
PRF-ODH: relations, instantiations, and impossibility results
| 2017-10-27 | Paper |
Redactable graph hashing, revisited (extended abstract)
| 2017-08-25 | Paper |
Obfuscation combiners
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
On the hardness of proving CCA-security of Signed ElGamal
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Data is a stream: security of stream-based channels
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Privately computing set-union and set-intersection cardinality via Bloom filters
Information Security and Privacy | 2015-10-20 | Paper |
Adaptive proofs of knowledge in the random oracle model
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Robust multi-property combiners for hash functions
Journal of Cryptology | 2014-09-25 | Paper |
Trapdoors and weaknesses in the cryptographic standard SP 800-90A
Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) | 2014-07-04 | Paper |
Notions of black-box reductions, revisited
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
The Fiat-Shamir transformation in a quantum world
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Ideal-cipher (ir)reducibility for blockcipher-based hash functions
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 |
Limitations of the meta-reduction technique: the case of Schnorr signatures
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 |
History-free sequential aggregate signatures
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Black-box reductions and separations in cryptography
Progress in Cryptology - AFRICACRYPT 2012 | 2012-07-23 | Paper |
TLS, PACE, and EAC: a cryptographic view at modern key exchange protocols
| 2012-03-30 | Paper |
Random oracles in a quantum world
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Non-interactive and re-usable universally composable string commitments with adaptive security
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Security of blind signatures under aborts and applications to adaptive oblivious transfer
Journal of Mathematical Cryptology | 2011-11-15 | Paper |
Random Oracle Reducibility
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Physically uncloneable functions in the universal composition framework
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Efficient non-malleable commitment schemes
Journal of Cryptology | 2011-04-01 | Paper |
Expedient Non-malleability Notions for Hash Functions
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
Secure set intersection with untrusted hardware tokens
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
Random oracles with(out) programmability
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
History-Free Aggregate Message Authentication Codes
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Redactable signatures for tree-structured data: definitions and constructions
Applied Cryptography and Network Security | 2010-07-06 | Paper |
On the impossibility of three-move blind signature schemes
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Confidential Signatures and Deterministic Signcryption
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
Unlinkability of sanitizable signatures
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
Public-key encryption with non-interactive opening: new constructions and stronger definitions
Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings | 2010-05-04 | Paper |
Hash function combiners in TLS and SSL
Topics in Cryptology - CT-RSA 2010 | 2010-03-16 | Paper |
Delayed-key message authentication for streams
Theory of Cryptography | 2010-02-24 | Paper |
Foundations of non-malleable hash and one-way functions
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Efficient non-malleable commitment schemes
Journal of Cryptology | 2009-11-13 | Paper |
Security Analysis of the PACE Key-Agreement Protocol
Lecture Notes in Computer Science | 2009-09-29 | Paper |
Topics in Cryptology – CT-RSA 2004
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Security of Blind Signatures under Aborts
Public Key Cryptography – PKC 2009 | 2009-03-24 | Paper |
Security of Sanitizable Signatures Revisited
Public Key Cryptography – PKC 2009 | 2009-03-24 | Paper |
Security-Amplifying Combiners for Collision-Resistant Hash Functions
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Robust Multi-property Combiners for Hash Functions Revisited
Automata, Languages and Programming | 2008-08-19 | Paper |
On the Security of OAEP
Advances in Cryptology – ASIACRYPT 2006 | 2008-04-24 | Paper |
Security of NMAC and HMAC Based on Non-malleability
Topics in Cryptology – CT-RSA 2008 | 2008-04-24 | Paper |
Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Multi-property Preserving Combiners for Hash Functions
Theory of Cryptography | 2008-03-05 | Paper |
Progress in Cryptology - INDOCRYPT 2003
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Round-Optimal Composable Blind Signatures in the Common Reference String Model
Lecture Notes in Computer Science | 2007-09-04 | Paper |
A Closer Look at PKI: Security and Efficiency
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Anonymous Signatures Made Easy
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Topics in Cryptology – CT-RSA 2006
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
scientific article; zbMATH DE number 2079923 (Why is no real title available?)
| 2004-08-03 | Paper |
scientific article; zbMATH DE number 2079922 (Why is no real title available?)
| 2004-08-03 | Paper |
The Cramer-Shoup Strong-RSA Signature Scheme Revisited
Public Key Cryptography — PKC 2003 | 2003-07-27 | Paper |
scientific article; zbMATH DE number 1842484 (Why is no real title available?)
| 2002-12-08 | Paper |
scientific article; zbMATH DE number 1759793 (Why is no real title available?)
| 2002-10-07 | Paper |
scientific article; zbMATH DE number 1808214 (Why is no real title available?)
| 2002-09-30 | Paper |
scientific article; zbMATH DE number 1583798 (Why is no real title available?)
| 2002-03-06 | Paper |
Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1617945 (Why is no real title available?)
| 2001-09-10 | Paper |
scientific article; zbMATH DE number 1500483 (Why is no real title available?)
| 2000-09-04 | Paper |
scientific article; zbMATH DE number 1304088 (Why is no real title available?)
| 2000-03-07 | Paper |
scientific article; zbMATH DE number 1301787 (Why is no real title available?)
| 1999-06-16 | Paper |
