Search

Partially blind signature was first introduced by Abe and Fujisaki. Subsequently, Abe and Okamoto proposed a provably secure construction for partially blind signature schemes with a formalized definition in their work. In this paper, based on discrete logarithm problem and the Schnorr's blind signature scheme, we propose a new efficient partially blind signature scheme. Follow the construction proposed by Abe and Okamoto, we prove its security in random oracle model. The computation and communication costs are both reduced in our scheme. It will make privacy-oriented applications which based on partially blind signatures more efficient and suitable for hardware-limited environment, such as smart phones and PDAs. [ABSTRACT FROM AUTHOR]

We analyze the relationship and subtle difference between the notion of certificateless public key cryptography (CL-PKC) and identity-based schemes without a trusted private key generator (PKG), then propose a certificateless threshold signature scheme based on bilinear pairings. The proposed scheme is robust and existentially unforgeable against adaptive chosen message attacks under CDH assumption in the random oracle model. [ABSTRACT FROM AUTHOR]

Authentication protocols are essential for security in many systems. However, authentication protocols are error-prone and difficult to design. In pervasive computing, the inherent characteristics such as mobility and restricted resources make it even harder to design suitable authentication protocols. In this paper we propose an authentication protocol to solve an open problem in pervasive computing, that is secure use of public information utilities without accessing a trusted third party (TTP). Our solution not only provides authentication, but also establishes a secure communication channel between the user and the service provider without the participation of TTP. The authentication protocol can be built with any secure symmetric and asymmetric cryptographic algorithm. We show the protocol can resist passive and active attacks. We also discuss how the protocol can be extended to an applicable scheme with payment support. Keywords: Authentication, Pervasive Computing Security, Public Key Infrastructure, E-Commerce. [ABSTRACT FROM AUTHOR]

In the past few years, proxy signatures have become an important research area and many excellent schemes have been proposed. Proxy signatures can combine other special signatures to obtain some new types of proxy signatures. A multisignature scheme is said to be structured if the group of signers is structured. Due to the various applications of the bilinear pairings in cryptography, many pairing-based signature schemes have been proposed. In this paper, we propose a proxy structured multisignature scheme from bilinear pairings. This scheme provides a possible solution to the problem that ordinary structured multisignature relies on the presence and cooperating of all the entities of the signing group. We support the proposed scheme with security and efficiency analysis. [ABSTRACT FROM AUTHOR]

Linear feedback shift register(LFSR) sequencces can be used to shorten the representation of the elements of a finite field. We employ n-stage LFSR sequence to construct an efficient blind signature scheme where main computation operations are performed in GF(q) and there do not need any exponentiation in its extension field GF(qn). [ABSTRACT FROM AUTHOR]