Results 1 to 10 of about 6,908 (279)
The random oracle methodology, revisited [PDF]
Journal of the ACM, 2004 We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".The main result of this article is a negative one: There exist signature and encryption schemes ...
Canetti, Ran +2 more
+9 more sources
A New Short Signature Scheme with Random Oracle from Bilinear Pairings
Journal of Telecommunications and Information Technology, 2023 In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function.
Sedat Akleylek +3 more
doaj +3 more sources
On the random oracle hypothesis
Information and Control, 1982 Summary: Two counterexamples to the random oracle hypothesis as formalized by \textit{C. Bennett} and \textit{J. Gill} [SIAM J. Comput. 10, 96-113 (1981; Zbl 0454.68030)] are given. Then the future of the random oracle hypothesis in light of these examples is discussed.
Stuart A. Kurtz
openaire +4 more sources
Improved Scheme for Data Aggregation of Distributed Oracle for Intelligent Internet of Things. [PDF]
Sensors (Basel)Oracle is a data supply mechanism that provides real-world data for blockchain. It serves as a bridge between blockchain and the IoT world, playing a crucial role in solving problems such as data sharing and device management in the IoT field.
Gao R, Xue Y, Wang W, Lu Y, Gui G, Xu S.
europepmc +2 more sources
Online-Extractability in the Quantum Random-Oracle Model
, 2022 We show the following generic result. Whenever a quantum query algorithm in the quantum random-oracle model outputs a classical value $t$ that is promised to be in some tight relation with $H(x)$ for some $x$, then $x$ can be efficiently extracted with almost certainty.
Don, J. +3 more
openaire +7 more sources
Non-adaptive programmability of random oracle
Theoretical Computer Science, 2015 Random Oracles serve as an important heuristic for proving security of many popular and important cryptographic primitives. But, at the same time they are criticized due to the impossibility of practical instantiation. Programmability is one of the most important features behind the power of Random Oracles. Unfortunately, in the standard hash functions,
Bhattacharyya, Rishiraj +1 more
openaire +3 more sources
Indifferentiable hash functions in the standard model
IET Information Security, 2021 Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
Quantum Search Approaches to Sampling-Based Motion Planning
IEEE Access, 2023 In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms.
Paul Lathrop +2 more
doaj +1 more source
Infinite Computations with Random Oracles [PDF]
Notre Dame Journal of Formal Logic, 2017 We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable?
Schlicht, Philipp, Carl, Merlin
openaire +4 more sources
Tightly Secure PKE Combiner in the Quantum Random Oracle Model
Cryptography, 2022 The development of increasingly sophisticated quantum computers poses a long-term threat to current cryptographic infrastructure. This has spurred research into both quantum-resistant algorithms and how to safely transition real-world implementations and
Brian Goncalves, Atefeh Mashatan
doaj +1 more source