989 search results - page 49 / 198 » Pebbling and Proofs of Work |
183
click to vote
AMAI
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
165
click to vote
TCC
2004
Springer
15 years 11 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
147
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
143
click to vote
FSE
2006
Springer
15 years 10 months ago
2006
Springer
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model dating back to Shannon [24] and has seen frequent use in proving the security of various cryptographi...
153
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...