| Publication | Date of Publication | Type |
|---|
| The brave new world of global generic groups and UC-secure zero-overhead SNARKs | 2025-07-23 | Paper |
| Updatable privacy-preserving blueprints | 2025-07-23 | Paper |
| Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions | 2025-05-23 | Paper |
| From polynomial IOP and commitments to non-malleable zkSNARKs | 2024-08-02 | Paper |
| How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach | 2024-08-02 | Paper |
| Threshold structure-preserving signatures | 2024-06-26 | Paper |
Key-schedule security for the TLS 1.3 standard
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Snarky ceremonies
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| Mining for privacy: how to bootstrap a snarky blockchain | 2022-06-17 | Paper |
| Another look at extraction and randomization of Groth's zk-SNARK | 2022-06-17 | Paper |
| Composition with knowledge assumptions | 2022-05-18 | Paper |
| Steel: composable hardware-based stateful and randomised functional encryption | 2021-12-21 | Paper |
| Updatable and universal common reference strings with applications to zk-SNARKs | 2020-06-30 | Paper |
| Decentralizing inner-product functional encryption | 2020-01-28 | Paper |
Efficient fully structure-preserving signatures and shrinking commitments
Journal of Cryptology | 2019-08-13 | Paper |
| State separation for code-based game-playing proofs | 2019-01-23 | Paper |
Dependent types and multi-monadic effects in \(\mathrm{F}^*\)
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Constant-size structure-preserving signatures: generic constructions and simple assumptions
Journal of Cryptology | 2016-10-13 | Paper |
Composable and modular anonymous credentials: definitions and practical constructions
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
(De-)constructing TLS 1.3
Progress in Cryptology -- INDOCRYPT 2015 | 2016-01-12 | Paper |
One-out-of-many proofs: or how to leak a secret and spend a coin
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Fully structure-preserving signatures and shrinking commitments
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Anonymous transferable e-cash
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Square span programs with applications to succinct NIZK arguments
Lecture Notes in Computer Science | 2015-01-16 | Paper |
On the Non-malleability of the Fiat-Shamir Transform
Lecture Notes in Computer Science | 2014-08-20 | Paper |
Proving the TLS handshake secure (as it is)
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Tagged one-time signatures: tight security and optimal tag size
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Verifiable elections that scale for free
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Constant-size structure-preserving signatures: generic constructions and simple assumptions
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Succinct malleable NIZKs and an application to compact shuffles
Theory of Cryptography | 2013-03-18 | Paper |
A new hash-and-sign approach and structure-preserving signatures from DLIN
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Malleable proof systems and applications
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Structure preserving CCA secure encryption and applications
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Solving revocation with efficient update of anonymous credentials
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Randomizable Proofs and Delegatable Anonymous Credentials
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Compact E-Cash and Simulatable VRFs Revisited
Pairing-Based Cryptography – Pairing 2009 | 2009-08-18 | Paper |
Universally Composable Adaptive Priced Oblivious Transfer
Pairing-Based Cryptography – Pairing 2009 | 2009-08-18 | Paper |
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Public Key Cryptography – PKC 2009 | 2009-03-24 | Paper |
Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
Public Key Cryptography – PKC 2009 | 2009-03-24 | Paper |
P-signatures and Noninteractive Anonymous Credentials
Theory of Cryptography | 2008-03-05 | Paper |
