Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation
C. Hoffmann, K.Z. Pietrzak, in:, 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Springer Nature, 2025, pp. 36–66.

Practical batch proofs of exponentiation
C. Hoffmann, P. Hubádek, S. Ivanova, Cryptology EPrint Archive (n.d.).

Stronger lower bounds for leakage-resilient secret sharing
C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and Information Security in Latin America, Springer Nature, 2023, pp. 215–228.

(Verifiable) delay functions from Lucas sequences
C. Hoffmann, P. Hubádek, C. Kamath, T. Krák, in:, 21st International Conference on Theory of Cryptography, Springer Nature, 2023, pp. 336–362.

Generic-group lower bounds via reductions between geometric-search problems: With and without preprocessing
B. Auerbach, C. Hoffmann, G. Pascual Perez, in:, 21st International Conference on Theory of Cryptography, Springer Nature, 2023, pp. 301–330.

Certifying giant nonprimes
C. Hoffmann, P. Hubádek, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, pp. 530–553.

Public-Key Encryption from Homogeneous CLWE
A. Bogdanov, M. Cueto Noval, C. Hoffmann, A. Rosen, in:, Theory of Cryptography, Springer Nature, 2022, pp. 565–592.

Practical statistically-sound proofs of exponentiation in any group
C. Hoffmann, P. Hubádek, C. Kamath, K. Klein, K.Z. Pietrzak, in:, Advances in Cryptology – CRYPTO 2022, Springer Nature, 2022, pp. 370–399.