Results 101 to 110 of about 1,010 (133)

Constructing Random Oracles—Indifferentiability

2021
The holy grail of hash function design is to construct a hash function which behaves like a random oracle. This is, of course, impossible (see Chapter 12). Nevertheless, while we know that we cannot construct an actual random oracle the goal should still be to come as close as possible.
Arno Mittelbach, Marc Fischlin
openaire   +1 more source

Gli intolleranti e gli indifferenti

Religioni e società : XXX, 83, 2015, 2015
Sociologists have been deceived. Max Weber, one of the fathers of this discipline have assured that the process o secularization have gradually reduced the public impact of religions, limiting them to the private sphere. On the contrary in the third millennium, the religions still they have a collective importance in the public dimensions par ...
openaire   +2 more sources

Some Observations on Indifferentiability

2010
At Crypto 2005, Coron et al. introduced a formalism to study the presence or absence of structural flaws in iterated hash functions. If one cannot differentiate a hash function using ideal primitives from a random oracle, it is considered structurally sound, while the ability to differentiate it from a random oracle indicates a structural weakness ...
Ewan Fleischmann   +2 more
openaire   +1 more source

Indifferentiability for Public Key Cryptosystems

2020
We initiate the study of indifferentiability for public key encryption and other public key primitives. Our main results are definitions and constructions of public key cryptosystems that are indifferentiable from ideal cryptosystems, in the random oracle model.
Mark Zhandry, Cong Zhang
openaire   +1 more source

Indifferentiability of Truncated Random Permutations

2019
One of natural ways of constructing a pseudorandom function from a pseudorandom permutation is to simply truncate the output of the permutation. When n is the permutation size and m is the number of truncated bits, the resulting construction is known to be indistinguishable from a random function up to \(2^{{n+m}\over 2}\) queries, which is tight.
Wonseok Choi   +2 more
openaire   +1 more source

Alberto Moravia, "Gli indifferenti"

2007
L'edizione de "Gli indifferenti", pubblicata da Bompiani in occasione del centenario della nascita di Moravia come "nuova edizione ampliata", è introdotta da un saggio di S. Casini dal titolo "Il romanzo di una vita" (pp. 5-31). Tale introduzione ricostruisce in modo nuovo il rapporto tra lo scrittore e la sua opera prima, nella quale Moravia stesso ...
Casini, Simone, L. Desideri, T. Servillo
openaire   +1 more source

Improved Indifferentiable Security Analysis of PHOTON

2014
In this paper, we study the indifferentiable security of the domain extension algorithm of the PHOTON hash function that was proven to be indifferentiable from a random oracle up to \(\mathcal{O}(2^{\min\{ c/2, c^\prime/2 \}})\) query complexity, where c is the capacity in the absorbing step of PHOTON and c ′ is that in the squeezing step.
Yusuke Naito, Kazuo Ohta
openaire   +1 more source

Home - About - Disclaimer - Privacy