Searching for "Indifferentiability" – sorted by Relevance.
-
Indifferentiability, impossibility results on reductions, and applications to the random oracle
- Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle
- Cited by 11 (0 self) – Add To MetaCart
-
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle
- The goals of this paper are three-fold. First we introduce and motivate a generalization of the fundamental concept of the indistinguishability of two systems, called indifferentiability. This immediately leads to a generalization of the related notion of reducibility of one system to another. Secon
- Cited by 6 (1 self) – Add To MetaCart
-
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation
- Add To MetaCart
-
is the full version. How to Build a Hash Function from any Collision-Resistant Function
- ) indifferentiability from a monolithic random oracle when the mixing stages themselves are indifferentiable from a
- Add To MetaCart
-
Building Application-Agile Hash Functions: the MCM Construction
- model and indifferentiable from a random oracle in the ideal cipher model. Keywords: Hash functions
- Add To MetaCart
-
A New Concept of Hash Functions SNMAC Using a Special Block Cipher and NMAC/HMAC Constructions, IACR ePrint archive Report 2006/376
- to preimage and collision attacks. Moreover, at CRYPTO 2005 Coron et al. proved that SNMAC is indifferentiable
- Cited by 1 (1 self) – Add To MetaCart
-
On the relation between the ideal cipher and the random oracle models
- notion of indistinguishability, called indifferentiability. Based on this notion of indifferentiability
- Cited by 4 (1 self) – Add To MetaCart
-
unknown title
- definition is based on the indifferentiability framework ofMaurer et al. [24]. The key property
- Add To MetaCart
-
Merkle–Damgård revisited: How to construct a hash function
- compression function f, or a an ideal block cipher E). Our definition is based on the indifferentiability
- Cited by 21 (3 self) – Add To MetaCart
-
Domain extension of public random functions: Beyond the birthday barrier
- with public access, called indifferentiability, was proposed. Like for indistinguishability, there is a
- Cited by 2 (0 self) – Add To MetaCart

