On the efficiency of one-time digital signatures

DOI10.1007/BFB0034843MaRDI QIDQ4536259zbMATH OpenFDO

Authors Daniel Bleichenbacher, Ueli M. Maurer

Publication date 7 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0034843

zbMATH Keywords

cryptographydigital signaturedirected acyclic graphone-way functionpartially ordered set

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Directed acyclic graphs, one-way functions and digital signatures
• The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
• How to construct optimal one-time signatures.
• One-time signatures and chameleon hash functions
• On the security of the Winternitz one-time signature scheme

Cited in

(20)

• How to construct optimal one-time signatures.
• How to sign digital streams
• ID-based cryptography using symmetric primitives
• Asymptotically efficient lattice-based digital signatures
• Strong pseudoprimes to twelve prime bases
• Surnaming schemes, fast verification, and applications to SGX technology
• One-time signatures and chameleon hash functions
• Merkle tree digital signature and trusted computing platform
• On the existence and non-existence of elliptic pseudoprimes
• The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
• Optimal tree-based one-time digital signature schemes
• Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
• Directed acyclic graphs, one-way functions and digital signatures
• On constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality
• On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality
• Asymptotically Efficient Lattice-Based Digital Signatures
• A digital signature with multiple subliminal channels and its applications
• Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
• A new strategy for generating shortest addition sequences
• A one-time signature using run-length encoding

This page was built for publication: On the efficiency of one-time digital signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536259)