default search action
Charlotte Hoffmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j1]Christopher H. Cashen
, Charlotte Hoffmann
Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups. Exp. Math. 32(4): 631-640 (2023)
Conference and Workshop Papers
- 2023
- [c6]Charlotte Hoffmann
Stronger Lower Bounds for Leakage-Resilient Secret Sharing. LATINCRYPT 2023: 215-228 - [c5]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath
Certifying Giant Nonprimes. Public Key Cryptography (1) 2023: 530-553 - [c4]Benedikt Auerbach
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing. TCC (3) 2023: 301-330 - [c3]Charlotte Hoffmann
(Verifiable) Delay Functions from Lucas Sequences. TCC (4) 2023: 336-362 - 2022
- [c2]Charlotte Hoffmann
Practical Statistically-Sound Proofs of Exponentiation in Any Group. CRYPTO (2) 2022: 370-399 - [c1]Andrej Bogdanov
Public-Key Encryption from Homogeneous CLWE. TCC (2) 2022: 565-592
Informal and Other Publications
- 2024
- [i10]Charlotte Hoffmann, Pavel Hubácek, Svetlana Ivanova:
Practical Batch Proofs of Exponentiation. IACR Cryptol. ePrint Arch. 2024: 145 (2024) - [i9]Charlotte Hoffmann, Krzysztof Pietrzak:
Watermarkable and Zero-Knowledge Verifiable Delay Functions from any Proof of Exponentiation. IACR Cryptol. ePrint Arch. 2024: 481 (2024) - [i8]Charlotte Hoffmann:
Traceable Secret Sharing Based on the Chinese Remainder Theorem. IACR Cryptol. ePrint Arch. 2024: 811 (2024) - 2023
- [i7]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak:
Certifying Giant Nonprimes. IACR Cryptol. ePrint Arch. 2023: 238 (2023) - [i6]Benedikt Auerbach
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing. IACR Cryptol. ePrint Arch. 2023: 808 (2023) - [i5]Charlotte Hoffmann, Mark Simkin:
Stronger Lower Bounds for Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 1017 (2023) - [i4]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák:
(Verifiable) Delay Functions from Lucas Sequences. IACR Cryptol. ePrint Arch. 2023: 1404 (2023) - 2022
- [i3]Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen:
Public-Key Encryption from Continuous LWE. Electron. Colloquium Comput. Complex. TR22 (2022) - [i2]Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen:
Public-Key Encryption from Continuous LWE. IACR Cryptol. ePrint Arch. 2022: 93 (2022) - [i1]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Practical Statistically-Sound Proofs of Exponentiation in any Group. IACR Cryptol. ePrint Arch. 2022: 1021 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: