scientific article; zbMATH DE number 1942429
From MaRDI portal
Publication:4409127
zbMath1026.94522MaRDI QIDQ4409127
John Black, Phillip Rogaway, Thomas Shrimpton
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420320.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (56)
How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ The Whirlpool Secure Hash Function ⋮ 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 ⋮ An analysis of the blockcipher-based hash functions from PGV ⋮ Security analysis of randomize-hash-then-sign digital signatures ⋮ Open problems in hash function security ⋮ Cryptanalysis of Grindahl ⋮ Improved domain extender for the ideal cipher ⋮ Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes ⋮ 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 ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ An algebraic attack on ciphers with low-degree round functions: application to full MiMC ⋮ Probably Secure Keyed-Function Based Authenticated Encryption Schemes for Big Data ⋮ Security of permutation-based compression function {\textsf{lp}}231 ⋮ A new black box analysis of hash functions based on block ciphers ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ MJH: a faster alternative to MDC-2 ⋮ 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 ⋮ Truncated differential based known-key attacks on round-reduced SIMON ⋮ Collision Resistant Double-Length Hashing ⋮ Interpreting Hash Function Security Proofs ⋮ 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 ⋮ On the collision and preimage security of MDC-4 in the ideal cipher model ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ 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 ⋮ MJH: A Faster Alternative to MDC-2 ⋮ A synthetic indifferentiability analysis of some block-cipher-based hash functions ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ A New Double-Block-Length Hash Function Using Feistel Structure ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model ⋮ Cryptanalysis of Tweaked Versions of SMASH and Reparation ⋮ A Scheme to Base a Hash Function on a Block Cipher ⋮ On the impossibility of highly-efficient blockcipher-based hash functions ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\) ⋮ 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 ⋮ Hash Functions and RFID Tags: Mind the Gap ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions ⋮ Hashing Garbled Circuits for Free
This page was built for publication:
