Joël Alwen

Daniel Jost

Marta Mularczyk

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Server-Aided Continuous Group Key Agreement.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Analysing the HPKE Standard - Supplementary Material.

[BibT_eX]

[DOI]

Dataset, September, 2021

Grafting Key Trees: Efficient Key Management for Overlapping Groups.

[BibT_eX]

[DOI]

Guillermo Pascual-Perez

Michael Walter

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.

[BibT_eX]

[DOI]

Karen Klein

Guillermo Pascual-Perez

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Analysing the HPKE Standard.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Modular Design of Secure Group Messaging Protocols and the Security of MLS.

[BibT_eX]

[DOI]

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020

Analysing the HPKE Standard - Supplementary Material.

[BibT_eX]

[DOI]

Dataset, November, 2020

Continuous Group Key Agreement with Active Security.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Security Analysis and Improvements for the IETF MLS Standard for Group Messaging.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol.

[BibT_eX]

[DOI]

Guillermo Pascual-Perez

Michael Walter

IACR Cryptol. ePrint Arch., 2019

The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol.

[BibT_eX]

[DOI]

Sandro Coretti

Yevgeniy Dodis

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018

SpaceMint: A Cryptocurrency Based on Proofs of Space.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2018

Sustained Space Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

On the Memory-Hardness of Data-Independent Password-Hashing Functions.

[BibT_eX]

[DOI]

Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017

Moderately Hard Functions: Definition, Instantiations, and Applications.

[BibT_eX]

[DOI]

Björn Tackmann

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Cumulative Space in Black-White Pebbling and Resolution.

[BibT_eX]

[DOI]

Susanna F. de Rezende

Jakob Nordström

Marc Vinyals

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Towards Practical Attacks on Argon2i and Balloon Hashing.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

Scrypt Is Maximally Memory-Hard.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Depth-Robust Graphs and Their Cumulative Memory Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.

[BibT_eX]

[DOI]

Benjamin Harsha

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Efficiently Computing Data-Independent Memory-Hard Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

High Parallel Complexity Graphs and Memory-Hard Functions.

[BibT_eX]

[DOI]

Vladimir Serbinenko

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Key-Indistinguishable Message Authentication Codes.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Anonymous Authentication with Shared Secrets.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

2013

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

Learning with Rounding, Revisited - New Reduction, Properties and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Collusion-Preserving Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Collusion Preserving Computation.

[BibT_eX]

[DOI]

PhD thesis, 2011

2010

Public-Key Encryption in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009

Generating Shorter Bases for Hard Random Lattices.

[BibT_eX]

[DOI]

Chris Peikert

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Survey: Leakage Resilience and the Bounded Retrieval Model.

[BibT_eX]

[DOI]