28 search results - page 1 / 6 » The Global Power of Additional Queries to Random Oracles |
83
Voted
STACS
1994
Springer
15 years 7 months ago
1994
Springer
98
Voted
MFCS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
152
Voted
ASIACRYPT
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
119
Voted
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
134
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...