To achieve secure data communications, two parties should be authenticated by each other and agree on a secret session key by exchanging messages over an insecure channel. In this paper, based on the bilinear pairing, we present a new two-party authenticated key agreement protocol, and use the techniques from provable security to examine the security of our protocol within Bellare-Rogaway model.

A Self-pairing es(P,P ) is a special subclass of bilinear pairing where both input points in a group are equal. Self-pairings have some interesting applications in cryptographic scheme and protocols. Recently some novel methods for constructing self-pairings on supersingular elliptic curves have been proposed. In this paper we first give the construction of self-pairings on some supersingular e...

Certificateless public key schemes without pairing have attracted much attention for its relatively high efficiency. The revocation problem is a very necessary issue in a public key cryptosystem. However, there have been some solutions to the certificateless revocation problem; they still suffer from low efficiency or security weakness. In this paper, we propose a revocable certificateless sign...

Bilinear maps, or pairings, initially proposed in a cryptologic context for cryptanalytic purposes, proved afterward to be an amazingly flexible and useful tool for the construction of cryptosystems with unique features. Yet, they are notoriously hard to implement efficiently, so that their effective deployment requires a careful choice of parameters and algorithms. In this paper we review the ...

Given an abelian group A and a Lie group G, we construct a bilinear pairing from A× π1(R) to π1(G), where R is a subvariety of the variety of representations A → G. In the case where A is the peripheral subgroup of a torus or twobridge knot group, G = S1 and R is a certain variety of representations arising from suitable SU(2)-representations of the knot group, we show that this pairing is not ...

Short signature is an essential component in cryptography. Short digital signatures are needed in environments where a human is asked to manually key in the signature.. In this paper we propose a new short signature scheme with weil pairing. Also we analyze security and efficiency of our scheme. Security of our scheme is based on expressing the torsion point of curve into linear combination of ...

Generalized signcryption is a new cryptographic primitive in which a signcryption scheme can work as an encryption scheme as well as a signature scheme. This paper presents an identity based generalized signcryption scheme based on bilinear pairing and discusses its security for message confidentiality non repudiation and ciphertext authentication.

Secret sharing schemes as basic building blocks for many applications in distributed systems should be efficient and robust to any possible attacks. Based on bilinear pairing, this paper will propose a new (t, n) threshold verifiable multi-secret sharing scheme and a GGOC verifiable multi-secret sharing scheme that improve the security and minimizes the number of published values.

An asymmetric pairing over groups of composite order is a bilinear map e : G1 ×G2 → GT for groups G1 and G2 of composite order N = pq. We observe that a recent construction of pairing-friendly elliptic curves in this setting by Boneh, Rubin, and Silverberg exhibits surprising and unprecedented structure: projecting an element of the order-N group G1 ⊕G2 onto the bilinear groups G1 and G2 requir...

In this paper, we propose the first provable secure certificate-based proxy signature with message recovery without bilinear pairing. The notion of certificate-based cryptography was initially introduced by Gentry in 2003, in order to simplify certificate management in traditional public key cryptography (PKC) and to solve the key escrow problem in identity-based cryptosystems. To date, a numbe...