基于准二进码的不可否认签名方案

Lei Hua, Mu Han, Shidian Ma, Xiaolin Feng
{"title":"基于准二进码的不可否认签名方案","authors":"Lei Hua, Mu Han, Shidian Ma, Xiaolin Feng","doi":"10.1109/IAEAC.2018.8577671","DOIUrl":null,"url":null,"abstract":"Undeniable signature is a kind of signature primitive where the verification step is an interaction between the verifier and the signer. Code-based cryptography is an alternative of post quantum cryptography, which permits fast encryption operation. In this paper, we introduce a quasi-dyadic code based undeniable signature. The verification protocol for our scheme is a 5-pass zero-knowledge protocol derived from our previous identification protocol. We also analyze the security of completeness, soundnes, zero-knowledge, invisibility, unforgeability and nontransferability of the scheme. And the performance of our scheme shows the signature lengths for different security level, and that the communication costs in the verification step is less than the costs in the compared scheme.","PeriodicalId":6573,"journal":{"name":"2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)","volume":"11 6","pages":"2189-2194"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Undeniable Signature Scheme based on Quasi-Dyadic Codes\",\"authors\":\"Lei Hua, Mu Han, Shidian Ma, Xiaolin Feng\",\"doi\":\"10.1109/IAEAC.2018.8577671\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Undeniable signature is a kind of signature primitive where the verification step is an interaction between the verifier and the signer. Code-based cryptography is an alternative of post quantum cryptography, which permits fast encryption operation. In this paper, we introduce a quasi-dyadic code based undeniable signature. The verification protocol for our scheme is a 5-pass zero-knowledge protocol derived from our previous identification protocol. We also analyze the security of completeness, soundnes, zero-knowledge, invisibility, unforgeability and nontransferability of the scheme. And the performance of our scheme shows the signature lengths for different security level, and that the communication costs in the verification step is less than the costs in the compared scheme.\",\"PeriodicalId\":6573,\"journal\":{\"name\":\"2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)\",\"volume\":\"11 6\",\"pages\":\"2189-2194\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAEAC.2018.8577671\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAEAC.2018.8577671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

不可否认签名是一种签名原语,其验证步骤是验证者和签名者之间的交互。基于代码的加密是后量子加密的一种替代方案,它允许快速的加密操作。本文提出了一种基于准二进码的不可否认签名。我们方案的验证协议是一个从我们之前的识别协议派生出来的5道零知识协议。并分析了该方案的完备性、健全性、零知识性、不可见性、不可伪造性和不可转移性的安全性。该方案的性能显示了不同安全级别下的签名长度,验证步骤中的通信开销小于比较方案的开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Undeniable Signature Scheme based on Quasi-Dyadic Codes
Undeniable signature is a kind of signature primitive where the verification step is an interaction between the verifier and the signer. Code-based cryptography is an alternative of post quantum cryptography, which permits fast encryption operation. In this paper, we introduce a quasi-dyadic code based undeniable signature. The verification protocol for our scheme is a 5-pass zero-knowledge protocol derived from our previous identification protocol. We also analyze the security of completeness, soundnes, zero-knowledge, invisibility, unforgeability and nontransferability of the scheme. And the performance of our scheme shows the signature lengths for different security level, and that the communication costs in the verification step is less than the costs in the compared scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Intelligent module for recognizing emotions by voice Modeling of thermophysiological state of man Intelligent support system for agro-technological decisions for sowing fields Analysis of visual object tracking algorithms for real-time systems Choosing the best parameters for method of deformed stars in n-dimensional space
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1