811 search results - page 2 / 163 » Separations by Random Oracles and |
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
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...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
JUCS
2010
13 years 1 days ago
2010
: We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x 0. The oracle machines can also check whether...