1401 search results - page 4 / 281 » Randomness in Interactive Proofs |
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
81
Voted
SECRYPT
2007
14 years 11 months ago
2007
In this paper, we study the opacity property of verifiably encrypted signatures (VES) of Boneh et al. (proposed in Eurocrypt 2003). Informally, opacity implies that although some...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the...
TACAS
2000
Springer
15 years 1 months ago
2000
Springer
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...