Results 1 - 10 of 1,959

Short Signatures without Random Oracles

by Dan Boneh, Xavier Boyen , 2004
"... We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#e-Hellman assumption. This assumption has similar properties to the Strong RS ..."
Abstract - Cited by 393 (11 self) - Add to MetaCart
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#e-Hellman assumption. This assumption has similar properties to the Strong

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols

by Mihir Bellare, Phillip Rogaway , 1995
"... We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract - Cited by 1646 (70 self) - Add to MetaCart
We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R

The Random Oracle Methodology, Revisited

by Ran Canetti, Oded Goldreich, Shai Halevi , 1998
"... ..."
Abstract - Cited by 292 (5 self) - Add to MetaCart
Abstract not found

Efficient identity-based encryption without random oracles

by Brent Waters , 2005
"... We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem. Additionally, we show that our techniques can be use ..."
Abstract - Cited by 346 (19 self) - Add to MetaCart
We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem. Additionally, we show that our techniques can

Random Oracles and Auxiliary Input ⋆

by Dominique Unruh
"... Abstract. We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain information about the random oracle. Using simple examples we show that this model should be preferred over the class ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
Abstract. We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain information about the random oracle. Using simple examples we show that this model should be preferred over

The random oracle hypothesis is false

by Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan, Pankaj Rohatgi , 1990
"... The Random Oracle Hypothesis, attributed to Bennett and Gill, essentially states that the relationships between complexity classes which holdforalmost all relativized worlds must also hold in the unrelativized case. Although this paper is not the rst to provideacounterexample to the Random Oracle Hy ..."
Abstract - Cited by 26 (2 self) - Add to MetaCart
The Random Oracle Hypothesis, attributed to Bennett and Gill, essentially states that the relationships between complexity classes which holdforalmost all relativized worlds must also hold in the unrelativized case. Although this paper is not the rst to provideacounterexample to the Random Oracle

Limits on the Usefulness of Random Oracles

by Iftach Haitner, Eran Omri, Hila Zarosim , 2013
"... In the random oracle model, parties are given oracle access to a random function (i.e., a uniformly chosen function from the set of all functions), and are assumed to have unbounded computational power (though they can only make a bounded number of oracle queries). This model provides powerful prope ..."
Abstract - Add to MetaCart
In the random oracle model, parties are given oracle access to a random function (i.e., a uniformly chosen function from the set of all functions), and are assumed to have unbounded computational power (though they can only make a bounded number of oracle queries). This model provides powerful

Crypto Miracles With Random Oracle

by R. A. Hady, A. V. Agranovsky , 2001
"... Cryptographic theory has provided the notion of provable security which is often 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. That happens because pro ..."
Abstract - Add to MetaCart
provable secure protocols often have complex and obscure design, which leads to inefficiency and mistakes. To bridge the gap between cryptographic theory and practice, the Random Oracle Hypothesis was developed. This hypothesis allows to yield crypto protocols much more efficient than standard ones

On Obfuscation with Random Oracles

by Ran Canetti, Yael Tauman, Kalai Omer Paneth , 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]. Our resul ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
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]. Our

Random Oracle Uninstantiability from

by Indistinguishability Obfuscation, Christina Brzuska, Pooya Farshim, Arno Mittelbach
"... Abstract. Assuming the existence of an indistinguishability obfuscator (iO), we show that a number of prominent constructions in the random-oracle model are uninstantiable in the standard model. We first show that the Encrypt-with-Hash (EwH) transform of Bellare, Boldyreva, and O’Neill (CRYPTO 2007) ..."
Abstract - Add to MetaCart
Abstract. Assuming the existence of an indistinguishability obfuscator (iO), we show that a number of prominent constructions in the random-oracle model are uninstantiable in the standard model. We first show that the Encrypt-with-Hash (EwH) transform of Bellare, Boldyreva, and O’Neill (CRYPTO 2007
Results 1 - 10 of 1,959