Efficient partially blind signature scheme with provable security

Authors:
Zheng Gong;Xiangxue Li;Kefei Chen
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 11
Cited 0

Cryptanalysis of certain variants of Rabin's signature scheme

Information Processing Letters
Zero-knowledge proofs of identity

Journal of Cryptology
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Security of Blind Discrete Log Signatures against Interactive Attacks

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Provably Secure Partially Blind Signatures

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On Concrete Security Treatment of Signatures Derived from Identification

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Provably Secure Restrictive Partially Blind Signature Scheme

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
How to Date Blind Signatures

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
RSA-Based Partially Blind Signature with Low Computation

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
A new design of efficient partially blind signature scheme

Journal of Systems and Software
Two improved partially blind signature schemes from bilinear pairings

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.