In 2008, Lee et al. proposed two multiple-key agreement protocols, first one based on elliptic curve cryptography (ECC) and the other one, based on bilinear pairings. Shortly after publication, Vo et al. showed that the Lee-Wu-Wang's pairing-based protocol is vulnerable to impersonation attack then
Non-abelian key agreement protocols
β Scribed by Iris Anshel; Michael Anshel; Dorian Goldfeld
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 115 KB
- Volume
- 130
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
β¦ Synopsis
A key-agreement protocol (KAP) is a multi-party algorithm deΓΏned by a sequence of steps specifying the actions required for two or more individuals to each obtain a shared secret. A brief introduction to an axiomatic basis for non-abelian KAPs is presented. The security of these protocols is related to the di culty of solving equations in non-linear algebraic structures. In particular, it is shown that well known hard problems in group theory can be used to generate key agreement protocols. Concrete examples of such KAPs are discussed and the axiomatic method is shown to subsume other braid group KAPs. The paper concludes with a snapshot of methods and examples currently under investigation.
π SIMILAR VOLUMES
In this paper, we present a strongly secure identity-based (ID-based) two-party authenticated key agreement (AKA) protocol, which captures all basic desirable security properties including master key forward secrecy, ephemeral secrets reveal resistance and so on, and is provably secure in the extend
Cryptography based on chaos theory has developed fast in the past few years, but most of the researches focus on secret key cryptography. There are few public key encryption algorithms and cryptographic protocols based on chaos, which are also of great importance for network security. We introduce a