Efficient Pairing-Based Threshold Proxy Signature Scheme with Known Signers

Authors:
Haifeng Qian;Zhenfu Cao;Qingshui Xue
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, 1954 Huashan Road, Shanghai 200030, the People's Republic of China, e-mail: ares@sjtu.edu.cn, cao-zf@cs.sjtu.edu.cn, ...;(Corresponding author) Department of Computer Science and Engineering, Shanghai Jiao Tong University, 1954 Huashan Road, Shanghai 200030, the People's Republic of China, e-mail: ares@sjtu.edu.cn, ...;Department of Computer Science and Engineering, Shanghai Jiao Tong University, 1954 Huashan Road, Shanghai 200030, the People's Republic of China, e-mail: ares@sjtu.edu.cn, cao-zf@cs.sjtu.edu.cn, ...
Venue:
Informatica
Year:
2005

Citing 11
Cited 3

Proxy signatures for delegating signing operation

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
New nonrepudiable threshold proxy signature scheme with known signers

Journal of Systems and Software
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on 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
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Nonrepudiable proxy multi-signature scheme

Journal of Computer Science and Technology
Cryptanalysis of Nonrepudiable Threshold Proxy Signature Schemes with Known Signers

Informatica
Security proofs for signature schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient ID-based blind signature and proxy signature from bilinear pairings

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
A secure signature scheme from bilinear maps

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
An efficient nonrepudiable threshold proxy signature scheme with known signers

Computer Communications

One-Round ID-Based Threshold Signature Scheme from Bilinear Pairings

Informatica
Adaptively Secure Threshold Signature Scheme in the Standard Model

Informatica
Security analysis of some threshold signature schemes and multi-signature schemes

CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since threshold proxy signature has been proposed, all threshold proxy signature schemes are based on the discrete logarithm problems in the modular multiplicative group which has an element g with a large prime order. Nowadays this kind of threshold proxy signature schemes become more and more complex and time-consuming for security and specific requirement. In this paper, we propose a (bilinear) pairing-based threshold proxy signature scheme with known signers, analyze its security and check the following properties the proposed scheme has: non-repudiation, unforgeability, identifiability, distinguishability, verifiability, prevention of misuse of proxy signing right, etc. Moreover, we point out that the proposed scheme is of great efficiency by comparing it with Sun's and Hsu et al.'s scheme.