273 search results - page 36 / 55 » Modular Security Proofs for Key Agreement Protocols |
IEEEARES
2008
IEEE
14 years 1 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
ESORICS
2005
Springer
14 years 1 months ago
2005
Springer
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....
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
CSFW
2012
IEEE
11 years 10 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
ESCIENCE
2005
IEEE
14 years 1 months ago
2005
IEEE
The majority of current security architectures for grid systems use public key infrastructure (PKI) to authenticate identities of grid members and to secure resource allocation to...