Sciweavers

811 search results - page 3 / 163
» Separations by Random Oracles and
Sort
View
SOQUA
2004
13 years 7 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
CORR
2000
Springer
93views Education» more  CORR 2000»
13 years 5 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
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
13 years 12 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 5 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 5 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková