Sciweavers

19 search results - page 1 / 4
» Complete Characterization of Security Protocols by Pattern R...
Sort
View
CCS
2008
ACM
13 years 7 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
ESSOS
2009
Springer
13 years 8 months ago
Pattern-Based Confidentiality-Preserving Refinement
Abstract. We present an approach to security requirements engineering, which makes use of special kinds of problem frames that serve to structure, characterize, analyze, and solve ...
Holger Schmidt
IJISEC
2002
58views more  IJISEC 2002»
13 years 4 months ago
A complete characterization of a family of key exchange protocols
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
LICS
2007
IEEE
13 years 11 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam