Joël Alwen

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 54

Top Topics

Efficiently Computing

Group Key Agreement

Security Analysis

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Joël Alwen, Georg Fuchsbauer, Marta Mularczyk
Updatable Public-Key Encryption, Revisited. EUROCRYPT (6) (2024)
Joël Alwen, Jonas Janneck, Eike Kiltz, Benjamin Lipp
The Pre-Shared Key Modes of HPKE. ASIACRYPT (6) (2023)
Joël Alwen, Marta Mularczyk, Yiannis Tselekounis
Fork-Resilient Continuous Group Key Agreement. IACR Cryptol. ePrint Arch. 2023 (2023)
Joël Alwen, Jonas Janneck, Eike Kiltz, Benjamin Lipp
The Pre-Shared Key Modes of HPKE. IACR Cryptol. ePrint Arch. 2023 (2023)
Joël Alwen, Marta Mularczyk, Yiannis Tselekounis
Fork-Resilient Continuous Group Key Agreement. CRYPTO (4) (2023)
Joël Alwen, Dominik Hartmann, Eike Kiltz, Marta Mularczyk, Peter Schwabe
Post-Quantum Multi-Recipient Public Key Encryption. CCS (2023)
Joël Alwen, Dominik Hartmann, Eike Kiltz, Marta Mularczyk
Server-Aided Continuous Group Key Agreement. CCS (2022)
Joël Alwen, Dominik Hartmann, Eike Kiltz, Marta Mularczyk, Peter Schwabe
Post-Quantum Multi-Recipient Public Key Encryption. IACR Cryptol. ePrint Arch. 2022 (2022)
Joël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter
CoCoA: Concurrent Continuous Group Key Agreement. EUROCRYPT (2) (2022)
Joël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter
CoCoA: Concurrent Continuous Group Key Agreement. IACR Cryptol. ePrint Arch. 2022 (2022)
Joël Alwen, Daniel Jost, Marta Mularczyk
On the Insider Security of MLS. CRYPTO (2) (2022)
Joël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak
Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging. IACR Cryptol. ePrint Arch. 2022 (2022)
Joël Alwen, Dominik Hartmann, Eike Kiltz, Marta Mularczyk
Server-Aided Continuous Group Key Agreement. IACR Cryptol. ePrint Arch. 2021 (2021)
Joël Alwen, Bruno Blanchet, Eduard Hauck, Eike Kiltz, Benjamin Lipp, Doreen Riepel
Analysing the HPKE Standard. EUROCRYPT (1) (2021)
Joël Alwen, Sandro Coretti, Yevgeniy Dodis, Yiannis Tselekounis
Modular Design of Secure Group Messaging Protocols and the Security of MLS. CCS (2021)
Joël Alwen, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter
Grafting Key Trees: Efficient Key Management for Overlapping Groups. TCC (3) (2021)
Joël Alwen, Sandro Coretti, Yevgeniy Dodis, Yiannis Tselekounis
Modular Design of Secure Group Messaging Protocols and the Security of MLS. IACR Cryptol. ePrint Arch. 2021 (2021)
Karen Klein, Guillermo Pascual-Perez, Michael Walter, Chethan Kamath, Margarita Capretto, Miguel Cueto, Ilia Markov, Michelle Yeo, Joël Alwen, Krzysztof Pietrzak
Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement. IEEE Symposium on Security and Privacy (2021)
Joël Alwen, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter
Grafting Key Trees: Efficient Key Management for Overlapping Groups. IACR Cryptol. ePrint Arch. 2021 (2021)
Joël Alwen, Bruno Blanchet, Eduard Hauck, Eike Kiltz, Benjamin Lipp, Doreen Riepel
Analysing the HPKE Standard. IACR Cryptol. ePrint Arch. 2020 (2020)
Joël Alwen, Sandro Coretti, Daniel Jost, Marta Mularczyk
Continuous Group Key Agreement with Active Security. TCC (2) (2020)
Joël Alwen, Sandro Coretti, Yevgeniy Dodis, Yiannis Tselekounis
Security Analysis and Improvements for the IETF MLS Standard for Group Messaging. CRYPTO (1) (2020)
Joël Alwen, Sandro Coretti, Daniel Jost, Marta Mularczyk
Continuous Group Key Agreement with Active Security. IACR Cryptol. ePrint Arch. 2020 (2020)
Joël Alwen, Daniel Jost, Marta Mularczyk
On The Insider Security of MLS. IACR Cryptol. ePrint Arch. 2020 (2020)
Joël Alwen, Margarita Capretto, Miguel Cueto, Chethan Kamath, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter
Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol. IACR Cryptol. ePrint Arch. 2019 (2019)
Joël Alwen, Sandro Coretti, Yevgeniy Dodis, Yiannis Tselekounis
Security Analysis and Improvements for the IETF MLS Standard for Group Messaging. IACR Cryptol. ePrint Arch. 2019 (2019)
Joël Alwen, Sandro Coretti, Yevgeniy Dodis
The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol. EUROCRYPT (1) (2019)
Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolinek, Michal Rybár
On the Memory-Hardness of Data-Independent Password-Hashing Functions. AsiaCCS (2018)
Joël Alwen, Sandro Coretti, Yevgeniy Dodis
The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol. IACR Cryptol. ePrint Arch. 2018 (2018)
Sunoo Park, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joël Alwen, Krzysztof Pietrzak
SpaceMint: A Cryptocurrency Based on Proofs of Space. Financial Cryptography (2018)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Sustained Space Complexity. EUROCRYPT (2) (2018)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Sustained Space Complexity. IACR Cryptol. ePrint Arch. 2018 (2018)
Joël Alwen, Jeremiah Blocki, Benjamin Harsha
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2017 (2017)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Depth-Robust Graphs and Their Cumulative Memory Complexity. EUROCRYPT (3) (2017)
Joël Alwen, Björn Tackmann
Moderately Hard Functions: Definition, Instantiations, and Applications. TCC (1) (2017)
Joël Alwen, Jeremiah Blocki, Benjamin Harsha
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. CCS (2017)
Joël Alwen, Jeremiah Blocki
Towards Practical Attacks on Argon2i and Balloon Hashing. EuroS&P (2017)
Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
Cumulative Space in Black-White Pebbling and Resolution. ITCS (2017)
Joël Alwen, Björn Tackmann
Moderately Hard Functions: Definition, Instantiations, and Applications. IACR Cryptol. ePrint Arch. 2017 (2017)
Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro
Scrypt Is Maximally Memory-Hard. EUROCRYPT (3) (2017)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Sustained Space Complexity. CoRR (2017)
Hamza Abusalah, Joël Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, Leonid Reyzin
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. ASIACRYPT (2) (2017)
Hamza Abusalah, Joël Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, Leonid Reyzin
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. IACR Cryptol. ePrint Arch. 2017 (2017)
Joël Alwen, Jeremiah Blocki
Efficiently Computing Data-Independent Memory-Hard Functions. CRYPTO (2) (2016)
Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. EUROCRYPT (2) (2016)
Joël Alwen, Jeremiah Blocki
Efficiently Computing Data-Independent Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro
Scrypt is Maximally Memory-Hard. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolínek, Michal Rybár
On the Memory-Hardness of Data-Independent Password-Hashing Functions. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Jeremiah Blocki
Towards Practical Attacks on Argon2i and Balloon Hashing. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Depth-Robust Graphs and Their Cumulative Memory Complexity. IACR Cryptol. ePrint Arch. 2016 (2016)
Sunoo Park, Krzysztof Pietrzak, Albert Kwon, Joël Alwen, Georg Fuchsbauer, Peter Gazi
Spacemint: A Cryptocurrency Based on Proofs of Space. IACR Cryptol. ePrint Arch. 2015 (2015)
Joël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, Vassilis Zikas
Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting. CRYPTO (2) (2015)
Joël Alwen, Vladimir Serbinenko
High Parallel Complexity Graphs and Memory-Hard Functions. STOC (2015)
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
Key-Indistinguishable Message Authentication Codes. IACR Cryptol. ePrint Arch. 2014 (2014)
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
Key-Indistinguishable Message Authentication Codes. SCN (2014)
Joël Alwen, Vladimir Serbinenko
High Parallel Complexity Graphs and Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2014 (2014)
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
Anonymous Authentication with Shared Secrets. IACR Cryptol. ePrint Arch. 2014 (2014)
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
Anonymous Authentication with Shared Secrets. LATINCRYPT (2014)
Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, Daniel Wichs
Learning with Rounding, Revisited - New Reduction, Properties and Applications. CRYPTO (1) (2013)
Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, Daniel Wichs
Learning with Rounding, Revisited: New Reduction, Properties and Applications. IACR Cryptol. ePrint Arch. 2013 (2013)
Joël Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, S. Dov Gordon, Stefano Tessaro, David A. Wilson
On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption. IMACC (2013)
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas
Collusion-Preserving Computation. CRYPTO (2012)
Joël Alwen, Chris Peikert
Generating Shorter Bases for Hard Random Lattices. Theory Comput. Syst. 48 (3) (2011)
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas
Collusion-Preserving Computation. IACR Cryptol. ePrint Arch. 2011 (2011)
Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs
Public-Key Encryption in the Bounded-Retrieval Model. EUROCRYPT (2010)
Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs
Public-Key Encryption in the Bounded-Retrieval Model. IACR Cryptol. ePrint Arch. 2009 (2009)
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. IACR Cryptol. ePrint Arch. 2009 (2009)
Joël Alwen, Chris Peikert
Generating Shorter Bases for Hard Random Lattices. STACS (2009)
Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti
Collusion-Free Multiparty Computation in the Mediated Model. CRYPTO (2009)
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
Survey: Leakage Resilience and the Bounded Retrieval Model. ICITS (2009)
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. CRYPTO (2009)
Joël Alwen, Chris Peikert
Generating Shorter Bases for Hard Random Lattices. IACR Cryptol. ePrint Arch. 2008 (2008)
Joël Alwen, Abhi Shelat, Ivan Visconti
Collusion-Free Protocols in the Mediated Model. CRYPTO (2008)
Joël Alwen, Giuseppe Persiano, Ivan Visconti
Impossibility and Feasibility Results for Zero Knowledge with Public Keys. CRYPTO (2005)