Black-box analysis of the block-cipher-based hash-function constructions from PGV
From MaRDI portal
Recommendations
Cited in
(70)- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- On the impossibility of highly-efficient blockcipher-based hash functions
- Security analysis of randomize-hash-then-sign digital signatures
- Compactness of hashing modes and efficiency beyond Merkle tree
- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
- A note on quantum collision resistance of double-block-length compression functions
- Efficient schemes for committing authenticated encryption
- Characterizing collision and second-preimage resistance in Linicrypt
- Security of permutation-based compression function {\textsf{lp}}231
- On the collision and preimage security of MDC-4 in the ideal cipher model
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Hash functions from defective ideal ciphers
- Linicrypt: a model for practical cryptography
- Black-Box Property of Cryptographic Hash Functions
- Simpira v2: a family of efficient permutations using the AES round function
- Analysis of message injection in stream cipher-based hash functions
- On the Security of Hash Functions Employing Blockcipher Postprocessing
- Known-key distinguishers on 11-round Feistel and collision attacks on its hashing modes
- MJH: a faster alternative to MDC-2
- Security of practical cryptosystems using Merkle-Damgård hash function in the ideal cipher model
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- The symbiosis between collision and preimage resistance
- A domain extender for the ideal cipher
- The whirlpool secure hash function
- Cryptanalysis of Grindahl
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
- Analysis of Fast Blockcipher-Based Hash Functions
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512
- Salvaging Merkle-Damgård for Practical Applications
- A New Double-Block-Length Hash Function Using Feistel Structure
- Cryptanalysis of Tweaked Versions of SMASH and Reparation
- A Scheme to Base a Hash Function on a Block Cipher
- Hash functions based on block ciphers: A synthetic approach
- Black box cryptanalysis of hash networks based on multipermutations
- Probably secure keyed-function based authenticated encryption schemes for big data
- Ideal-cipher (ir)reducibility for blockcipher-based hash functions
- Collision resistant double-length hashing
- Interpreting hash function security proofs
- MJH: a faster alternative to MDC-2
- Truncated differential based known-key attacks on round-reduced SIMON
- Hashing garbled circuits for free
- Information Security and Privacy
- How to Build a Hash Function from Any Collision-Resistant Function
- An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Hash Functions and RFID Tags: Mind the Gap
- Progress in Cryptology - INDOCRYPT 2004
- Building indifferentiable compression functions from the PGV compression functions
- An analysis of the blockcipher-based hash functions from PGV
- Context discovery and commitment attacks. How to break CCM, EAX, SIV, and more
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- A new black box analysis of hash functions based on block ciphers
- Quantum lifting for invertible permutations and ideal ciphers
- On the black-box complexity of private-key inner-product functional encryption
- SAT reduces to the minimum circuit size problem with a random oracle
- Lower bound on number of compression calls of a collision-resistance preserving hash
- The uber-knowledge assumption: a bridge to the AGM
- Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
- Open problems in hash function security
- Improved domain extender for the ideal cipher
- Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes
- Collision attack on \({\mathtt Grindahl}\)
This page was built for publication: Black-box analysis of the block-cipher-based hash-function constructions from PGV
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409127)
