In many pairing-based protocols more than one party is involved, and some or all of them may be required to calculate pairings. Commonly it is the pairing calculation itself which takes most time. However some parties may be better equipped than others in terms of computational power. By exploiting the bilinearity property there are established ways to off-load the pairing calculation to an unt...

In this paper we introduce some key exchange protocols over noncommutative rings. These protocols use some polynomials with coefficients in the center of the ring as part of the private keys. We give some examples over the ring End(Zp × Zp2), where p is a prime number. We also give a security analysis of the proposed protocols and conclude that the only possible attack is by brute force.

We survey the set of all prior two-party certificateless key agreement protocols available in the literature at the time of this work. We find that all of the protocols exhibit vulnerabilities of varying severity, ranging from lack of resistance to leakage of ephemeral keys up to (in one case) a man-in-the-middle attack. Many of the protocols admit keycompromise impersonation attacks despite cl...

This paper contributes to the challenging field of security for wireless sensor networks by introducing a keyagreement scheme in which sensor nodes create secure radio connections with their neighbours depending on the aidof third parties. These third parties are responsible only for the pair-wise key establishment among sensor nodes,so they do not observe the physical phenomenon nor route data...

We describe two new attacks on the HMQV protocol. The first attack raises a serious question on the basic definition of “authentication” in HMQV, while the second attack is generally applicable to many other protocols. In addition, we present a new authenticated key agreement protocol called YAK. Our approach is to depend on well-established techniques such as Schnorr’s signature. Among all the...

Most recently, Yang et al proposed an ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem in journal of Computer and Security. In this paper, we find some disadvantages in their scheme and thereafter propose such an improved scheme that overcomes all those disadvantages existing in their scheme while the merits are left unchanged. Ou...

Unlike current closed systems such as 2 nd and 3 rd generations where the core network is controlled by a sole network operator, multiple network operators will coexist and manage the core network in Next Generation Networks (NGNs). This open architecture and the collaboration between different network operators will support ubiquitous connectivity and thus enhances users’ experience. However, ...

The ubiquitous presence of mobile communication devices and the continuous development of mobile data applications, which results in high level of mobile devices’ activity and exchanged data, often transparent to the user, makes privacy preservation an important feature of mobile telephony systems. We present a formal analysis of the UMTS Authentication and Key Agreement protocol, using the app...

The basic aim of key exchange is that two people who can only communicate via an insecure channel want to find a common secre t key without any attack. In this paper we show a model of key-agreement protocol using polynomials over non-commutative division semiring for network security. It is proved that the proposed protocol meets several security attributes under the assumption that the polyno...

We give a new two-pass authentication scheme, which is a generalisation of an authentication scheme of Sibert-Dehornoy-Girault based on the Diffie-Hellman conjugacy problem. Compared to the above scheme, for some parameters it is more efficient with respect to multiplications. We sketch a proof that our authentication scheme is secure.