Results 241 to 250 of about 6,908 (279)
Some of the next articles are maybe not open access.
Information Processing Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Constructing Random Oracles—Indifferentiability
2021The 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.
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
Random Oracle Schemes in Practice
2021In 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 ...
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
Journal of the London Mathematical Society, 2007
AbstractLet R be a notion of algorithmic randomness for individual subsets of ℕ. A set B is a base for R randomness if there is a Z ≥ T B such that Z is R random relative to B. We show that the bases for 1-randomness are exactly the K-trivial sets, and discuss several consequences of this result.
Hirschfeldt, D.R., Nies, A., Stephan, F.
openaire +2 more sources
AbstractLet R be a notion of algorithmic randomness for individual subsets of ℕ. A set B is a base for R randomness if there is a Z ≥ T B such that Z is R random relative to B. We show that the bases for 1-randomness are exactly the K-trivial sets, and discuss several consequences of this result.
Hirschfeldt, D.R., Nies, A., Stephan, F.
openaire +2 more sources
Average dependence and random oracles
[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 2003A 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.
James S. Royer +2 more
openaire +2 more sources
The Full Power of Random Oracles
2021We have already seen a first glimpse of how random oracles simplify cryptographic proofs when we showed how to use random oracles to construct commitment schemes. Over the course of this book we will see many additional examples of how we can prove the security of cryptographic schemes with the help of random oracles, and this chapter, in particular ...
Arno Mittelbach, Marc Fischlin
openaire +2 more sources
A Note on the Random Oracle Methodology
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008Canetti et al. [5] showed that there exist signature and encryption schemes that are secure in the random oracle (RO) model, but for which any implementation of the RO (by a single function or a function ensemble) results in insecure schemes.
Mototsugu Nishioka, Naohisa Komatsu
openaire +1 more source
Constructing Random Oracles—UCEs
2021Indifferentiability 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 +2 more sources
Signcryption with Quantum Random Oracles
2018Signcryption is a cryptographic scheme that achieves the functionalities of both public-key encryption and digital signatures. It is an important scheme for realizing a mechanism of sending and/or receiving messages in a secure way, since it is understood that signcryption is a public-key based protocol to realize a secure channel from an insecure ...
Junji Shikata, Shingo Sato
openaire +2 more sources
Crypto miracles with random oracle
IEEE-Siberian Workshop of Students and Young Researches. Modern Communication Technologies SIBCOM-2001. Proceedings (Cat. No.01EX452), 2002Cryptographic 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.
A.V. Agranovsky, R.A. Hady
openaire +2 more sources