Impossibility and Feasibility Results for Zero Knowledge with Public Keys. - Joël Alwen; Giuseppe Persiano; Ivan Visconti (CRYPTO, 2005)

Collusion-Free Protocols in the Mediated Model. - Joël Alwen; Abhi Shelat; Ivan Visconti (CRYPTO, 2008)

Generating Shorter Bases for Hard Random Lattices. - Joël Alwen; Chris Peikert (IACR Cryptol. ePrint Arch., 2008)

Collusion-Free Multiparty Computation in the Mediated Model. - Joël Alwen; Jonathan Katz; Yehuda Lindell; Giuseppe Persiano; Abhi Shelat; Ivan Visconti (CRYPTO, 2009)

Survey: Leakage Resilience and the Bounded Retrieval Model. - Joël Alwen; Yevgeniy Dodis; Daniel Wichs (ICITS, 2009)

Public-Key Encryption in the Bounded-Retrieval Model. - Joël Alwen; Yevgeniy Dodis; Moni Naor; Gil Segev 001; Shabsi Walfish; Daniel Wichs (IACR Cryptol. ePrint Arch., 2009)

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. - Joël Alwen; Yevgeniy Dodis; Daniel Wichs (IACR Cryptol. ePrint Arch., 2009)

Collusion-Preserving Computation. - Joël Alwen; Jonathan Katz; Ueli Maurer; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2011)

Collusion Preserving Computation. - Joël Alwen (2011)

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption. - Joël Alwen; Manuel Barbosa; Pooya Farshim; Rosario Gennaro; S. Dov Gordon; Stefano Tessaro; David A. Wilson (IMACC, 2013)

Learning with Rounding, Revisited: New Reduction, Properties and Applications. - Joël Alwen; Stephan Krenn; Krzysztof Pietrzak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2013)

Anonymous Authentication with Shared Secrets. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (IACR Cryptol. ePrint Arch., 2014)

Key-Indistinguishable Message Authentication Codes. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (IACR Cryptol. ePrint Arch., 2014)

High Parallel Complexity Graphs and Memory-Hard Functions. - Joël Alwen; Vladimir Serbinenko (IACR Cryptol. ePrint Arch., 2014)

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting. - Joël Alwen; Rafail Ostrovsky; Hong-Sheng Zhou; Vassilis Zikas (CRYPTO (2), 2015)

Spacemint: A Cryptocurrency Based on Proofs of Space. - Sunoo Park; Krzysztof Pietrzak; Albert Kwon; Joël Alwen; Georg Fuchsbauer; Peter Gazi (IACR Cryptol. ePrint Arch., 2015)

Efficiently Computing Data-Independent Memory-Hard Functions. - Joël Alwen; Jeremiah Blocki (IACR Cryptol. ePrint Arch., 2016)

Towards Practical Attacks on Argon2i and Balloon Hashing. - Joël Alwen; Jeremiah Blocki (IACR Cryptol. ePrint Arch., 2016)

Depth-Robust Graphs and Their Cumulative Memory Complexity. - Joël Alwen; Jeremiah Blocki; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2016)

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. - Joël Alwen; Binyi Chen; Chethan Kamath; Vladimir Kolmogorov; Krzysztof Pietrzak; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2016)

Scrypt is Maximally Memory-Hard. - Joël Alwen; Binyi Chen; Krzysztof Pietrzak; Leonid Reyzin; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2016)

On the Memory-Hardness of Data-Independent Password-Hashing Functions. - Joël Alwen; Peter Gazi; Chethan Kamath; Karen Klein; Georg Osang; Krzysztof Pietrzak; Leonid Reyzin; Michal Rolínek; Michal Rybár (IACR Cryptol. ePrint Arch., 2016)

Cumulative Space in Black-White Pebbling and Resolution. - Joël Alwen; Susanna F. de Rezende; Jakob Nordström; Marc Vinyals (ITCS, 2017)

Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. - Hamza Abusalah; Joël Alwen; Bram Cohen; Danylo Khilko; Krzysztof Pietrzak; Leonid Reyzin (IACR Cryptol. ePrint Arch., 2017)

Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. - Joël Alwen; Jeremiah Blocki; Benjamin Harsha (IACR Cryptol. ePrint Arch., 2017)

Moderately Hard Functions: Definition, Instantiations, and Applications. - Joël Alwen; Björn Tackmann (IACR Cryptol. ePrint Arch., 2017)

Sustained Space Complexity. - Joël Alwen; Jeremiah Blocki; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2018)

The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol. - Joël Alwen; Sandro Coretti; Yevgeniy Dodis (IACR Cryptol. ePrint Arch., 2018)

Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol. - Joël Alwen; Margarita Capretto; Miguel Cueto; Chethan Kamath; Karen Klein; Guillermo Pascual-Perez; Krzysztof Pietrzak; Michael Walter 001 (IACR Cryptol. ePrint Arch., 2019)

