We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and public key attacks. We also propose a new signature scheme without random oracle using bilinear pairing that is existentially unforgeable under a chosen message attack. The security of the proposed scheme depends on a c...

This paper describes an elementary protocol to prove possession of anonymous credentials together with its implementation on smart cards. The protocol uses self-blindable attribute certificates represented as points on an elliptic curve (which are stored on the card). These certificates are verified on the reader-side via a bilinear pairing. Java Card smart cards offer only very limited access ...

A fermionic analogue of the Hodge star operation is shown to have an explicit operator representation in models with fermions, in spacetimes of any dimension. This operator realizes a conjugation (pairing) not used explicitly in field-theory, and induces a metric in the space of wave-function(al)s just as in exterior calculus. If made real (Hermitian), this induced metric turns out to be identi...

As an application of Hirota bilinear method, perturbation expansion truncated at different levels is used to obtain exact soliton solutions to (2+1)-dimensional nonlinear evolution equation in much simpler way in comparison to other existing methods. We have derived bilinear form of nonlinear evolution equation and using this bilinear form, bilinear Backlund transformations and construction of ...

In this paper, a proxy blind signature scheme based on bilinear pairing is proposed. The proposed proxy blind signature is existential unforgeable under adaptively chosen warrant attacks and chosen message attacks upon the CDH assumptions and DBDH assumptions in the Random Oracle Model. In order to make all levels of banks issue electronic coin, the proxy blind signature scheme is applied to co...

Certificateless public key cryptography is receiving significant attention because it is a new paradigm that simplifies the traditional PKC and solves the inherent key escrow problem suffered by ID-PKC. Certificateless signcryption is one of the most important security primitives in CL-PKC. However, to the best of our knowledge, all constructions of certificateless signcryption (CLSC) in the li...

Signcryption is a cryptographic primitive which could provide authentication and confidentiality simultaneously with a computational cost lower than signing and encryption respectively, while the ring signcryption has anonymity in addition to authentication and confidentiality. In order to design an identitybased threshold ring signcryption, this paper presented an efficient identity-based thre...

In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the random oracle model. The first pairing-based aggregate signature scheme which has a security proof that does not make the random oracle assumption was proposed in 2006 by Lu, Ostrovsky, Sahai, Shacham and Waters (LOS...

In a proxy signature scheme, one original signer delegates a proxy signer to sign messages on behalf of the original signer. When the proxy signature is created, the proxy signer generates valid proxy signatures on behalf of the original signer. Based on Cha and Cheon’s ID-based signature scheme, a model of designated-verifier proxy signature scheme from the bilinear pairing is proposed. The pr...

We present a new two-party identity-based key agreement that is more efficient than previously proposed schemes. It is inspired on a new identity-based key pair derivation algorithm first proposed by Sakai and Kasahara. We show how this key agreement can be used in either escrowed or escrowless mode. We also describe conditions under which users of different Key Generation Centres can agree on ...