Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures

DOI10.1007/978-3-319-12475-9_10MaRDI QIDQ2948146zbMATH OpenOpenAlexFDO

Authors Ahto Buldas, Risto Laanoja, Peeter Laud, Ahto Truu

Publication date 29 September 2015

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12475-9_10

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Generalized First Pre-image Tractable Random Oracle Model and Signature Schemes
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Faster hash-based signatures with bounded leakage
• Efficient unconditionally secure signatures using universal hashing
• Identity-based chameleon hashing and signatures without key exposure
• Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
• Efficient Partially Blind Signatures with Provable Security
• A Practical and Tightly Secure Signature Scheme Without Hash Function
• Digital Signatures Out of Second-Preimage Resistant Hash Functions

Cited in

(6)

• Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
• Generalized First Pre-image Tractable Random Oracle Model and Signature Schemes
• Digital Signatures Out of Second-Preimage Resistant Hash Functions
• Security proofs for hash tree time-stamping using hash functions with small output size
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• A New Approach to Constructing Digital Signature Schemes

This page was built for publication: Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures

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