3 search results - page 1 / 1 » Random Oracles with(out) Programmability |
ASIACRYPT
2010
Springer
13 years 2 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...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
ASIACRYPT
2011
Springer
12 years 4 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...