4099 search results - page 349 / 820 » A Framework for Interactive Proof |
187
click to vote
FOCS
2003
IEEE
16 years 10 hour ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
216
click to vote
CCS
2003
ACM
15 years 12 months ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
191
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
149
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
185
click to vote
AI
2007
Springer
15 years 6 months ago
2007
Springer
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...