Security Analysis and Improvements for the IETF MLS Standard for Group Messaging. - Joël Alwen; Sandro Coretti; Yevgeniy Dodis; Yiannis Tselekounis (IACR Cryptol. ePrint Arch., 2019)

Analysing the HPKE Standard. - Joël Alwen; Bruno Blanchet; Eduard Hauck; Eike Kiltz; Benjamin Lipp 001; Doreen Riepel (IACR Cryptol. ePrint Arch., 2020)

Continuous Group Key Agreement with Active Security. - Joël Alwen; Sandro Coretti; Daniel Jost 001; Marta Mularczyk (IACR Cryptol. ePrint Arch., 2020)

On The Insider Security of MLS. - Joël Alwen; Daniel Jost 001; Marta Mularczyk (IACR Cryptol. ePrint Arch., 2020)

Analysing the HPKE Standard - Supplementary Material. - Joël Alwen; Bruno Blanchet; Eduard Hauck; Eike Kiltz; Benjamin Lipp 001; Doreen Riepel (Zenodo, 2020)

Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement. - Karen Klein; Guillermo Pascual-Perez; Michael Walter 001; Chethan Kamath; Margarita Capretto; Miguel Cueto; Ilia Markov; Michelle Yeo; Joël Alwen; Krzysztof Pietrzak (SP, 2021)

Grafting Key Trees: Efficient Key Management for Overlapping Groups. - Joël Alwen; Benedikt Auerbach; Mirza Ahad Baig; Miguel Cueto; Karen Klein; Guillermo Pascual-Perez; Krzysztof Pietrzak; Michael Walter 001 (IACR Cryptol. ePrint Arch., 2021)

Modular Design of Secure Group Messaging Protocols and the Security of MLS. - Joël Alwen; Sandro Coretti; Yevgeniy Dodis; Yiannis Tselekounis (IACR Cryptol. ePrint Arch., 2021)

Server-Aided Continuous Group Key Agreement. - Joël Alwen; Dominik Hartmann; Eike Kiltz; Marta Mularczyk (IACR Cryptol. ePrint Arch., 2021)

Analysing the HPKE Standard - Supplementary Material. - Joël Alwen; Bruno Blanchet; Eduard Hauck; Eike Kiltz; Benjamin Lipp 001; Doreen Riepel (Zenodo, 2021)

Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging. - Joël Alwen; Benedikt Auerbach; Miguel Cueto Noval; Karen Klein; Guillermo Pascual-Perez; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2022)

CoCoA: Concurrent Continuous Group Key Agreement. - Joël Alwen; Benedikt Auerbach; Miguel Cueto Noval; Karen Klein; Guillermo Pascual-Perez; Krzysztof Pietrzak; Michael Walter 001 (IACR Cryptol. ePrint Arch., 2022)

Post-Quantum Multi-Recipient Public Key Encryption. - Joël Alwen; Dominik Hartmann; Eike Kiltz; Marta Mularczyk; Peter Schwabe (IACR Cryptol. ePrint Arch., 2022)

Analysing the HPKE Standard - Supplementary Material. - Joël Alwen; Bruno Blanchet; Eduard Hauck; Eike Kiltz; Benjamin Lipp 001; Doreen Riepel (Zenodo, 2022)

The Pre-Shared Key Modes of HPKE. - Joël Alwen; Jonas Janneck; Eike Kiltz; Benjamin Lipp 001 (IACR Cryptol. ePrint Arch., 2023)

Fork-Resilient Continuous Group Key Agreement. - Joël Alwen; Marta Mularczyk; Yiannis Tselekounis (IACR Cryptol. ePrint Arch., 2023)

DeCAF: Decentralizable CGKA with Fast Healing. - Joël Alwen; Benedikt Auerbach; Miguel Cueto Noval; Karen Klein; Guillermo Pascual-Perez; Krzyzstof Pietrzak (SCN (2), 2024)

Succinct PPRFs via Memory-Tight Reductions. - Joël Alwen; Chris Brzuska; Jérôme Govinden; Patrick Harasser; Stefano Tessaro (CRYPTO (5), 2025)

Updatable Public-Key Encryption, Revisited. - Joël Alwen; Georg Fuchsbauer; Marta Mularczyk (IACR Cryptol. ePrint Arch., 2025)

Lattice-Based Updatable Public-Key Encryption for Group Messaging. - Joël Alwen; Georg Fuchsbauer; Marta Mularczyk; Doreen Riepel (IACR Cryptol. ePrint Arch., 2025)