Sciweavers

1490 search results - page 114 / 298
» The Logic of Authentication Protocols
Sort
View
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
14 years 19 days ago
Human competitive security protocols synthesis
This poster paper outlines a method for a search based approach to the development of provably correct protocols. Categories and Subject Descriptors C.2.2 [Computer Communication ...
Hao Chen, John A. Clark, Jeremy Jacob
IWCMC
2006
ACM
14 years 2 months ago
Resolving islands of security problem for DNSSEC
The DNS Security Extensions (DNSSEC) were developed to add origin authentication and integrity. DNSSEC defined a public key infrastructure over DNS tree hierarchy for the public ...
Eunjong Kim, Ashish Gupta, Batsukh Tsendjav, Danie...
ISW
2005
Springer
14 years 2 months ago
Constant Round Dynamic Group Key Agreement
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure und...
Ratna Dutta, Rana Barua
ACNS
2009
Springer
143views Cryptology» more  ACNS 2009»
14 years 3 months ago
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks
Abstract. We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, whi...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
14 years 1 months 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...