Sciweavers

119 search results - page 11 / 24
» Formal Methods for Assuring Security of Protocols
Sort
View
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 2 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
14 years 23 days ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
14 years 2 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
CSFW
2006
IEEE
14 years 2 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
SIGADA
2004
Springer
14 years 1 months ago
Information systems security engineering: a critical component of the systems engineering lifecycle
The purpose of this research paper is to illustrate the industrial and federal need for Information Systems Security Engineering (ISSE) in order to build Information Assurance (IA...
James F. Davis