Results 21 to 30 of about 11,450 (279)
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
Correcting Subverted Random Oracles
CoRR, 2021 The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes. 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 cryptographic purposes. We prove that a simple construction can transform a
Alexander Russell +4 more
openaire +3 more sources
Sequential Hashing with Minimum Padding
Cryptography, 2018 This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property.
Shoichi Hirose
doaj +1 more source
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009 This work focuses on a vulnerability of hash functions due to sloppy usages or implementations in the real world. If our cryptographic research community succeeded in the development of a perfectly secure random function as the random oracle, it might be broken in some sense by invalid uses.
YONEYAMA, Kazuki +2 more
openaire +1 more source
Streebog as a Random Oracle [PDF]
, 2023 The random oracle model is an instrument used for proving that protocol has no structural flaws when settling with standard hash properties is impossible or fairly difficult. In practice, however, random oracles have to be instantiated with some specific
Alexandra Babueva +2 more
core
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 +1 more source
Combiners for Backdoored Random Oracles [PDF]
, 2018 We formulate and study the security of cryptographic hash functions in the backdoored random-oracle (BRO) model, whereby a big brother designs a "good" hash function, but can also see arbitrary functions of its table via backdoor capabilities. This model captures intentional (and unintentional) weaknesses due to the existence of collision-finding or ...
Balthazar Bauer +2 more
openaire +3 more sources
Non Observability in the Random Oracle Model [PDF]
, 2012 The Random Oracle Model, introduced by Bellare and Rogaway, provides a method to heuristically argue about the security of cryptographic primitives and protocols.
Prabhanjan Ananth, Raghav Bhaskar
core +1 more source
Weakened Random Oracle Models with Target Prefix
, 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 +1 more source
Limits of random oracles in secure computation [PDF]
Proceedings of the 5th conference on Innovations in theoretical computer science, 2014 The seminal result of Impagliazzo and Rudich (STOC 1989) gave a black-box separation between one-way functions and public-key encryption: informally, a public-key encryption scheme cannot be constructed using one-way functions as the sole source of computational hardness.
Mohammad Mahmoody +2 more
openaire +3 more sources