Joël Alwen

Orcid: 0000-0002-4473-903X

According to our database1, Joël Alwen authored at least 42 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Fork-Resilient Continuous Group Key Agreement.
IACR Cryptol. ePrint Arch., 2023

The Pre-Shared Key Modes of HPKE.
IACR Cryptol. ePrint Arch., 2023

2022
Post-Quantum Multi-Recipient Public Key Encryption.
IACR Cryptol. ePrint Arch., 2022

CoCoA: Concurrent Continuous Group Key Agreement.
IACR Cryptol. ePrint Arch., 2022

Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging.
IACR Cryptol. ePrint Arch., 2022

2021
Server-Aided Continuous Group Key Agreement.
IACR Cryptol. ePrint Arch., 2021

Modular Design of Secure Group Messaging Protocols and the Security of MLS.
IACR Cryptol. ePrint Arch., 2021

Grafting Key Trees: Efficient Key Management for Overlapping Groups.
IACR Cryptol. ePrint Arch., 2021

Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

2020
On The Insider Security of MLS.
IACR Cryptol. ePrint Arch., 2020

Continuous Group Key Agreement with Active Security.
IACR Cryptol. ePrint Arch., 2020

Analysing the HPKE Standard.
IACR Cryptol. ePrint Arch., 2020

2019
Security Analysis and Improvements for the IETF MLS Standard for Group Messaging.
IACR Cryptol. ePrint Arch., 2019

Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol.
IACR Cryptol. ePrint Arch., 2019

2018
The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol.
IACR Cryptol. ePrint Arch., 2018

Sustained Space Complexity.
IACR Cryptol. ePrint Arch., 2018

2017
Moderately Hard Functions: Definition, Instantiations, and Applications.
IACR Cryptol. ePrint Arch., 2017

Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.
IACR Cryptol. ePrint Arch., 2017

Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space.
IACR Cryptol. ePrint Arch., 2017

Cumulative Space in Black-White Pebbling and Resolution.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
On the Memory-Hardness of Data-Independent Password-Hashing Functions.
IACR Cryptol. ePrint Arch., 2016

Scrypt is Maximally Memory-Hard.
IACR Cryptol. ePrint Arch., 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
IACR Cryptol. ePrint Arch., 2016

Depth-Robust Graphs and Their Cumulative Memory Complexity.
IACR Cryptol. ePrint Arch., 2016

Towards Practical Attacks on Argon2i and Balloon Hashing.
IACR Cryptol. ePrint Arch., 2016

Efficiently Computing Data-Independent Memory-Hard Functions.
IACR Cryptol. ePrint Arch., 2016

2015
Spacemint: A Cryptocurrency Based on Proofs of Space.
IACR Cryptol. ePrint Arch., 2015

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
High Parallel Complexity Graphs and Memory-Hard Functions.
IACR Cryptol. ePrint Arch., 2014

Key-Indistinguishable Message Authentication Codes.
IACR Cryptol. ePrint Arch., 2014

Anonymous Authentication with Shared Secrets.
IACR Cryptol. ePrint Arch., 2014

2013
Learning with Rounding, Revisited: New Reduction, Properties and Applications.
IACR Cryptol. ePrint Arch., 2013

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

2011
Collusion Preserving Computation.
PhD thesis, 2011

Generating Shorter Bases for Hard Random Lattices.
Theory Comput. Syst., 2011

Collusion-Preserving Computation.
IACR Cryptol. ePrint Arch., 2011

2009
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.
IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.
IACR Cryptol. ePrint Arch., 2009

Survey: Leakage Resilience and the Bounded Retrieval Model.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

Collusion-Free Multiparty Computation in the Mediated Model.
Proceedings of the Advances in Cryptology, 2009

2008
Collusion-Free Protocols in the Mediated Model.
Proceedings of the Advances in Cryptology, 2008

2005
Impossibility and Feasibility Results for Zero Knowledge with Public Keys.
Proceedings of the Advances in Cryptology, 2005


  Loading...