Pairing-based provable blind signature scheme without random oracles

Authors:
Jian Liao;Yinghao Qi;Peiwei Huang;Mentian Rong
Affiliations:
Department of Electronic Engineering, ShangHai JiaoTong University, Shanghai, China;Department of Electronic Engineering, ShangHai JiaoTong University, Shanghai, China;Department of Electronic Engineering, ShangHai JiaoTong University, Shanghai, China;Department of Electronic Engineering, ShangHai JiaoTong University, Shanghai, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 5
Cited 1

Security of Blind Digital Signatures (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
ID-Based Blind Signature and Ring Signature from Pairings

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Efficient ID-based blind signature and proxy signature from bilinear pairings

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Efficient blind signatures without random oracles

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks

A provably secure blind signature scheme

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Blind signature allows the user to obtain a signature of a message in a way that the signer learns neither the message nor the resulting signature. Recently a lot of signature or encryption schemes are provably secure with random oracle, which could not lead to a cryptographic scheme secure in the standard model. Therefore designing efficient schemes provably secure in the standard model is a central line of modern cryptography. Followed this line, we proposed an efficiently blind signature without using hash function. Based on the complexity of q-SDH problem, we present strict proof of security against one more forgery under adaptive chosen message attack in the standard model. A full blind testimony demonstrates that our scheme bear blind property. Compared with other blind signature schemes, we think proposed scheme is more efficient. To the best of our knowledge, our scheme is the first blind signature scheme from pairings proved secure in the standard model.