4099 search results - page 10 / 820 » A Framework for Interactive Proof |
GI
2001
Springer
15 years 2 months ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
109
click to vote
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
PROVSEC
2007
Springer
15 years 3 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
CASSIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
JAR
2008
14 years 9 months ago
2008
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...