989 search results - page 18 / 198 » Pebbling and Proofs of Work |
177
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
167
click to vote
MKM
2007
Springer
16 years 23 days ago
2007
Springer
We present a new framework for the online development of formalized mathematics. This framework allows wiki-style collaboration while providing users with a rendered and browsable ...
172
click to vote
AIPS
2006
15 years 8 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
174
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
173
click to vote
TCC
2010
Springer
16 years 1 months ago
2010
Springer
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...