My interests in cryptography include blockchains, random-number generation, secure communication, symmetric primitives, public-key encryption, non-malleable codes, multi-party computation, as well as cryptocurrencies and blockchains. I've also worked in the area of quantum information in the past.
Multi-Source Randomness Extraction and Generation in the Random-Oracle Model
with Pooya Farshim, Patrick Harasser, and Karl Southern
ITC 2025, 6th Conference on Information-Theoretic Cryptography, LIPIcs, vol. 343, pp. 10:1–10:23, Aug 2025.
High-Throughput Permissionless Blockchain Consensus Under Realistic Network Assumptions
with Matthias Fitzi, Aggelos Kiayias, Giorgos Panagiotakos, and Alexander Russell
CRYPTO 2025, Lecture Notes in Computer Science, Springer, vol. 16001, pp. 69–100, Aug 2025.
The Generals' Scuttlebutt: Byzantine-Resilient Gossip Protocols
with Aggelos Kiayias, Cristopher Moore, and Alexander Russell
CCS 2022, 2022 ACM SIGSAC Conference on Computer and Communications Security, ACM, pp. 595–608, Nov 2022.
On Seedless PRNGs and Premature Next
with Yevgeniy Dodis, Harish Karthikeyan, Noah Stephens-Davidowitz, and Stefano Tessaro
ITC 2022, 3rd Conference on Information-Theoretic Cryptography, LIPIcs, vol. 230, pp. 9:1–9:20, Jul 2022.
Modular Design of Secure Group Messaging Protocols and the Security of {MLS}
with Joël Alwen, Yevgeniy Dodis, and Yiannis Tselekounis
CCS 2021, 2021 ACM SIGSAC Conference on Computer and Communications Security, ACM, pp. 1463–1483, Nov 2021.
Fast Isomorphic State Channels
with Manuel M. T. Chakravarty, Matthias Fitzi, Peter Gazi, Philipp Kant, Aggelos Kiayias, and Alexander Russell
FC 2021, Lecture Notes in Computer Science, Springer, vol. 12675, pp. 339–358, Mar 2021.
Continuous Group Key Agreement with Active Security
with Joël Alwen, Daniel Jost, and Marta Mularczyk
TCC 2020, Lecture Notes in Computer Science, Springer, vol. 12551, pp. 261–290, Nov 2020.
Security Analysis and Improvements for the IETF MLS Standard for Group Messaging
with Joël Alwen, Yevgeniy Dodis, and Yiannis Tselekounis
CRYPTO 2020. Lecture Notes in Computer Science, Springer, vol. 12170, pp. 248–277, Aug 2020.
Seedless Fruit Is the Sweetest: Random-Number Generation, Revisited
with Yevgeniy Dodis, Harish Karthikeyan, and Stefano Tessaro
CRYPTO 2019. Lecture Notes in Computer Science, Springer, vol. 11692, pp. 205–234, Aug 2019.
Rate-Optimizing Compilers for Continuously Non-Malleable Codes
with Antonio Faonio and Daniele Venturi
ACNS 2019. Lecture Notes in Computer Science, Springer, vol. 11464, pp. 3–23, June 2019.
The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol
with Joël Alwen and Yevgeniy Dodis
EUROCRYPT 2019. Lecture Notes in Computer Science, Springer, vol. 11476, pp. 129–158, May 2019.
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
with Yevgeniy Dodis and Siyao Guo
CRYPTO 2018. Lecture Notes in Computer Science, Springer, vol. 10991, pp. 693–721, August 2018.
Random Oracles and Non-Uniformity
with Yevgeniy Dodis, Siyao Guo, and John Steinberger
EUROCRYPT 2018, Lecture Notes in Computer Science, Springer, vol. 10820, pp. 227–258, April 2018.
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
with Ran Cohen, Juan Garay, and Vassilis Zikas
ICALP 2017, LIPIcs, vol. 80, 37:1-37:15.
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
with Juan Garay, Martin Hirt, and Vassilis Zikas
ASIACRYPT 2016, Lecture Notes in Computer Science, Springer, vol. 10032, pp. 998–1021, August 2016.
Probabilistic Termination and Composability of Cryptographic Protocols
with Ran Cohen, Juan Garay, and Vassilis Zikas
CRYPTO 2016, Lecture Notes in Computer Science, Springer, vol. 9816, pp. 240–269, August 2016.
Non-Malleable Encryption: Simpler, Shorter, Stronger
with Yevgeniy Dodis, Björn Tackmann, and Daniele Venturi
TCC 2016-A, Lecture Notes in Computer Science, Springer, vol. 9562, pp. 306–335, Jan 2016.
From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes
with Ueli Maurer, Björn Tackmann, and Daniele Venturi
TCC 2015, Lecture Notes in Computer Science, Springer, vol. 9014, pp. 532–560, Mar 2015.
Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited
with Ueli Maurer and Björn Tackmann
ASIACRYPT 2013, Lecture Notes in Computer Science, Springer, vol. 8269, pp. 134–153, Dec 2013.
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
with Ran Cohen, Juan Garay, and Vassilis Zikas
J. Cryptology, vol. 34(2), pp. 12, 2021.
Probabilistic Termination and Composability of Cryptographic Protocols
with Ran Cohen, Juan Garay, and Vassilis Zikas
J. Cryptology, vol. 32(3), pp. 690–741, Oct 2019.
with Esther Hänggi and Stefan Wolf
Phys. Rev. Lett., American Physical Society, vol. 107, pp. 100402, Aug 2011.
A Constructive Perspective on Key Encapsulation
with Ueli Maurer and Björn Tackmann
Number Theory and Cryptography, Lecture Notes in Computer Science, Springer, vol. 8260, pp. 226–239, 2013.
with Ueli Maurer and Björn Tackmann
IACR Cryptology ePrint Archive, 2013/555 (2013).