Comparing two pairing-based aggregate signature schemes

被引：27
|
作者：
Chatterjee, Sanjit [1 ]
Hankerson, Darrel [2 ]
Knapp, Edward [1 ]
Menezes, Alfred [1 ]
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[2] Auburn Univ, Dept Math & Stat, Auburn, AL 36849 USA
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2010年 / 55卷 / 2-3期
关键词：
Pairing-based cryptography; Aggregate signature schemes; DISCRETE LOGARITHMS; EFFICIENT; COMPUTATION;
D O I：
10.1007/s10623-009-9334-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the random oracle model. The first pairing-based aggregate signature scheme which has a security proof that does not make the random oracle assumption was proposed in 2006 by Lu, Ostrovsky, Sahai, Shacham and Waters (LOSSW). In this paper, we compare the security and efficiency of the BGLS and LOSSW schemes when asymmetric pairings derived from Barreto-Naehrig (BN) elliptic curves are employed.
引用
收藏
页码：141 / 167
页数：27
相关论文
共 50 条
  • [1] Comparing two pairing-based aggregate signature schemes
    Sanjit Chatterjee
    Darrel Hankerson
    Edward Knapp
    Alfred Menezes
    Designs, Codes and Cryptography, 2010, 55 : 141 - 167
  • [2] On the Security of Two Pairing-Based Signature Schemes
    Behnia, Rouzbeh
    Tan, Syh-Yuan
    Heng, Swee-Huay
    2015 5TH INTERNATIONAL CONFERENCE ON IT CONVERGENCE AND SECURITY (ICITCS), 2015,
  • [3] Cryptanalysis of two pairing-based blind signature schemes
    Wang, Jiyao
    Cao, Tianjie
    2006 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLS 1 AND 2, PROCEEDINGS, 2006, : 180 - +
  • [4] Aggregate Signature-Based Efficient Attributes Proof with Pairing-Based Anonymous Credential
    Guo, Nan
    Cheng, Jianju
    Zhang, Bin
    Yim, Kangbin
    2013 16TH INTERNATIONAL CONFERENCE ON NETWORK-BASED INFORMATION SYSTEMS (NBIS 2013), 2013, : 276 - 281
  • [5] On the security of pairing-based non-interactive designated verifier proofs of undeniable signature schemes
    Behnia, Rouzbeh
    Heng, Swee-Huay
    Gan, Che-Sheng
    2012 IEEE Conference on Sustainable Utilization and Development in Engineering and Technology, STUDENT 2012 - Conference Booklet, 2012, : 207 - 212
  • [6] On the Security of Pairing-Based Non-Interactive Designated Verifier Proofs of Undeniable Signature Schemes
    Behnia, Rouzbeh
    Heng, Swee-Huay
    Gan, Che-Sheng
    2012 IEEE CONFERENCE ON SUSTAINABLE UTILIZATION AND DEVELOPMENT IN ENGINEERING AND TECHNOLOGY (STUDENT), 2012, : 207 - 212
  • [7] A Pairing-based Blind Signature Scheme with Message Recovery
    Han, Song
    Chang, Elizabeth
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 8, 2005, 8 : 303 - 308
  • [8] Pairing-based strong key-insulated signature scheme
    Reddy, P. Vasudeva
    Babu, A. Ramesh
    Gayathri, N. B.
    INTERNATIONAL JOURNAL OF INFORMATION AND COMPUTER SECURITY, 2022, 18 (1-2) : 148 - 164
  • [9] Provably secure pairing-based convertible undeniable signature with short signature length
    Huang, Xinyi
    Mu, Yi
    Susilo, Willy
    Wu, Wei
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2007, 2007, 4575 : 367 - +
  • [10] A pairing-based blind signature E-voting scheme
    López-García, Lourdes (mllopezg@uaemex.mx), 1600, Oxford University Press (57):
12345