1180 search results - page 7 / 236 » Interaction Protocols in Agentis |
156
Voted
JACM
2002
15 years 3 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
106
Voted
AAMAS
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes a protocol language which can provide agents with a flexible mechanism for coherent dialogues. The protocol language does not rely on centralised control or ...
131
click to vote
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
172
click to vote
IACR
2011
14 years 3 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
123
click to vote
APCCM
2006
15 years 5 months ago
2006
This paper provides an overview of ServiceMosaic, which is a platform for model-driven analysis and management of service interactions. In particular, in this paper, we focus on b...