Joël Alwen

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017
Moderately Hard Functions: Definition, Instantiations, and Applications.
IACR Cryptology ePrint Archive, 2017

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

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

Sustained Space Complexity.
CoRR, 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 Cryptology ePrint Archive, 2016

Scrypt is Maximally Memory-Hard.
IACR Cryptology ePrint Archive, 2016

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

Depth-Robust Graphs and Their Cumulative Memory Complexity.
IACR Cryptology ePrint Archive, 2016

Towards Practical Attacks on Argon2i and Balloon Hashing.
IACR Cryptology ePrint Archive, 2016

Efficiently Computing Data-Independent Memory-Hard Functions.
IACR Cryptology ePrint Archive, 2016

2015
Spacemint: A Cryptocurrency Based on Proofs of Space.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2014

Key-Indistinguishable Message Authentication Codes.
IACR Cryptology ePrint Archive, 2014

Anonymous Authentication with Shared Secrets.
IACR Cryptology ePrint Archive, 2014

2013
Learning with Rounding, Revisited: New Reduction, Properties and Applications.
IACR Cryptology ePrint Archive, 2013

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

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

Collusion-Preserving Computation.
IACR Cryptology ePrint Archive, 2011

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

Public-Key Encryption in the Bounded-Retrieval Model.
IACR Cryptology ePrint Archive, 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...