Subversion resistant identity-based signature

被引:0
作者
Ouyang, Mengdi [1 ]
Yang, Cuixiang [1 ]
Liao, Xiaojuan [2 ]
Li, Fagen [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Technol, Chengdu 611731, Sichuan, Peoples R China
[2] Chengdu Univ Technol, Sichuan Engn Technol Res Ctr Ind Internet Intellig, Chengdu 610059, Sichuan, Peoples R China
基金
中国国家自然科学基金;
关键词
Identity-based signature; Subversion attack; Cryptpographic reverse firewall; SCHEME;
D O I
10.1016/j.sysarc.2025.103385
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Identity-based cryptography (IBC) resolves the issue of certificate management, establishing itself as an evolving industry standard. Identity-based signature (IBS), an essential element of IBC, ensures integrity and authentication, playing a crucial role in the domains of internet of things (IoT) and cloud computing. Nevertheless, the "Snowden" event exposed how attackers subverted cryptographic algorithms' implementations to undermine security and conduct mass-surveillance. We explore a subversion attack (SA) model on IBS and define two properties including undetectability and strong key recoverability. Our SA enables a recovery of the master private key and a private key through any two successive signatures, posing a greater challenge. Cryptographic reverse firewalls (RFs) are the main countermeasures to resist SAs. However, existing works necessitate the storage of randomness corresponding to various identities and fail to resist bit-by-bit SA. To address the aforementioned issue, we formulate a system model and a security model for subversion-resistant identity-based signature (SR-IBS). Then, we establish an instance and prove SR-IBS's security of existential unforgeability under chosen message attack (EUF-CMA) along with subversion resistance. Finally, we leverage pypbc library to conduct a comprehensive experiment analysis. The results indicate the execution difference between subverted IBS and pure one is around 2ms and RFs only add approximately 0.5% of overall execution across five different security level. SR-IBS provides subversion-resistant without increasing high computation burden.
引用
收藏
页数:11
相关论文
共 44 条
[1]  
[Anonymous], 2013, IEEE STANDARDS, P1, DOI [DOI 10.1109/IEEESTD.2013.6509896, 10.1109/IEEESTD.2013. 6469140, DOI 10.1109/IEEESTD.2013.6469140]
[2]  
[Anonymous], 1984, Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, DOI DOI 10.1007/3-540-39568-7
[3]   Subversion-Resilient Signature Schemes [J].
Ateniese, Giuseppe ;
Magri, Bernardo ;
Venturi, Daniele .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :364-375
[4]  
Barreto PSLM, 2005, LECT NOTES COMPUT SC, V3788, P515
[5]   Mass-surveillance without the State: Strongly Undetectable Algorithm-Substitution Attacks [J].
Bellare, Mihir ;
Jaeger, Joseph ;
Kane, Daniel .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :1431-1440
[6]  
Bellare M, 2014, LECT NOTES COMPUT SC, V8616, P1, DOI 10.1007/978-3-662-44371-2_1
[7]   Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs [J].
Ben-Sasson, Eli ;
Chiesa, Alessandro ;
Green, Matthew ;
Tromer, Eran ;
Virza, Madars .
2015 IEEE SYMPOSIUM ON SECURITY AND PRIVACY SP 2015, 2015, :287-304
[8]   Algorithm Substitution Attacks from a Steganographic Perspective [J].
Berndt, Sebastian ;
Liskiewicz, Maciej .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1649-1660
[9]  
Bernstein Daniel J., 2016, The New Codebreakers Essays Dedicated to David Kahn on the Occasion of His 85th Birthday. LNCS 9100, P256, DOI 10.1007/978-3-662-49301-4_17
[10]   The random oracle methodology, revisited [J].
Canetti, R ;
Goldreich, O ;
Halevi, S .
JOURNAL OF THE ACM, 2004, 51 (04) :557-594