Results 1  10
of
25,605
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
Testing Permanent Oracles – Revisited
"... Abstract. Suppose we are given an oracle that claims to approximate the permanent for most matrices X, where X is chosen from the Gaussian ensemble (the matrix entries are i.i.d. univariate complex Gaussians). Can we test that the oracle satisfies this claim? This paper gives a polynomialtime alg ..."
Abstract
 Add to MetaCart
time algorithm for the task. The oracletesting problem is of interest because a recent paper of Aaronson and Arkhipov showed that if there is a polynomialtime algorithm for simulating bosonboson interactions in quantum mechanics, then an approximation oracle for the permanent (of the type described above
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
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 16 (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
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
Timelock puzzles in the random oracle model
 of Lecture Notes in Computer Science
, 2011
"... Abstract. A timelock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until enough time has elapsed for the puzzle to be solved. For timelock puzzles to be useful, generating a puzzle should take less ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
the possibility of constructing timelock puzzles in the randomoracle model. Our main result is negative, ruling out timelock puzzles that require more parallel time to solve than the total work required to generate a puzzle. In particular, this should rule out blackbox constructions of such timelock puzzles
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
Results 1  10
of
25,605