Skip to main content

Cryptography

Computer Science

Image of Krzysztof Pietrzak

Krzysztof Pietrzak

Professor


1 Career

  • Since 2016 Professor, Institute of Science and Technology Austria (ISTA)
  • 2011 – 2016 Assistant Professor, Institute of Science and Technology Austria (ISTA)
  • 2020 – 2025 Area Chair, Information and System Sciences, ISTA
  • 2006 – 2011 Postdoc, CWI Amsterdam, the Netherlands
  • 2006 Postdoc, ENS Paris, France
  • 2005 PhD, ETH Zürich, Switzerland

1.1 Selected Distinctions

  • 2019 – 2025 ERC CoG Panel member.
  • 2011, 2017, 2018 Best Paper Awards at Eurocrypt
  • 2015, 2025 Invited Long-Term Participant at Simons Programs “Cryptography” in 2015
    and “Cryptography 10 Years Later” in 2025.
  • 2016 General Chair Eurocrypt 2016 (in Vienna).
  • Since 2022 Steering Committee of TCC (Theory of Cryptography Conference), since 2022

1.2 Selected Grants

  • 2016 – 2021 ERC Consolidator Grant (€ 1,800,000) Teaching Old Crypto New Tricks (TOC-NeT).
  • 2023 – 2026 FWF SFB SPyCoDe (F85). Awarded overall: € 4,417,704; awarded to RG: € 291,849.
  • 2026 – 2030 Foundations and Applications of Resource-Restricted Cryptography (WWTF Project ICT25-081): € 878,848, awarded to RG: € 290,000.

1.3 Tech Transfer (Patents, Spin-Offs)

I’m a scientific advisor to the Chia Network chia.net. This is a San-Francisco based Blockchain
company (CEO is Bram Cohen, the creator if BitTorrent) that build a sustainable Blockchain
using proofs of space (a proof system I co-invented) and verifiable-delay functions (a primitve I
constructed). Chia did file some defensive patents, I’m listed as co-inventor on three of them.

  • US20230283474A1: Consensus layer architecture for maintaining security with reduced processing power dependency in untrusted decentralized computing platforms.
  • US11924355B2: Methods for grinding-resistant consensus in a proof-of-space-based blockchain.
  • US11934387B2: Methods for extending a proof-of-space-time blockchain.

1.4 Selected Publications

  1. [ANEP25] Benedikt Auerbach, Miguel Cueto Noval, Boran Erol, and Krzysztof Pietrzak. Continuous group-key agreement: Concurrent updates without pruning. CRYPTO 2025.
  2. [GP24] Christoph U. Günther and Krzysztof Pietrzak; Deniability in automated contact tracing: Impossibilities and possibilities. Proc. Priv. Enhancing Technol. 2024.
  3. [CHKPGR19] Arka Rai Choudhuri, Pavel Hubacek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum: Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC 2019.
  4. [Pie19a] Krzysztof Pietrzak: Simple Verifiable Delay Functions. Innovations in Theoretical Computer Science (ITCS) 2019.
  5. [Pie19b] Krzysztof Pietrzak: Proofs of Catalytic Space. Innovations in Theoretical Computer Science (ITCS) 2019.

2 Group Members

  • Mirza Ahad Baig, PhD Student since 2020
  • Miguel Cueto Noval, PhD Student since 2021
  • Christoph Günther, PhD Student since 2022
  • Charlotte Hoffmann, Postdoc since 2025
  • Ray Neiheiser, Postdoc since 2022
  • Akin Ünal, Postdoc since 2024

3 Research

The cryptography group at ISTA works on various theoretical and practical aspects of cryptography. A central pillar of modern cryptography is provable security, where schemes are designed and analyzed via reductions to well-established hardness assumptions. Much of our work follows this paradigm, while also exploring new settings motivated by real-world systems.

Over the past seven years, a main research direction has been secure group messaging, motivated by the IETF MLS standardization effort. The goal is to construct efficient protocols for large groups that achieve the strong security guarantees known from protocols like Signal in the two-party setting. Our latest work (CRYPTO 2025) shows that the IETF standard TreeKEM does not achieve its intended efficiency under concurrent updates, and proposes a protocol that does.

Another major line of research, originally motivated by sustainable blockchain systems such as Chia, studies proofs of space and timed cryptography, in particular verifiable delay functions (VDFs). Additional topics include privacy-preserving protocols (e.g., contact tracing) and adaptive security. Overall, our work aims to develop rigorous foundations and practical protocols for cryptographic systems in large-scale, open environments.


3.1 Current Scientific Projects/Directions

  • Group Messaging
  • Timed Cryptography (lead by previous PhD student, now postdoc Charlotte Hoffman)
  • Foundations and Applications of Space Hard Cryptography (Proofs of Space, Memory Hard
    functions)
  • Algebraic Cryptanalysis (lead by postdoc Akin Ünal, funded through FWF ESPRIT fellowship
    ProvACAna: Provable Algebraic CryptAnalysis 2026-2029)
  • Scalable Distributed Systems/Blockchains (lead by postdoc Ray Neiheiser)
  • Cryptographic Proof systems for DePIN (Decentralized Physical Infrastructure)
  • Individual Cryptography / Proofs of Complete Knowledge

3.2 Research in Focus

A result I’m particularly fond of is the construction of the Verifiable Delay Function from [Pie19a].

Back in 2015, I started discussing sustainable Blockchains with Bram Cohen. We had a roadmap, but there were many technical challenges, the main being the fact that we required some ”proof of time” that didn’t exist back then. The closest were proofs of sequential work (PoSW) by Mahmoody, Moran and Vadhan from ITCS’13. With Bram Cohen, we gave the first practical construction which won the best paper award at Eurocrypt’18, one of the two main annual cryptography conferences. But PoSW lacked a crucial “uniqueness” property. A stronger notion termed “Verifiable Delay Function” was proposed by Boneh et al. at Crypto’18. They proposed a construction, but it was based on general incrementally verifiable computation, and thus was not practical.

The construction from [Pie19a] was the first, and, with the concurrent proposal of Wesolowski, one of only two practical constructions that exist. While it typically takes decades from a cryptographic construction being proposed in a conference paper to it’s deployment, in Blockchains things move faster, and my VDF was implemented in various projects within months.

A very surprising application of the “proof of exponentiation” form [Pie19a] was to computational number theory through its adaption by the Great Internet Mersenne Prime Search (GIMPS). Citing mersenne.org: “BIG Changes Are Here! Prime95 version 30.3 released. For almost 25 years, GIMPS has looked for new Mersenne primes by running a primality test on one computer and later running the exact same primality test on another computer to guard against hardware errors having corrupted the first primality test. A breakthrough by Krzysztof Pietrzak makes it possible to eliminate the second primality test!. . . ”.

Other unexpected applications were in complexity theory, in particular to proving that finding a NASH equilibrium is hard and the Fiat-Shamir heuristic (https://eprint.iacr.org/2020/772, https://eprint.iacr.org/2019/667).



theme sidebar-arrow-up
Back to Top