Sciweavers

719 search results - page 65 / 144
» Proving Security Protocols Correct
Sort
View
IJACT
2010
67views more  IJACT 2010»
14 years 4 months ago
On message recognition protocols: recoverability and explicit confirmation
: We look at message recognition protocols (MRPs) and prove that there is a oneto-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we ...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
CD
2004
Springer
15 years 3 months ago
Secure Deployment of Components
Abstract. The secure deployment of components is widely recognized as a crucial problem in component-based software engineering. While major effort is concentrated on preventing ma...
Mark Grechanik, Dewayne E. Perry
CSFW
2002
IEEE
15 years 2 months ago
A Formal Analysis of Some Properties of Kerberos 5 Using MSR
We formalize aspects of the Kerberos 5 authentication protocol in the Multi-Set Rewriting formalism (MSR) on two levels of detail. The more detailed formalization reflects the in...
Frederick Butler, Iliano Cervesato, Aaron D. Jagga...
MOBIHOC
2005
ACM
15 years 9 months ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...
ESORICS
2005
Springer
15 years 3 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento