Description
A new two-parties key agreement protocol based on identities in groups is proposed. For abelian groups this protocol is, in fact, the Diffie-Hellman one. We also discuss a general scheme producing matrix groups for which our protocol can have a secure realization.
Prochains exposés
-
CryptoVerif: a computationally-sound security protocol verifier
Orateur : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-