Open problems in hash function security
type: Item
instance of: scholarly article
title: Open problems in hash function security
zbMATH Open document ID: 1356.94047
author: Bart Mennink
author: Bart Preneel
author: E. A. Andreeva
published in: Designs, Codes and Cryptography
publication date: 2015-10-26T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/501602
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6498067
zbMATH Keywords: cryptographic hash function
zbMATH Keywords: compression functions
zbMATH Keywords: reductions
zbMATH Keywords: permutation based
zbMATH Keywords: block cipher based
zbMATH Keywords: open problems
Wikidata QID: Q114852391
describes a project that uses: Whirlpool
describes a project that uses: Skein Hash
describes a project that uses: HAVAL
describes a project that uses: Keccak
MaRDI profile type: Publication
OpenAlex ID: W1203305141
cites work: Counter-bDM: A Provably Secure Family of Multi-Block-Length Compression Functions
cites work: Security Reductions of the Second Round SHA-3 Candidates
cites work: Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
cites work: Seven-Property-Preserving Iterated Hashing: ROX
cites work: A Three-Property-Secure Hash Function
cites work: The Symbiosis between Collision and Preimage Resistance
cites work: The Preimage Security of Double-Block-Length Compression Functions
cites work: Reset Indifferentiability and Its Consequences
cites work: Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
cites work: Q4542560
cites work: Q4364571
cites work: Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
cites work: On the Indifferentiability of the Sponge Construction
cites work: Sakura: A Flexible Coding for Tree Hashing
cites work: Security Analysis of the Mode of JH Hash Function
cites work: Distinguisher and Related-Key Attack on the Full AES-256
cites work: On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
cites work: Q4409127
cites work: An analysis of the blockcipher-based hash functions from PGV
cites work: Efficient Hashing Using the AES Instruction Set
cites work: Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
cites work: Minimizing the Two-Round Even-Mansour Cipher
cites work: Merkle-Damgård Revisited: How to Construct a Hash Function
cites work: Q2760977
cites work: Q3212279
cites work: Resource-Restricted Indifferentiability
cites work: New directions in cryptography
cites work: RIPEMD-160: A strengthened version of RIPEMD
cites work: A New Mode of Operation for Block Ciphers and Length-Preserving MACs
cites work: Salvaging Merkle-Damgård for Practical Applications
cites work: Security of Cyclic Double Block Length Hash Functions
cites work: Building indifferentiable compression functions from the PGV compression functions
cites work: Security analysis of randomize-hash-then-sign digital signatures
cites work: A synthetic indifferentiability analysis of some block-cipher-based hash functions
cites work: Strengthening Digital Signatures Via Randomized Hashing
cites work: Q4413872
cites work: Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
cites work: Some Plausible Constructions of Double-Block-Length Hash Functions
cites work: Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
cites work: Herding Hash Functions and the Nostradamus Attack
cites work: Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
cites work: Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
cites work: Q4364572
cites work: Construction of secure and fast hash functions using nonbinary error-correcting codes
cites work: The Grindahl Hash Functions
cites work: Cryptanalysis of MDC-2
cites work: Q4279661
cites work: Provable Security of the Knudsen-Preneel Compression Functions
cites work: Collision Resistance of the JH Hash Function
cites work: MJH: A Faster Alternative to MDC-2
cites work: The Collision Security of Tandem-DM in the Ideal Cipher Model
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
cites work: Theory of Cryptography
cites work: Q4718481

Open problems in hash function security (cites work)
cites work: Optimal Collision Security in Double Block Length Hashing with Single Length Key

Open problems in hash function security (cites work)
cites work: Indifferentiability of Double Length Compression Functions

Open problems in hash function security (cites work)
cites work: On the collision and preimage security of MDC-4 in the ideal cipher model

Open problems in hash function security (cites work)
cites work: Hash Functions Based on Three Permutations: A Generic Security Analysis

Open problems in hash function security (cites work)
cites work: On the XOR of Multiple Random Permutations

Open problems in hash function security (cites work)
cites work: One Way Hash Functions and DES

Open problems in hash function security (cites work)
cites work: Q3342347

Open problems in hash function security (cites work)
cites work: Q4036887

Open problems in hash function security (cites work)
cites work: Improved indifferentiability security bound for the JH mode

Open problems in hash function security (cites work)
cites work: Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles

Open problems in hash function security (cites work)
cites work: Reset Indifferentiability from Weakened Random Oracle Salvages One-Pass Hash Functions

Open problems in hash function security (cites work)
cites work: Another Glance at Double-Length Hashing

Open problems in hash function security (cites work)
cites work: Collision Attacks against the Knudsen-Preneel Compression Functions

Open problems in hash function security (cites work)
cites work: Attacking the Knudsen-Preneel Compression Functions

Open problems in hash function security (cites work)
cites work: On the security of iterated message authentication codes

Open problems in hash function security (cites work)
cites work: Q4341676

Open problems in hash function security (cites work)
cites work: Q4341762

Open problems in hash function security (cites work)
cites work: Enhanced Security Notions for Dedicated-Key Hash Functions: Definitions and Relationships

Open problems in hash function security (cites work)
cites work: Careful with Composition: Limitations of the Indifferentiability Framework

Open problems in hash function security (cites work)
cites work: Q4279583

Open problems in hash function security (cites work)
cites work: Fast Software Encryption

Open problems in hash function security (cites work)
cites work: Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

Open problems in hash function security (cites work)
cites work: Security/Efficiency Tradeoffs for Permutation-Based Hashing

Open problems in hash function security (cites work)
cites work: Construction of universal one-way hash functions: tree hashing revisited

Open problems in hash function security (cites work)
cites work: Building a Collision-Resistant Compression Function from Non-compressing Primitives

Open problems in hash function security (cites work)
cites work: Q4249649

Open problems in hash function security (cites work)
cites work: Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions

Open problems in hash function security (cites work)
cites work: Blockcipher-Based Hashing Revisited

Open problems in hash function security (cites work)
cites work: The Collision Intractability of MDC-2 in the Ideal-Cipher Model

Open problems in hash function security (cites work)
cites work: Stam’s Collision Resistance Conjecture

Open problems in hash function security (cites work)
cites work: Stam’s Conjecture and Threshold Phenomena in Collision Resistance

Open problems in hash function security (cites work)
cites work: How to Break MD5 and Other Hash Functions

Open problems in hash function security (cites work)
cites work: Finding Collisions in the Full SHA-1

Open problems in hash function security (cites work)
cites work: How to Fill Up Merkle-Damgård Hash Functions

Open problems in hash function security (cites work)
cites work: Q4341675

Open problems in hash function security (DOI)
DOI: 10.1007/S10623-015-0096-0