Results 11 to 20 of about 11,478 (298)
On the random oracle hypothesis [PDF]
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.
Kurtz, Stuart A.
openaire +2 more sources
The random oracle hypothesis is false [PDF]
Journal of Computer and System Sciences, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Chang 0001 +6 more
openaire +3 more sources
Circuit Depth Relative to a Random Oracle [PDF]
DAIMI Report Series, 1991 <p>The study of separation of complexity classes with respect to random oracles was initiated by Bennett and Gill and continued by many other authors.</p><p> </p><p>Wilson defined relativized circuit depth and constructed various oracles A for which</p><p> </p><p> </p><ul> <li> P^A
Miltersen, Peter Bro
openaire +6 more sources
Special Soundness in the Random Oracle Model [PDF]
IACR Communications in CryptologyWe generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis of the extraction error and running time.
Douglas Wikström
openaire +4 more sources
Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model [PDF]
, 2023 We present a quantumly secure identity-based signature scheme based on the standard short integer solution problem, featuring tight security reductions in the quantum and classic random oracle models. The scheme has short signatures.
Li, Qinyi, Foo, Ernest
core +1 more source
Weakened Random Oracle Models with Target Prefix [PDF]
, 2021 Weakened random oracle models (WROMs) are variants of the random oracle model (ROM). The WROMs have the random oracle and the additional oracle which breaks some property of a hash function.
Yoshida, Yusuke +2 more
core +2 more sources
Limits on the Usefulness of Random Oracles [PDF]
Journal of Cryptology, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iftach Haitner, Eran Omri, Hila Zarosim
openaire +2 more sources
Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks
IACR Transactions on Symmetric Cryptology, 2023 The sponge construction is a popular method for hashing. Quickly after its introduction, the sponge was proven to be tightly indifferentiable from a random oracle up to ≈ 2c/2 queries, where c is the capacity.
Charlotte Lefevre
doaj +1 more source
On Obfuscation with Random Oracles [PDF]
, 2015 Assuming trapdoor permutations, we show that there exist function families that cannot be VBB-obfuscated even if both the obfuscator and the obfuscated program have access to a random oracle. Specifically, these families are the robust unobfuscatable families of [Bitansky-Paneth, STOC 13].
Ran Canetti +2 more
openaire +2 more sources
An Improved Scheme for Blockchain Oracle Based on Schnorr Signature [PDF]
Jisuanji gongchengBlockchain oracle is a type of middleware that provides trustworthy guarantee for on-chain data, effectively addressing the trust problem of on- and off-chain data transmission.
Huaiyong CUI, Shaohua ZHANG, Chao LI, Bingrong DAI
doaj +1 more source