Sciweavers

297 search results - page 35 / 60
» Formal Analysis of a Non-Repudiation Protocol
Sort
View
ARESEC
2011
104views more  ARESEC 2011»
12 years 7 months ago
An Inductive Approach to Provable Anonymity
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
Yongjian Li, Jun Pang
HYBRID
1998
Springer
13 years 12 months ago
Formal Verification of Safety-Critical Hybrid Systems
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
Carolos Livadas, Nancy A. Lynch
IPPS
2008
IEEE
14 years 2 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
FROCOS
2007
Springer
14 years 1 months ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...
CISC
2005
Springer
116views Cryptology» more  CISC 2005»
14 years 1 months ago
Specifying Authentication Using Signal Events in CSP
The formal analysis of cryptographic protocols has developed into a comprehensive body of knowledge, building on a wide variety of formalisms and treating a diverse range of securi...
Siraj A. Shaikh, Vicky J. Bush, Steve A. Schneider