Charlotte Hoffmann

Orcid: 0000-0003-2027-5549

According to our database1, Charlotte Hoffmann authored at least 12 papers between 2022 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Practical Batch Proofs of Exponentiation.
IACR Commun. Cryptol., 2025

Watermarkable and Zero-Knowledge Verifiable Delay Functions from Any Proof of Exponentiation.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

On Extractability of the KZG Family of Polynomial Commitment Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Traceable Secret Sharing Based on the Chinese Remainder Theorem.
IACR Cryptol. ePrint Arch., 2024

2023
Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups.
Exp. Math., October, 2023

(Verifiable) Delay Functions from Lucas Sequences.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Certifying Giant Nonprimes.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Stronger Lower Bounds for Leakage-Resilient Secret Sharing.
Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

2022
Public-Key Encryption from Continuous LWE.
Electron. Colloquium Comput. Complex., 2022

Public-Key Encryption from Homogeneous CLWE.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Practical Statistically-Sound Proofs of Exponentiation in Any Group.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022


  Loading...