Cited By
View all- Sahu RPadhye S(2011)ID-based signature schemes from bilinear pairing: A surveyFrontiers of Electrical and Electronic Engineering in China10.1007/s11460-011-0119-16:4(487-500)Online publication date: 15-Dec-2011
A secure identity-based threshold signature scheme from Tate pairings
Authors: 
Hong Zhou, Xi Li, Jie YangAuthors Info & Claims
Hong Zhou, Xi Li, Jie YangAuthors Info & ClaimsArticle No.: 100, Pages 1 - 5
Abstract
Identity-based systems have the property that a user's public key can be easily calculated from his identity by a publicly available function. The bilinear pairings, especially Tate pairings, have high performance in cryptography. With the foundation of above two properties, we have proposed a new ID-Based (t,n) threshold signature scheme from Tate pairings. The scheme is proved secure that it can resist attacks including plaintext attack, recovery equation attack, conspiracy attack and impersonation attack. Furthermore, performance analysis shows that the proposed scheme is simple, efficient so that it will be suitable for an environment of finite bandwidth and low capability equipment.
References
[1]
A. Shamir, "Identity-based cryptosystems and signature schemes"{C}// Advance in Crypto'84, LNCS 196, Springer-Verlag, 1985: 47--53.
[2]
S. Tsuji and T. Itoh, "An ID-based cryptosystem based on the discrete logarithm problem"{J}, IEEE Journal of Selected Areas in Communications, 1989, 7(4): 467--473.
[3]
D. Boneh and M. Franklin, "Identity Based Encryption from the Weil Pairing" {C}// Advance in Crypto'01, LNCS 2139, Springer-Verlag, 2001: 213--229.
[4]
X. Yi, "An identity-based signature scheme from the Weil pairing"{J}, IEEE Communications Letters, 2003, 7(2): 76--78.
[5]
Y. Desmedt and Y. Frankel, "Shared Generation of Authenticators and Signatures" {C}// Advances in Cryptology-Crypto'91, LNCS 576, Springer-Verlag, 1992: 457--469.
[6]
A. Boldyreva, "Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signatures Scheme" {C}// Public Key Cryptography-PKC'03, LNCS 2567, Springer-Verlag, 2003: 31--46.
[7]
J. Baek and Y. L. Zheng, "Identity-Based Threshold Signature Scheme from the Bilinear Pairings" {C}// ITCC'04, IEEE Computer Society, 2004: 124--128.
[8]
X. F. Chen, F. G. Zhang, D. M. Konidala, and K. Kim, "New ID-Based Threshold Signature Scheme from Bilinear Pairings" {C}// Indocrypt'04, LNCS 3348, Springer-Verlag, 2004: 371--383.
[9]
X. G. Cheng, J. M. Liu and X. M. Wang, "An Identity-Based Signature and Its Threshold Version" {C}// Advanced Information Networking and Applications-AINA'05, IEEE Computer Society, 2005: 973--977.
[10]
Steven D. Galbraith, Keith Harrison, and David Soldera, Implementing the Tate Pairing, Algorithmic Number Theory {C}// 5th International Symposium (ANTS-V), LNCS 2369, Springer-Verlag, 2002: 324--337
[11]
D. Boneh and M. Franklin, "Identity Based Encryption from the Weil Pairing" {C}// Advance in Crypto'01, LNCS 2139, Springer-Verlag, 2001: 213--229.
[12]
N. Y. Lee, "The security of the improvement on the generalization of threshold signature and authenticated encryption" {J}, IEICE Transactions on Fundamentals, 2002, E85-A (10): 2364--2367.
[13]
A. K. Lenstra, "Selecting cryptographic key sizes" {J}, J. Cryptology, 2001, 14(4): 255--293.
Index Terms
- A secure identity-based threshold signature scheme from Tate pairings
Recommendations
A secure identity-based proxy multi-signature scheme
In a proxy multi-signature scheme, a designated proxy signer can generate the signature on behalf of a group of original signers. To our best knowledge, most of existing proxy multi-signature schemes are proposed in public key infrastructure setting, ...
Simulatable and secure certificate-based threshold signature without pairings
We propose the notion and define the security model of a certificate-based threshold signature. The model is a general model that allows both the master secret key and user secret keys to be determined and distributed to the corresponding participators. ...
Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
Information Security and CryptologyIn this paper, we present <em>the first</em>concrete example of identity-based undeniable signature <em>with</em>selective and universal convertibility, where the signer can release a selective proof to make a single undeniable signature publicly ...
Comments
Information & Contributors
Information
Published In
July 2008
677 pages
ISBN:9781605580883
DOI:10.1145/1509315
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 July 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Acceptance Rates
ICAIT '08 Paper Acceptance Rate 89 of 151 submissions, 59%;
Overall Acceptance Rate 122 of 207 submissions, 59%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 86Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Sahu RPadhye S(2011)ID-based signature schemes from bilinear pairing: A surveyFrontiers of Electrical and Electronic Engineering in China10.1007/s11460-011-0119-16:4(487-500)Online publication date: 15-Dec-2011
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in