Joux [10] presented a one round protocol for tripartitie key agreement and Al-Riyami et.al. [15] developed a number of tripartitie, one round, authenticated protocols related to MTI and MQV protocols. Recently, Boneh and Silverleg [4] studied multilinear forms, which provides a one round multi-party key agreement protocol. In this paper, we propose (n + 1) types of one round authenticated multi...

In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjugacy Search Problem (CSP) is hard in braid group.

Within the natural language processing (NLP) community, active learning has been widely investigated and applied in order to alleviate the annotation bottleneck faced by developers of new NLP systems and technologies. This paper presents the first theoretical analysis of stopping active learning based on stabilizing predictions (SP). The analysis has revealed three elements that are central to ...

Recently, Sun, Chen and Hwang [J. Syst. Software, 75 (2005), 63–68] have proposed two new three-party protocols, one for password-based authenticated key agreement and one for verifier-based authenticated key agreement. In this paper, we show that both of Sun-Chen-Hwang’s protocols are insecure against an active adversary who can intercept messages, start multiple sessions of a protocol, or oth...

Certificate-based cryptography is a new public-key cryptographic paradigm that has very appealing features, namely it simplifies the certificate management problem in traditional public key cryptography while eliminating the key escrow problem in identity-based cryptography. So far, three authenticated key agreement (AKA) protocols in the setting of certificate-based cryptography have been prop...

Since Joux published the first pairing-based one-round tripartite key agreement protocol [12], many authenticated protocols have been proposed. However most of them were soon broken or proved not to achieve some desirable security attributes. In this paper we present two protocol variants based on Shim [19] and Zhang et al.’s work [23]. As the formalized model of this kind of AK protocols is no...

Since Bellare and Rogaway’s work in 1994, the indistinguishability-based security models of authenticated key agreement protocols in simple cases have been evolving for more than ten years. In this paper, we review and organize the models under a unified framework with some new extensions. By providing a new ability (the Coin query) to adversaries and redefining two key security notions, the fr...

We describe an ID based authenticated two pass key agreement protocol which makes use of the Weil pairing The protocol is described and its properties are discussed including the ability to add key con rmation

Key agreement protocol is of fundamental importance in providing data confidentiality and integrity between two or more parties over an insecure network. In 2004, Popescu [14] proposed an authenticated key agreement protocol in which its security is claimed. However, Yoon and Yoo [19] discovered its vulnerabilities two years later and proposed an improved variant of it. In this paper, we highli...

In this paper, we rethink the security of authenticated key agreement and design a new protocol from the practical perspective. Our main focus is on reconsidering the need for real-time checking of random exchange to be in a proper subgroup, and discussing the implication of authenticated key agreement not requiring the subgroup element verification in run time.