Sciweavers

127 search results - page 2 / 26
» Proving Properties of Security Protocols by Induction
Sort
View
CSFW
2009
IEEE
14 years 24 days ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
CSFW
2009
IEEE
14 years 24 days ago
Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
Patrick Schaller, Benedikt Schmidt, David A. Basin...
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 9 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
CSFW
2006
IEEE
14 years 3 days ago
Cryptographically Sound Theorem Proving
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
Christoph Sprenger, Michael Backes, David A. Basin...
JAR
2006
81views more  JAR 2006»
13 years 6 months ago
Verifying the SET Purchase Protocols
SET (Secure Electronic Transaction) is a suite of protocols proposed by a consortium of credit card companies and software corporations to secure ecommerce transactions. The Purcha...
Giampaolo Bella, Fabio Massacci, Lawrence C. Pauls...