12774 search results - page 276 / 2555 » A Framework for Proof Systems |
176
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
204
click to vote
AAAI
2008
15 years 9 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
178
click to vote
CLIMA
2004
15 years 8 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
142
click to vote
JSYML
2008
15 years 6 months ago
2008
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
169
click to vote
IACR
2011
14 years 6 months ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...