Joël Alwen

Krzyzstof Pietrzak

Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Updatable Public-Key Encryption, Revisited.

[BibT_eX]

[DOI]

Georg Fuchsbauer

Marta Mularczyk

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023

Fork-Resilient Continuous Group Key Agreement.

[BibT_eX]

[DOI]

Marta Mularczyk

Yiannis Tselekounis

IACR Cryptol. ePrint Arch., 2023

The Pre-Shared Key Modes of HPKE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

2022

Analysing the HPKE Standard - Supplementary Material.

[BibT_eX]

[DOI]

Dataset, August, 2022

Post-Quantum Multi-Recipient Public Key Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

CoCoA: Concurrent Continuous Group Key Agreement.

[BibT_eX]

[DOI]

Michael Walter

IACR Cryptol. ePrint Arch., 2022

Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

Analysing the HPKE Standard - Supplementary Material.

[BibT_eX]

[DOI]

Dataset, September, 2021

Server-Aided Continuous Group Key Agreement.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Grafting Key Trees: Efficient Key Management for Overlapping Groups.

[BibT_eX]

[DOI]

Michael Walter

IACR Cryptol. ePrint Arch., 2021

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

[BibT_eX]

[DOI]

Karen Klein

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

2020

Analysing the HPKE Standard - Supplementary Material.

[BibT_eX]

[DOI]

Dataset, November, 2020

On The Insider Security of MLS.

[BibT_eX]

[DOI]

Daniel Jost

Marta Mularczyk

IACR Cryptol. ePrint Arch., 2020

Continuous Group Key Agreement with Active Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Analysing the HPKE Standard.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

Michael Walter

IACR Cryptol. ePrint Arch., 2019

2018

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

[BibT_eX]

[DOI]

Sandro Coretti

Yevgeniy Dodis

IACR Cryptol. ePrint Arch., 2018

Sustained Space Complexity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

2017

Moderately Hard Functions: Definition, Instantiations, and Applications.

[BibT_eX]

[DOI]

Björn Tackmann

IACR Cryptol. ePrint Arch., 2017

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

[BibT_eX]

[DOI]

Benjamin Harsha

IACR Cryptol. ePrint Arch., 2017

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 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

2016

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Scrypt is Maximally Memory-Hard.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Depth-Robust Graphs and Their Cumulative Memory Complexity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Towards Practical Attacks on Argon2i and Balloon Hashing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Efficiently Computing Data-Independent Memory-Hard Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2015

Spacemint: A Cryptocurrency Based on Proofs of Space.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

High Parallel Complexity Graphs and Memory-Hard Functions.

[BibT_eX]

[DOI]

Vladimir Serbinenko

IACR Cryptol. ePrint Arch., 2014

Key-Indistinguishable Message Authentication Codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Anonymous Authentication with Shared Secrets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2013

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 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

2011

Collusion Preserving Computation.

[BibT_eX]

[DOI]

PhD thesis, 2011

Collusion-Preserving Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

2009

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Daniel Wichs

IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Survey: Leakage Resilience and the Bounded Retrieval Model.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Daniel Wichs

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

Collusion-Free Multiparty Computation in the Mediated Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Generating Shorter Bases for Hard Random Lattices.

[BibT_eX]

[DOI]

Chris Peikert

IACR Cryptol. ePrint Arch., 2008

Collusion-Free Protocols in the Mediated Model.

[BibT_eX]

[DOI]

Abhi Shelat

Ivan Visconti

Proceedings of the Advances in Cryptology, 2008

2005

Impossibility and Feasibility Results for Zero Knowledge with Public Keys.

[BibT_eX]

[DOI]