Synchronized Aggregate Signature Under Standard Assumption in the Random Oracle Model

被引:0
|
作者
Kabaleeshwaran, R. [1 ]
Sai, Panuganti Venkata Shanmukh [2 ]
机构
[1] Indian Inst Informat Technol Design & Mfg Kurnool, Dept Comp Sci & Engn, Kurnool, India
[2] Capgemini Technol Serv India Ltd, Hyderabad, India
关键词
Synchronized Aggregate signature; Pointcheval-Sanders randomizable signatures; Dual-Form Signature Technique; Standard Assumption; STRUCTURE-PRESERVING SIGNATURES; SECURITY;
D O I
10.1007/978-3-031-56232-7_10
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An aggregate signature enables to aggregation of multiple signatures generated by different signers on different messages. A synchronized aggregate signature is a special type of aggregate signature in which all the signatures generated at a particular time epoch will be aggregated, where each signer uses the same synchronized clock. So far in the literature, Ahn et al.'s (ACM CCS 2010) synchronized aggregate signature is the only scheme whose security is proved under the standard computational Diffie-Hellman assumption. However, their construction supports only restricted message space. All the other synchronized aggregate signature constructions either use non-standard assumptions or rely on symmetric pairings. Recently, Tezuka and Tanaka presented a Pointcheval-Sanders signature-based synchronized aggregate signature construction which provides more efficient aggregate signature verification than other existing schemes in the pairing setting. However, their security is proved under the interactive non-standard assumption that turned less trusted. Hence, we construct a synchronized aggregate signature scheme by including a suitable signature component and using Gerbush et al.'s dual-form signature technique we prove its security under standard SXDH assumptions.
引用
收藏
页码:197 / 220
页数:24
相关论文
共 50 条
  • [1] An Efficient Synchronized Aggregate Signature Scheme From Standard RSA Assumption
    Quo, Xinshun
    Wang, Zhiwei
    [J]. INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING, 2014, 7 (03): : 229 - 240
  • [2] A Simple Secure Signature Scheme Based on the Strong RSA Assumption without Random Oracle Model
    Naji, Akram
    Abu Hasan, Yahya
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (11): : 159 - 162
  • [3] A Pairing Free Secure Identity-based Aggregate Signature Scheme under Random Oracle
    Abouelkheir, Eman
    Tromp, Jolanda G.
    [J]. INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2018, 42 (02): : 221 - 228
  • [4] Synchronized Aggregate Signatures from the RSA Assumption
    Hohenberger, Susan
    Waters, Brent
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II, 2018, 10821 : 197 - 229
  • [5] Impossibility on the Schnorr Signature from the One-More DL Assumption in the Non-Programmable Random Oracle Model
    Fukumitsu, Masayuki
    Hasegawa, Shingo
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2021, E104A (09) : 1163 - 1174
  • [6] Quantum random oracle model for quantum digital signature
    Shang, Tao
    Lei, Qi
    Liu, Jianwei
    [J]. PHYSICAL REVIEW A, 2016, 94 (04)
  • [7] An Efficient SCF-PEKS Without Random Oracle Under Simple Assumption
    WANG Guangbo
    LI Feng
    FAN Liwen
    LIU Haicheng
    [J]. Chinese Journal of Electronics, 2021, 30 (01) : 77 - 84
  • [8] An Efficient SCF-PEKS Without Random Oracle Under Simple Assumption
    Wang Guangbo
    Li Feng
    Fan Liwen
    Liu Haicheng
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2021, 30 (01) : 77 - 84
  • [9] An efficient conditionally anonymous ring signature in the random oracle model
    Zeng, Shengke
    Jiang, Shaoquan
    Qin, Zhiguang
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 461 : 106 - 114
  • [10] A certificateless signature scheme with strong unforgeability in the random oracle model
    Yang, Xia
    Sheng, Xing-Ping
    Zhang, Mian
    [J]. JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2018, 18 (03) : 715 - 724