Sciweavers

335 search results - page 35 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Incorporating helpful behavior into collaborative planning
This paper considers the design of agent strategies for deciding whether to help other members of a group with whom an agent is engaged in a collaborative activity. Three characte...
Ece Kamar, Ya'akov Gal, Barbara J. Grosz
TYPES
2004
Springer
14 years 1 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
CSFW
2010
IEEE
13 years 11 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
CSFW
2010
IEEE
13 years 11 months ago
Modeling and Verifying Ad Hoc Routing Protocols
Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
PADL
2012
Springer
12 years 3 months ago
Recent Advances in Declarative Networking
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
Boon Thau Loo, Harjot Gill, Changbin Liu, Yun Mao,...