Results 211 to 220 of about 105,934 (253)

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

The Random Oracle Controversy

2021
Over the course of the previous chapters we have seen how random oracles allow for the creation of elegant and efficient schemes which can furthermore be proven secure in the random oracle model. In this chapter we have a closer look at what it means to have a security proof in the random oracle model rather than in the standard model.
Arno Mittelbach, Marc Fischlin
openaire   +1 more source

Constructing Random Oracles—UCEs

2021
Indifferentiability provides us with a framework to analyze and sanity-check hash function constructions that are based on a simpler primitive such as a compression function or a block cipher.
Arno Mittelbach, Marc Fischlin
openaire   +1 more source

Random Oracle Schemes in Practice

2021
In the following we give an overview about cryptographic schemes in practice and standards which rely on the random oracle methodology. In all cases the power of random oracles facilitates the design of very efficient solutions, usually combined with suitable number-theoretic primitives such as the discrete-logarithm-based one-way function or the RSA ...
Arno Mittelbach, Marc Fischlin
openaire   +1 more source

Classical vs Quantum Random Oracles

2021
In this paper, we study relationship between security of cryptographic schemes in the random oracle model (ROM) and quantum random oracle model (QROM). First, we introduce a notion of a proof of quantum access to a random oracle (PoQRO), which is a protocol to prove the capability to quantumly access a random oracle to a classical verifier.
Takashi Yamakawa, Mark Zhandry
openaire   +1 more source

Correcting Subverted Random Oracles

2018
The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes, and can often act as an effective bridge between theory and practice. In this paper, we focus on the basic problem of correcting faulty—or adversarially corrupted—random oracles, so that they can be confidently applied for such ...
Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou   +3 more
openaire   +1 more source

On random oracle separations

Information Processing Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Deterministic Random Oracles

2012
The Random Oracle model popularized by Bellare and Rogaway in 1993 has proven to be hugely successful, allowing cryptographers to give security proofs for very efficient and practical schemes. In this paper, we discuss the possibility of using an incompressible but fixed, "algorithmically random" oracle instead of the standard random oracle and show ...
openaire   +1 more source

Average dependence and random oracles

[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 2003
A reconstruction of the foundations of complexity theory relative to random oracles is begun. The goals are to identify the simple, core mathematical principles behind randomness; to use these principles to push hard on the current boundaries of randomness; and to eventually apply these principles in unrelativized complexity.
S.A. Kurtz, S.R. Mahaney, J.S. Royer
openaire   +1 more source

Crypto miracles with random oracle

IEEE-Siberian Workshop of Students and Young Researches. Modern Communication Technologies SIBCOM-2001. Proceedings (Cat. No.01EX452), 2002
Cryptographic theory has provided the notion of provable security which is often an unattainable ideal in practice. Theoretical work gains provable secure protocols only at the cost of efficiency. Theorists are moving from certain primitives towards powerful sets of primitives.
R.A. Hady, A.V. Agranovsky
openaire   +1 more source