default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamed Düzlü
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[b1]Samed Düzlü:
On the Relation between Efficiency, Security, and Practicality of Structured Lattices in Cryptography. University of Regensburg, Germany, 2025- [c6]Sebastian Clermont
, Samed Düzlü, Christian Janson, Laurens Porzenheim, Patrick Struck:
Lattice-Based Sanitizable Signature Schemes: Chameleon Hash Functions and More. PQCrypto (1) 2025: 278-311 - [i7]Sebastian Clermont, Samed Düzlü, Christian Janson, Laurens Porzenheim, Patrick Struck:
Lattice-Based Sanitizable Signature Schemes: Chameleon Hash Functions and More. IACR Cryptol. ePrint Arch. 2025: 602 (2025) - 2024
- [c5]Samed Düzlü, Patrick Struck:
The Role of Message-Bound Signatures for the Beyond UnForgeability Features and Weak Keys. ISC (2) 2024: 61-80 - [c4]Thomas Aulbach, Samed Düzlü, Michael Meyer, Patrick Struck, Maximiliane Weishäupl:
Hash Your Keys Before Signing - BUFF Security of the Additional NIST PQC Signatures. PQCrypto (2) 2024: 301-335 - [c3]Samed Düzlü, Rune Fiedler, Marc Fischlin:
BUFFing FALCON Without Increasing the Signature Size. SAC (1) 2024: 131-150 - [i6]Thomas Aulbach, Samed Düzlü, Michael Meyer, Patrick Struck, Maximiliane Weishäupl:
Hash your Keys before Signing: BUFF Security of the Additional NIST PQC Signatures. IACR Cryptol. ePrint Arch. 2024: 591 (2024) - [i5]Samed Düzlü, Rune Fiedler, Marc Fischlin:
BUFFing FALCON without Increasing the Signature Size. IACR Cryptol. ePrint Arch. 2024: 710 (2024) - [i4]Samed Düzlü, Patrick Struck:
The Role of Message-Bound Signatures for the Beyond UnForgeability Features and Weak Keys. IACR Cryptol. ePrint Arch. 2024: 1669 (2024) - 2023
- [c2]Samed Düzlü, Juliane Krämer, Thomas Pöppelmann, Patrick Struck:
A Lightweight Identification Protocol Based on Lattices. Public Key Cryptography (1) 2023: 95-113 - [i3]Samed Düzlü, Juliane Krämer, Thomas Pöppelmann, Patrick Struck:
A Lightweight Identification Protocol Based on Lattices. IACR Cryptol. ePrint Arch. 2023: 222 (2023) - 2022
- [j1]Samed Düzlü, Juliane Krämer:
Application of automorphic forms to lattice problems. J. Math. Cryptol. 16(1): 156-197 (2022) - [i2]Samed Düzlü, Juliane Krämer:
Application of Automorphic Forms to Lattice Problems. IACR Cryptol. ePrint Arch. 2022: 742 (2022) - 2021
- [c1]Cas Cremers, Samed Düzlü, Rune Fiedler, Marc Fischlin, Christian Janson:
BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures. SP 2021: 1696-1714 - 2020
- [i1]Cas Cremers, Samed Düzlü, Rune Fiedler, Marc Fischlin, Christian Janson:
BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures. IACR Cryptol. ePrint Arch. 2020: 1525 (2020)
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 2025-10-01 00:12 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:
