default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Rückert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
[b1]Markus Rückert:
Lattice-based signature schemes with additional features. Darmstadt University of Technology, 2011, pp. 1-159
Journal Articles
- 2013
- [j2]Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andreas Hülsing
, Markus Rückert:
On the security of the Winternitz one-time signature scheme. Int. J. Appl. Cryptogr. 3(1): 84-96 (2013) - 2009
- [j1]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider:
Post-quantum cryptography: lattice signatures. Computing 85(1-2): 105-125 (2009)
Conference and Workshop Papers
- 2012
- [c13]Jan Camenisch, Gregory Neven, Markus Rückert:
Fully Anonymous Attribute Tokens from Lattices. SCN 2012: 57-75 - 2011
- [c12]Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andreas Hülsing, Markus Rückert:
On the Security of the Winternitz One-Time Signature Scheme. AFRICACRYPT 2011: 363-378 - 2010
- [c11]Markus Rückert, Michael Schneider, Dominique Schröder:
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs. ACNS 2010: 69-86 - [c10]Markus Rückert, Dominique Schröder:
Fair Partially Blind Signatures. AFRICACRYPT 2010: 34-51 - [c9]Markus Rückert:
Lattice-Based Blind Signatures. ASIACRYPT 2010: 413-430 - [c8]Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva:
A Lattice-Based Threshold Ring Signature Scheme. LATINCRYPT 2010: 255-272 - [c7]Markus Rückert:
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles. PQCrypto 2010: 182-200 - [c6]Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva:
Improved Zero-Knowledge Identification with Lattices. ProvSec 2010: 1-17 - [c5]Markus Rückert:
Adaptively Secure Identity-Based Identification from Lattices without Random Oracles. SCN 2010: 345-362 - 2009
- [c4]Markus Rückert:
Verifiably Encrypted Signatures from RSA without NIZKs. INDOCRYPT 2009: 363-377 - [c3]Markus Rückert, Dominique Schröder:
Security of Verifiably Encrypted Signatures and a Construction without Random Oracles. Pairing 2009: 17-34 - [c2]Markus Rückert, Dominique Schröder:
Aggregate and Verifiably Encrypted Signatures from Multilinear Maps without Random Oracles. ISA 2009: 750-759 - 2008
- [c1]Johannes Buchmann, Richard Lindner, Markus Rückert:
Explicit Hard Instances of the Shortest Vector Problem. PQCrypto 2008: 79-94
Informal and Other Publications
- 2013
- [i10]Markus Rückert, Dominique Schröder:
Aggregate and Verifiably Encrypted Signatures from Multilinear Maps Without Random Oracles. IACR Cryptol. ePrint Arch. 2013: 20 (2013) - 2012
- [i9]Jan Camenisch, Gregory Neven, Markus Rückert:
Fully Anonymous Attribute Tokens from Lattices. IACR Cryptol. ePrint Arch. 2012: 356 (2012) - 2011
- [i8]Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andreas Hülsing, Markus Rückert:
On the Security of the Winternitz One-Time Signature Scheme. IACR Cryptol. ePrint Arch. 2011: 191 (2011) - 2010
- [i7]Markus Rückert:
Strongly Unforgeable Signatures and Hierarchical Identity-based Signatures from Lattices without Random Oracles. IACR Cryptol. ePrint Arch. 2010: 70 (2010) - [i6]Markus Rückert, Michael Schneider:
Estimating the Security of Lattice-based Cryptosystems. IACR Cryptol. ePrint Arch. 2010: 137 (2010) - [i5]Markus Rückert, Michael Schneider, Dominique Schröder:
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs. IACR Cryptol. ePrint Arch. 2010: 200 (2010) - 2009
- [i4]Markus Rückert:
Lattice-based Blind Signatures. Algorithms and Number Theory 2009 - [i3]Markus Rückert, Dominique Schröder:
Security of Verifiably Encrypted Signatures. IACR Cryptol. ePrint Arch. 2009: 27 (2009) - 2008
- [i2]Markus Rückert:
Lattice-based Blind Signatures. IACR Cryptol. ePrint Arch. 2008: 322 (2008) - [i1]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider:
Explicit hard instances of the shortest vector problem. IACR Cryptol. ePrint Arch. 2008: 333 (2008)
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-04-25 05:56 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:
