基于代码的高效电子取证一次性盲签名方案

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Haiyan Xiu, Fang Ren, Xinglong Xue, Dong Zheng
{"title":"基于代码的高效电子取证一次性盲签名方案","authors":"Haiyan Xiu,&nbsp;Fang Ren,&nbsp;Xinglong Xue,&nbsp;Dong Zheng","doi":"10.1049/2024/6656367","DOIUrl":null,"url":null,"abstract":"<div>\n <p>We propose a one-time blind signature scheme based on coding theory, which is improved on the basis of the SHMWW protocol. By adding two blinding factors, the anonymity of users is protected. The analysis proves that the scheme is secure and meets the requirements of completeness, blindness, and one-more unforgeability. Under the 128-bit security level, our scheme can achieve a signature length of 2.1 kB. The experimental results show that our scheme has a short signature length and high execution efficiency. Our scheme can also be applied to electronic forensics of traffic accidents on the Internet of Vehicles, which can protect users’ privacy.</p>\n </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/6656367","citationCount":"0","resultStr":"{\"title\":\"An Efficient Code-Based One-Time Blind Signature Scheme for Electronic Forensics\",\"authors\":\"Haiyan Xiu,&nbsp;Fang Ren,&nbsp;Xinglong Xue,&nbsp;Dong Zheng\",\"doi\":\"10.1049/2024/6656367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>We propose a one-time blind signature scheme based on coding theory, which is improved on the basis of the SHMWW protocol. By adding two blinding factors, the anonymity of users is protected. The analysis proves that the scheme is secure and meets the requirements of completeness, blindness, and one-more unforgeability. Under the 128-bit security level, our scheme can achieve a signature length of 2.1 kB. The experimental results show that our scheme has a short signature length and high execution efficiency. Our scheme can also be applied to electronic forensics of traffic accidents on the Internet of Vehicles, which can protect users’ privacy.</p>\\n </div>\",\"PeriodicalId\":50380,\"journal\":{\"name\":\"IET Information Security\",\"volume\":\"2024 1\",\"pages\":\"\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/6656367\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Information Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/2024/6656367\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Information Security","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/2024/6656367","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了一种基于编码理论的一次性盲签名方案,该方案在 SHMWW 协议的基础上进行了改进。通过增加两个盲因子,保护了用户的匿名性。分析证明,该方案是安全的,满足完整性、盲性和一次不可伪造性的要求。在 128 位安全等级下,我们的方案可以实现 2.1 kB 的签名长度。实验结果表明,我们的方案具有较短的签名长度和较高的执行效率。我们的方案还可应用于车联网交通事故的电子取证,保护用户隐私。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

An Efficient Code-Based One-Time Blind Signature Scheme for Electronic Forensics

An Efficient Code-Based One-Time Blind Signature Scheme for Electronic Forensics

We propose a one-time blind signature scheme based on coding theory, which is improved on the basis of the SHMWW protocol. By adding two blinding factors, the anonymity of users is protected. The analysis proves that the scheme is secure and meets the requirements of completeness, blindness, and one-more unforgeability. Under the 128-bit security level, our scheme can achieve a signature length of 2.1 kB. The experimental results show that our scheme has a short signature length and high execution efficiency. Our scheme can also be applied to electronic forensics of traffic accidents on the Internet of Vehicles, which can protect users’ privacy.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Information Security
IET Information Security 工程技术-计算机:理论方法
CiteScore
3.80
自引率
7.10%
发文量
47
审稿时长
8.6 months
期刊介绍: IET Information Security publishes original research papers in the following areas of information security and cryptography. Submitting authors should specify clearly in their covering statement the area into which their paper falls. Scope: Access Control and Database Security Ad-Hoc Network Aspects Anonymity and E-Voting Authentication Block Ciphers and Hash Functions Blockchain, Bitcoin (Technical aspects only) Broadcast Encryption and Traitor Tracing Combinatorial Aspects Covert Channels and Information Flow Critical Infrastructures Cryptanalysis Dependability Digital Rights Management Digital Signature Schemes Digital Steganography Economic Aspects of Information Security Elliptic Curve Cryptography and Number Theory Embedded Systems Aspects Embedded Systems Security and Forensics Financial Cryptography Firewall Security Formal Methods and Security Verification Human Aspects Information Warfare and Survivability Intrusion Detection Java and XML Security Key Distribution Key Management Malware Multi-Party Computation and Threshold Cryptography Peer-to-peer Security PKIs Public-Key and Hybrid Encryption Quantum Cryptography Risks of using Computers Robust Networks Secret Sharing Secure Electronic Commerce Software Obfuscation Stream Ciphers Trust Models Watermarking and Fingerprinting Special Issues. Current Call for Papers: Security on Mobile and IoT devices - https://digital-library.theiet.org/files/IET_IFS_SMID_CFP.pdf
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信