| Publication | Date of Publication | Type |
|---|
DeCAF: Decentralizable CGKA with fast healing
| 2025-01-10 | Paper |
Updatable public-key encryption, revisited
| 2024-11-13 | Paper |
The pre-shared key modes of HPKE
| 2024-09-13 | Paper |
Fork-resilient continuous group key agreement
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
On the insider security of MLS
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Security analysis and improvements for the IETF MLS standard for group messaging
| 2022-11-09 | Paper |
Continuous group key agreement with active security
| 2022-03-23 | Paper |
Analysing the HPKE standard
| 2021-12-08 | Paper |
The double ratchet: security notions, proofs, and modularization for the signal protocol
| 2020-02-04 | Paper |
Sustained space complexity
| 2018-07-09 | Paper |
Cumulative space in black-white pebbling and resolution
| 2018-05-03 | Paper |
Beyond Hellman's time-memory trade-offs with applications to proofs of space
| 2018-03-08 | Paper |
Moderately hard functions: definition, instantiations, and applications
| 2018-01-19 | Paper |
Depth-robust graphs and their cumulative memory complexity
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Scrypt is maximally memory-hard
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Efficiently computing data-independent memory-hard functions
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Incoercible multi-party computation and universally composable receipt-free voting
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Anonymous authentication with shared secrets
Progress in Cryptology - LATINCRYPT 2014 | 2015-09-17 | Paper |
High Parallel Complexity Graphs and Memory-Hard Functions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Key-indistinguishable message authentication codes
Lecture Notes in Computer Science | 2014-10-14 | Paper |
On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
Cryptography and Coding | 2014-01-17 | Paper |
Learning with rounding, revisited. New reduction, properties and applications
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Collusion-preserving computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Generating shorter bases for hard random lattices
| 2012-04-24 | Paper |
Generating shorter bases for hard random lattices
Theory of Computing Systems | 2011-05-23 | Paper |
Survey: leakage resilience and the bounded retrieval model
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Public-key encryption in the bounded-retrieval model
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Collusion-Free Multiparty Computation in the Mediated Model
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Collusion-Free Protocols in the Mediated Model
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
