1894 search results - page 87 / 379 » A TLA Proof System |
128
click to vote
LOPSTR
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
136
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
113
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...
117
click to vote
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...
92
Voted
SCN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely...