Results 1  10
of
97
Random Oracles in a Quantum World
"... Abstract. Once quantum computers reach maturity most of today’s traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantumbased attacks. Hence, schemes which are more likely to resist quantum attacks like latticebased systems or codebased primitives have re ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
recently gained significant attention. Interestingly, a vast number of such schemes also deploy random oracles, which have mainly be analyzed in the classical setting. Here we revisit the random oracle model in cryptography in light of quantum attackers. We show that there are protocols using quantum
Random Oracles in a Quantum World
"... Abstract. The interest in postquantum cryptography — classical systems that remain secure in the presence of a quantum adversary — has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Abstract. The interest in postquantum cryptography — classical systems that remain secure in the presence of a quantum adversary — has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have
The Random Oracle Methodology, Revisited\Lambda
, 2002
"... Abstract 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 paper ..."
Abstract
 Add to MetaCart
Abstract 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 paper
The Random Oracle Methodology, Revisited \Lambda
, 2001
"... Abstract 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 paper ..."
Abstract
 Add to MetaCart
Abstract 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 paper
Zero knowledge in the random oracle model, revisited
 In: Advances in Cryptology — Asiacrypt 2009. LNCS
, 2009
"... Abstract. We revisit previous formulations of zero knowledge in the random oracle model due to Bellare and Rogaway (CCS ’93) and Pass (Crypto ’03), and present a hierarchy for zero knowledge that includes both of these formulations. The hierarchy relates to the programmability of the random oracle, ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. We revisit previous formulations of zero knowledge in the random oracle model due to Bellare and Rogaway (CCS ’93) and Pass (Crypto ’03), and present a hierarchy for zero knowledge that includes both of these formulations. The hierarchy relates to the programmability of the random oracle
On Deniability in the Common Reference String and Random Oracle Model
 In proceedings of CRYPTO ’03, LNCS series
, 2003
"... Abstract. We revisit the definitions of zeroknowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntactically mimic the standard zeroknowledge definition, they loose some of its spirit. In particular, we show that there ..."
Abstract

Cited by 59 (7 self)
 Add to MetaCart
Abstract. We revisit the definitions of zeroknowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntactically mimic the standard zeroknowledge definition, they loose some of its spirit. In particular, we show
The equivalence of the random oracle model and the ideal cipher model, revisited
 In Lance Fortnow and Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011
, 2011
"... We consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004). This is the natural extension to the public s ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
setting of the wellstudied problem of building random permutations from random functions, which was first solved by Luby and Rackoff (Siam J. Comput., ’88) using the socalled Feistel construction. The most important implication of such a construction is the equivalence of the random oracle model
Uselessness for an Oracle Model with Internal Randomness
, 2013
"... We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we sho ..."
Abstract
 Add to MetaCart
We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we
Secure identitybased encryption in the quantum random oracle model
 In Proceedings of CRYPTO
, 2012
"... We give the first proof of security for an identitybased encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and we use them to obtain security proofs for two ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We give the first proof of security for an identitybased encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and we use them to obtain security proofs
Making ExistentialUnforgeable Signatures Strongly Unforgeable in the Quantum RandomOracle Model
"... Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature on a message for which the adversary has seen v ..."
Abstract
 Add to MetaCart
by Teranishi et al. [30] and was proven in the classical randomoracle model. Our main contribution is showing that the transformation also works against quantum adversaries in the quantum randomoracle model. We develop proof techniques such as adaptively programming a quantum randomoracle in a new setting
Results 1  10
of
97