Sciweavers

3 search results - page 1 / 1
» Verifying Cryptographic Protocols with Subterms Constraints
Sort
View
LPAR
2007
Springer
14 years 5 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
CSFW
2010
IEEE
14 years 2 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...
SENSYS
2003
ACM
14 years 4 months ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...