Sciweavers

876 search results - page 1 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
13 years 6 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan
CORR
2000
Springer
93views Education» more  CORR 2000»
13 years 4 months ago
The Random Oracle Methodology, Revisited
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...
Ran Canetti, Oded Goldreich, Shai Halevi
ASIACRYPT
2010
Springer
13 years 2 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
SOQUA
2004
13 years 5 months ago
Test Oracles Using Statistical Methods
Abstract: The oracle problem is addressed for random testing and testing of randomized software. The presented Statistical Oracle is a Heuristic Oracle using statistical methods, e...
Johannes Mayer, Ralph Guderlei
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
13 years 10 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup