Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKathrin Hövelmanns
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c7]Julien Duman
, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh:
A Thorough Treatment of Highly-Efficient NTRU Instantiations. Public Key Cryptography (1) 2023: 65-94- 2022
- [c6]Kathrin Hövelmanns, Andreas Hülsing, Christian Majenz:
Failing Gracefully: Decryption Failures and the Fujisaki-Okamoto Transform. ASIACRYPT (4) 2022: 414-443 - [i8]Kathrin Hövelmanns, Andreas Hülsing, Christian Majenz:
Failing gracefully: Decryption failures and the Fujisaki-Okamoto transform. CoRR abs/2203.10182 (2022) - [i7]Kathrin Hövelmanns, Andreas Hülsing, Christian Majenz:
Failing gracefully: Decryption failures and the Fujisaki-Okamoto transform. IACR Cryptol. ePrint Arch. 2022: 365 (2022) - 2021
- [b1]Kathrin Hövelmanns:
Generic constructions of quantum-resistant cryptosystems. Ruhr University Bochum, Germany, 2021 - [c5]Alex B. Grilo, Kathrin Hövelmanns, Andreas Hülsing, Christian Majenz:
Tight Adaptive Reprogramming in the QROM. ASIACRYPT (1) 2021: 637-667 - [c4]Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler:
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. CCS 2021: 2722-2737 - [i6]Julien Duman, Eike Kiltz, Kathrin Hövelmanns, Vadim Lyubashevsky, Gregor Seiler:
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. IACR Cryptol. ePrint Arch. 2021: 1351 (2021) - [i5]Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh:
A Thorough Treatment of Highly-Efficient NTRU Instantiations. IACR Cryptol. ePrint Arch. 2021: 1352 (2021) - 2020
- [c3]Kathrin Hövelmanns, Eike Kiltz, Sven Schäge, Dominique Unruh:
Generic Authenticated Key Exchange in the Quantum Random Oracle Model. Public Key Cryptography (2) 2020: 389-422 - [i4]Alex B. Grilo, Kathrin Hövelmanns, Andreas Hülsing, Christian Majenz:
Tight adaptive reprogramming in the QROM. CoRR abs/2010.15103 (2020) - [i3]Alex B. Grilo, Kathrin Hövelmanns, Andreas Hülsing, Christian Majenz:
Tight adaptive reprogramming in the QROM. IACR Cryptol. ePrint Arch. 2020: 1361 (2020)
2010 – 2019
- 2019
- [c2]Nina Bindel, Mike Hamburg, Kathrin Hövelmanns, Andreas Hülsing, Edoardo Persichetti:
Tighter Proofs of CCA Security in the Quantum Random Oracle Model. TCC (2) 2019: 61-90 - 2018
- [i2]Kathrin Hövelmanns, Eike Kiltz, Sven Schäge, Dominique Unruh:
Generic Authenticated Key Exchange in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2018: 928 (2018) - 2017
- [c1]Dennis Hofheinz, Kathrin Hövelmanns, Eike Kiltz:
A Modular Analysis of the Fujisaki-Okamoto Transformation. TCC (1) 2017: 341-371 - [i1]Dennis Hofheinz, Kathrin Hövelmanns, Eike Kiltz:
A Modular Analysis of the Fujisaki-Okamoto Transformation. IACR Cryptol. ePrint Arch. 2017: 604 (2017)
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 2023-10-01 22:30 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:
