Security analysis of randomize-hash-then-sign digital signatures
type: Item
instance of: scholarly article
title: Security analysis of randomize-hash-then-sign digital signatures
zbMATH Open document ID: 1277.94053
author: Praveen Gauravaram
author: Lars R. Knudsen
published in: Journal of Cryptology
publication date: 2013-01-04T00:00:00Z
full work available at URL: 10.1007/s00145-011-9109-y
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6121917
zbMATH Keywords: collision resistance
zbMATH Keywords: compression function
zbMATH Keywords: Davies-Meyer
zbMATH Keywords: digital signature
zbMATH Keywords: hash function
zbMATH Keywords: Merkle-Damgård
zbMATH Keywords: randomized hashing
zbMATH Keywords: RMX
zbMATH Keywords: second preimage resistance
zbMATH Keywords: SHA-3 hash function competition
Wikidata QID: Q56933169
describes a project that uses: BLAKE
describes a project that uses: Tiger
MaRDI profile type: Publication
OpenAlex ID: W1989602334
cites work: On the Security of Compressed Encodings
cites work: Tiger: A fast new hash function
cites work: Second Preimage Attacks on Dithered Hash Functions
cites work: The Hash Function Family LAKE
cites work: New Proofs for NMAC and HMAC: Security Without Collision-Resistance
cites work: Keying Hash Functions for Message Authentication
cites work: Q4364571
cites work: Collisions of SHA-0 and Reduced SHA-1
cites work: Cryptanalysis of the LAKE Hash Family
cites work: MAC Reforgeability
cites work: Q4409127
cites work: Q4249321
cites work: Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions
cites work: Q3212279
cites work: Q4934729
cites work: Cryptanalysis of MD4
cites work: Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
cites work: Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
cites work: Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Strengthening Digital Signatures Via Randomized Hashing
cites work: Q4341765
cites work: Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
cites work: On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract)
cites work: Information Security and Privacy
cites work: MD4 is Not One-Way
cites work: A Failure-Friendly Design Principle for Hash Functions
cites work: Collisions on SHA-0 in One Hour
cites work: Q4718481
cites work: Q3342347
cites work: Public Key Cryptography - PKC 2006
cites work: Q4036887
cites work: Hash-and-Sign with Weak Hashing Made Secure
cites work: Q4341762
cites work: On Authentication with HMAC and Non-random Properties
cites work: Q4279583
cites work: Fast Software Encryption
cites work: Cryptanalyses of Narrow-Pipe Mode of Operation in AURORA-512 Hash Function
cites work: Finding Preimages in Full MD5 Faster Than Exhaustive Search
cites work: Q3374928
cites work: Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
cites work: Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
cites work: Cryptanalysis of the Hash Functions MD4 and RIPEMD
cites work: Efficient Collision Search Attacks on SHA-0
cites work: Finding Collisions in the Full SHA-1
cites work: How to Break MD5 and Other Hash Functions
cites work: Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC
cites work: How to Fill Up Merkle-Damgård Hash Functions
DOI: 10.1007/S00145-011-9109-Y
DBLP publication ID: journals/joc/GauravaramK12
description: scientific article; zbMATH DE number 6121917