Results 1 to 10 of about 1,402 (165)

Revisiting the Indifferentiability of the Sum of Permutations [PDF]

Lecture Notes in Computer Science, 2023
The sum of two n-bit pseudorandom permutations is known to behave like a pseudorandom function with n bits of security. A recent line of research has investigated the security of two public n-bit permutations and its degree of indifferentiability. Mandal et al. (INDOCRYPT 2010) proved 2n/3-bit security, Mennink and Preneel (ACNS 2015) pointed out a non-
Ashwin Jha, Bart Mennink
exaly   +3 more sources

New indifferentiability security proof of MDPH hash function

IET Information Security, 2022
MDPH is a double‐block‐length hash function proposed by Naito at Latincrypt 2019. This is a combination of Hirose's compression function and the domain extender called Merkle–Damgård with permutation.
Chun Guo, Tetsu Iwata, Kazuhiko Minematsu   +2 more
doaj   +3 more sources

Crooked Indifferentiability of the Feistel Construction

IACR Cryptology ePrint Archive
The Feistel construction is a fundamental technique for building pseudorandom permutations and block ciphers. This paper shows that a simple adaptation of the construction is resistant, even to algorithm substitution attacks -- that is, adversarial subversion -- of the component round functions.
Russell, Alexander, Tang, Qiang, Zhu, Jiadong   +2 more
semanticscholar   +4 more sources

Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks

IACR Transactions on Symmetric Cryptology, 2023
The sponge construction is a popular method for hashing. Quickly after its introduction, the sponge was proven to be tightly indifferentiable from a random oracle up to ≈ 2c/2 queries, where c is the capacity.
Charlotte Lefevre
doaj   +2 more sources

Symbolic Synthesis of Indifferentiability Attacks

Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, 2022
We propose automated methods for synthesising attacks against indifferentiability, a powerful simulation-based notion of security commonly used to reason about symmetric-key constructions. Our methods are inspired from symbolic cryptography which is popular to reason about, e.g., cryptographic protocols.
Itsaka Rakotonirina, Miguel Ambrona, Alejandro Aguirre, Gilles Barthe   +3 more
semanticscholar   +4 more sources

Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier

Journal of Mathematical Cryptology, 2016
A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them as random functions.
Moody Dustin, Paul Souradyuti, Smith-Tone Daniel   +2 more
doaj   +2 more sources

Indifferentiability of the Sponge Hash Family: New Attacks and the Optimal Construction

IACR Transactions on Symmetric Cryptology
The sponge construction is subject to an indifferentiability security bound of c/2 bits, where c denotes the capacity. For a given b-bit permutation, the sponge construction allows sacrificing the rate r = b − c to achieve the theoretically optimal ...
Hongli Li, Changlun Li, Honggang Hu, Fengmei Liu   +3 more
doaj   +2 more sources

Indifferentiability of Confusion-Diffusion Networks [PDF]

International Conference on the Theory and Application of Cryptographic Techniques, 2016
We show the first positive results for the indifferentiability security of the confusion-diffusion networks which are extensively used in the design of block ciphers and hash functions. In particular, our result shows that a constant number of confusion-diffusion rounds is sufficient to extend the domain of a public random permutation.
Dodis, Yevgeniy, Stam, Martijn, Steinberger, John, Liu, Tianren   +3 more
openaire   +3 more sources

(Quantum) Indifferentiability and Pre-Computation

IACR Cryptology ePrint Archive
Indifferentiability is a popular cryptographic paradigm for analyzing the security of ideal objects -- both in a classical as well as in a quantum world. It is typically stated in the form of a composable and simulation-based definition, and captures what it means for a construction (e.g., a cryptographic hash function) to be ``as good as'' an ideal ...
Carolan, Joseph, Poremba, Alexander, Zhandry, Mark   +2 more
openaire   +3 more sources

Sequential Indifferentiability of STH and EDM

IACR Communications in Cryptology
The notion of indifferentiability was proposed by Maurer et al. to bound the distinguishing advantage of a construction built on a public primitive, from a public random function. In Indocrypt'10, Mandal et al. have shown that the sum of two independent permutations is indifferentiable from a public random function up to
Nilanjan Datta, Avijit Dutta, Sougata Mandal, Hrithik Nandi   +3 more
openaire   +2 more sources