Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions

DOI10.1007/978-3-540-85174-5_22MaRDI QIDQ3600231zbMATH OpenOpenAlexFDO

Authors Martijn Stam

Publication date 10 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-85174-5_22

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Stam's collision resistance conjecture
• Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
• On high-rate cryptographic compression functions
• Hash functions based on three permutations: a generic security analysis

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Combining Compression Functions and Block Cipher-Based Hash Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier
• Fast Software Encryption
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 3548141 (Why is no real title available?)
• scientific article; zbMATH DE number 1942429 (Why is no real title available?)
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• Security Analysis of Constructions Combining FIL Random Oracles
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Some Attacks Against a Double Length Hash Proposal
• Some Plausible Constructions of Double-Block-Length Hash Functions
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model

Cited in

(23)

• Compactness of hashing modes and efficiency beyond Merkle tree
• The security of tandem-DM in the ideal cipher model
• Security of permutation-based compression function {\textsf{lp}}231
• Hash functions based on three permutations: a generic security analysis
• Stam's conjecture and threshold phenomena in collision resistance
• MJH: a faster alternative to MDC-2
• On high-rate cryptographic compression functions
• Parallel Hashing via List Recoverability
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Stam's collision resistance conjecture
• Attacking the Knudsen-Preneel Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Provable security of the Knudsen-Preneel compression functions
• MJH: a faster alternative to MDC-2
• Optimal collision security in double block length hashing with single length key
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Fast Software Encryption
• An analysis of the blockcipher-based hash functions from PGV
• Revisiting the indifferentiability of the sum of permutations
• Lower bound on number of compression calls of a collision-resistance preserving hash
• Two-permutation-based hashing with binary mixing
• Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
• Open problems in hash function security

This page was built for publication: Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions

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