Generalized signcryption (GSC) can adaptively work as an encryption scheme, a signature scheme or a signcryption scheme with only one algorithm. It is more suitable for the storage constrained setting. In this paper, motivated by Paterson–Schuldt’s scheme, based on bilinear pairing, we first proposed an identity based generalized signcryption (IDGSC) scheme in the standard model. To the best of...

We examine the authentication framework for Globus Security Infrastructure (GSI, the current grid security standard) and identify a weakness of poor scalability due to heavy interactions between a user-side client and many resource contribution sites. We propose an alternative authentication framework for GSI using authenticated session keys which are shared between two parties without any inte...

Let E be an elliptic curve over a finite field Fq with a power of prime q, r a prime dividing #E(Fq), and k the smallest positive integer satisfying r|Φk(p), called embedding degree. Then a bilinear map t : E(Fq)[r]×E(Fqk )/rE(Fqk )→ Fqk is defined, called the Tate pairing. And the Ate pairing and other variants are obtained by reducing the domain for each argument and raising it to some power....

⎯ A key agreement protocol is a cryptographical primitive which allows participants to share a common secret key via insecure channel. In particular, a multiparty key agreement protocol is a key agreement protocol that can manage arbitrary number of participants at once. In the security point of view, authentication and forward secrecy are the most important requirements in such protocols. One ...

Forward secure threshold signature plays an important role in distributed signature. Based on binary tree structure, a new forward secure threshold signature from bilinear pairings is proposed in this paper. In this scheme, each cost of key generation algorithm, key update algorithm, signing algorithm and verifying algorithm is independent of the total number of time periods. At the same time, ...

This paper proposes a novel bilinear pairing-free identity-based privacy-preserving anonymous authentication scheme for vehicle-to-vehicle (V2V) communication, called “NIBPA”. Today, vehicular ad hoc networks (VANETs) offer important solutions traffic safety and efficiency. However, VANETs are vulnerable to cyberattacks due their use of wireless communication. Therefore, schemes used solve secu...

Cryptographic pairing (bilinear mapping) is a core algorithm for various cryptography protocols. It is computationally expensive and inefficiently computed with general purpose processors. Although there has been previous work looking into efficient hardware designs for pairing, most of these systems use small characteristic curves which are incompatible with practical software designs. In this...

We compute the p-primary components of the linking pairings of orientable 3-manifolds admitting a fixed-point free Saction. Using this, we show that any nonsingular linking pairing on a finite abelian group with homogeneous 2-primary summand is realized by such a manifold. However there are pairings on inhomogeneous 2-groups which are not realizable. In [3] we computed the linking pairings of o...

With rapid growth of mobile wireless networks, handheld devices are popularly used by people and many mobile applications have been rapidly developed. Considering the limited computing capability of smart cards or mobile devices, the security scheme design suitable for these mobile devices is a nontrivial challenge. A user authentication scheme is a mechanism to authenticate a remote user over ...