Results 61 to 70 of about 437 (95)

From Indifferentiability to Constructive Cryptography (and Back) [PDF]

open access: yes, 2016
The concept of indifferentiability of systems, a generalized form of indistinguishability, was proposed in 2004 to provide a simplified and generalized explanation of impossibility results like the non-instantiability of random oracles by hash functions ...
Ueli Maurer, Renato Renner
core   +1 more source

Offline-Online Indifferentiability of Cryptographic Systems [PDF]

open access: yes
The indifferentiability framework has become a standard methodology that enables us to study the security of cryptographic constructions in idealized models of computation. Unfortunately, while indifferentiability provides strong guarantees whenever the
Ashrujit Ghoshal   +2 more
core  

Improved Indifferentiability Security Bound for the JH Mode [PDF]

open access: yes, 2015
Indifferentiability security of a hash mode of operation guarantees the mode\u27s resistance against all (meaningful) generic attacks. It is also useful to establish the security of protocols that use hash functions as random functions.
Moody, Dustin   +5 more
core   +1 more source

Provable Security and Indifferentiability [PDF]

open access: yes, 2012
In this thesis we consider different problems related to provable security and indifferentiability framework. Ideal primitives such as random oracles, ideal ciphers are theoretical abstractions of cryptographic hash functions and block ciphers ...
MANDAL, Avradip, Avradip Mandal
core   +1 more source

Revisiting the Indifferentiability of the Sum of Permutations [PDF]

open access: yes, 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 ...
Ashwin Jha   +4 more
core  

Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions

open access: yes, 2009
Understanding the principle behind designing a good hash function is important. Nowadays it is getting more importance due to the current SHA3 competition which intends to make a new standard for cryptogrpahic hash functions.
Rishiraj Bhattacharyya   +5 more
core   +1 more source

Indifferentiability of 3-Round Even-Mansour with Random Oracle Key Derivation [PDF]

open access: yes, 2017
We revisit the Even-Mansour (EM) scheme with random oracle key derivation previously considered by Andreeva et al. (CRYPTO 2013). For this scheme, Andreeva et al.
Chun Guo, Dongdai Lin
core   +1 more source

Home - About - Disclaimer - Privacy