| Publication | Date of Publication | Type |
|---|
Lifting standard model reductions to common setup assumptions
Public-Key Cryptography – PKC 2022 | 2023-08-10 | Paper |
Cryptographic role-based access control, reconsidered
Provable and Practical Security | 2023-07-21 | Paper |
| Generic forward-secure key agreement without signatures | 2022-11-02 | Paper |
| Adaptive proofs have straightline extractors (in the random oracle model) | 2022-07-01 | Paper |
| Provable security analysis of FIDO2 | 2022-04-22 | Paper |
| Masking fuzzy-searchable public databases | 2020-01-30 | Paper |
| Efficient function-hiding functional encryption: from inner-products to orthogonality | 2020-01-28 | Paper |
How to build time-lock encryption
Designs, Codes and Cryptography | 2018-10-10 | Paper |
| Multi-key authenticated encryption with corruptions: reductions are lossy | 2018-01-19 | Paper |
A linear space algorithm for computing the hermite normal form
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Universally composable cryptographic role-based access control
Provable Security | 2017-01-06 | Paper |
A modular treatment of cryptographic APIs: the symmetric-key case
Advances in Cryptology – CRYPTO 2016 | 2016-11-30 | Paper |
Provably-secure remote memory attestation for heap overflow protection
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Selective Opening Security for Receivers
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
On the hardness of proving CCA-security of Signed ElGamal
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Adaptive proofs of knowledge in the random oracle model
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Cryptographic voting -- a gentle introduction
Foundations of Security Analysis and Design VII | 2015-05-27 | Paper |
Homomorphic signatures with efficient verification for polynomial functions
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Cryptographic puzzles and DoS resilience, revisited
Designs, Codes and Cryptography | 2014-08-01 | Paper |
Explicit randomness is not necessary when modeling probabilistic encryption
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Efficient network coding signatures in the standard model
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Secure proxy signature schemes for delegation of signing rights
Journal of Cryptology | 2012-05-23 | Paper |
A survey of symbolic methods in computational analysis of cryptographic systems
Journal of Automated Reasoning | 2011-06-03 | Paper |
Adaptive pseudo-free groups and applications
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Get shorty via group signatures without encryption
Lecture Notes in Computer Science | 2010-09-10 | Paper |
The Fiat-Shamir transform for group and ring signature schemes
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Groth–Sahai Proofs Revisited
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
The TLS handshake protocol: A modular analysis
Journal of Cryptology | 2010-03-01 | Paper |
Practical zero-knowledge proofs for circuit evaluation
Cryptography and Coding | 2010-01-07 | Paper |
Foundations of non-malleable hash and one-way functions
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Security Notions and Generic Constructions for Client Puzzles
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption
Foundations and Applications of Security Analysis | 2009-10-22 | Paper |
Identity Based Group Signatures from Hierarchical Identity-Based Encryption
Pairing-Based Cryptography – Pairing 2009 | 2009-08-18 | Paper |
Certified Encryption Revisited
Progress in Cryptology – AFRICACRYPT 2009 | 2009-07-07 | Paper |
Hash function requirements for Schnorr signatures
Journal of Mathematical Cryptology | 2009-06-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
A Modular Security Analysis of the TLS Handshake Protocol
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Security analysis of cryptographically controlled access to XML documents
Journal of the ACM | 2008-12-21 | Paper |
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
A Closer Look at PKI: Security and Efficiency
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Security in Communication Networks
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Information and Communications Security
Lecture Notes in Computer Science | 2005-08-19 | Paper |
| scientific article; zbMATH DE number 2009983 (Why is no real title available?) | 2003-11-26 | Paper |
