989 search results - page 11 / 198 » Pebbling and Proofs of Work |
AMAI
2006
Springer
13 years 9 months ago
2006
Springer
This paper proposes a formalization in COQ of common knowledge logic and checks its adequacy on case studies. This exercise allows exploring experimentally the proof-theoretic sid...
ENTCS
2007
13 years 9 months ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
ACISP
2004
Springer
14 years 2 months ago
2004
Springer
The Canetti-Krawczyk (CK) model is useful for building reusable components that lead to rapid development of secure protocols, especially for engineers working outside of the secur...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...