Charlotte Hoffmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Charlotte Hoffmann has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Pavel Hubáček
Czech Academy of Sciences
5 shared publications - Chethan Kamath
Tel Aviv University
3 shared publications - Krzysztof Pietrzak
ISTA
2 shared publications - Alon Rosen
Bocconi University, Milan, Italy
1 shared publication - Andrej Bogdanov
University of Ottawa
1 shared publication - Benedikt Auerbach
PQShield
1 shared publication
Latest Publications
- Open Access
- 6 October 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (3)
Practical Batch Proofs of Exponentiation
A Proof of Exponentiation (PoE) allows a prover to efficiently convince a verifier that y = x e in some group of unknown order. PoEs are the basis for practical constructions of Verifiable Delay Functions (VDFs), which, in turn, are important for various higher-level protocols in distributed computing. In applications such as distributed consensus, many PoEs are generated regularly, motivating protocols for secure aggregation of batches of statements into a few statements to improve the efficiency for both parties. Rotem (TCC 2021) recently presented two such generic batch PoEs. In this work, we introduce two batch PoEs that outperform both proposals of Rotem and we evaluate their practicality. First, we show that the two batch PoEs of Rotem can be combined to improve the overall efficiency by at least a factor of two. Second, we revisit the work of Bellare, Garay and Rabin (EUROCRYPT 1998) on batch verification of digital signatures and show that, under the low order assumption, their bucket test can be securely adapted to the setting of groups of unknown order. The resulting batch PoE quickly outperforms the state of the art in the expected number of group multiplications with the growing number of instances, and it decreases the cost of batching by an order of magnitude already for hundreds of thousands of instances. Importantly, it is the first batch PoE that significantly decreases both the proof size and complexity of verification. Our experimental evaluations show that even a non-optimized implementation achieves such improvements, which would match the demands of real-life systems requiring large-scale PoE processing. Our proof techniques are conceptually similar to Rotem. However, we give an improved analysis of the application of the low order assumption towards secure batching of PoE instances, resulting in a tight reduction, which is important when setting the security parameter in practice. Finally, we discuss a new application of batch PoEs towards efficient remote attestation of parallel computational power. We show that, under a natural generalization of the hardness of iterated squaring in groups of unknown order, any batch PoE can be used to construct a secure protocol for testing the parallelism of the prover with optimal communication complexity independent of the claimed number of available processors.
- 6 October 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (3)
Open AccessPractical Batch Proofs of Exponentiation
A Proof of Exponentiation (PoE) allows a prover to efficiently convince a verifier that y = x e in some group of unknown order. PoEs are the basis for practical constructions of Verifiable Delay Functions (VDFs), which, in turn, are important for various higher-level protocols in distributed computing. In applications such as distributed consensus, many PoEs are generated regularly, motivating protocols for secure aggregation of batches of statements into a few statements to improve the efficiency for both parties. Rotem (TCC 2021) recently presented two such generic batch PoEs. In this work, we introduce two batch PoEs that outperform both proposals of Rotem and we evaluate their practicality. First, we show that the two batch PoEs of Rotem can be combined to improve the overall efficiency by at least a factor of two. Second, we revisit the work of Bellare, Garay and Rabin (EUROCRYPT 1998) on batch verification of digital signatures and show that, under the low order assumption, their bucket test can be securely adapted to the setting of groups of unknown order. The resulting batch PoE quickly outperforms the state of the art in the expected number of group multiplications with the growing number of instances, and it decreases the cost of batching by an order of magnitude already for hundreds of thousands of instances. Importantly, it is the first batch PoE that significantly decreases both the proof size and complexity of verification. Our experimental evaluations show that even a non-optimized implementation achieves such improvements, which would match the demands of real-life systems requiring large-scale PoE processing. Our proof techniques are conceptually similar to Rotem. However, we give an improved analysis of the application of the low order assumption towards secure batching of PoE instances, resulting in a tight reduction, which is important when setting the security parameter in practice. Finally, we discuss a new application of batch PoEs towards efficient remote attestation of parallel computational power. We show that, under a natural generalization of the hardness of iterated squaring in groups of unknown order, any batch PoE can be used to construct a secure protocol for testing the parallelism of the prover with optimal communication complexity independent of the claimed number of available processors.
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 584-616
On Extractability of the KZG Family of Polynomial Commitment Schemes
- 17 August 2025
- Published by Springer Nature
- p. 584-616
Open AccessOn Extractability of the KZG Family of Polynomial Commitment Schemes
- 5 May 2025
- Published by Springer Nature
- p. 36-66
Watermarkable and Zero-Knowledge Verifiable Delay Functions from Any Proof of Exponentiation
- 5 May 2025
- Published by Springer Nature
- p. 36-66
Watermarkable and Zero-Knowledge Verifiable Delay Functions from Any Proof of Exponentiation
- 27 November 2023
- Published by Springer Nature
- p. 336-362
(Verifiable) Delay Functions from Lucas Sequences
- 27 November 2023
- Published by Springer Nature
- p. 336-362
(Verifiable) Delay Functions from Lucas Sequences
- 27 November 2023
- Published by Springer Nature
- p. 301-330
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing
- 27 November 2023
- Published by Springer Nature
- p. 301-330
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing
- 26 September 2023
- Published by Springer Nature
- p. 215-228
Stronger Lower Bounds for Leakage-Resilient Secret Sharing
- 26 September 2023
- Published by Springer Nature
- p. 215-228
Stronger Lower Bounds for Leakage-Resilient Secret Sharing
- 13 October 2022
- Published by Springer Nature
- p. 370-399
Practical Statistically-Sound Proofs of Exponentiation in Any Group
- 13 October 2022
- Published by Springer Nature
- p. 370-399
Practical Statistically-Sound Proofs of Exponentiation in Any Group
- Open Access
- 2 October 2021
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 32 (4) , 631-640
Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups
We give experimental support for a conjecture of Louder and Wilton saying that words of imprimitivity rank greater than two yield hyperbolic one-relator groups.
- 2 October 2021
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 32 (4) , 631-640
Open AccessShort, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups
We give experimental support for a conjecture of Louder and Wilton saying that words of imprimitivity rank greater than two yield hyperbolic one-relator groups.