Strengthening the Security of Deniable Authentication Scheme Using Zero-Knowledge Proof

A. Barmawi, Asep Rizal Nurjaman
{"title":"Strengthening the Security of Deniable Authentication Scheme Using Zero-Knowledge Proof","authors":"A. Barmawi, Asep Rizal Nurjaman","doi":"10.1145/3507509.3507513","DOIUrl":null,"url":null,"abstract":"In an electronic voting system, authentication is used to ensure that the voter is legitimate without knowing his/her identity, while the vote collectors verify the data is received from a legitimate user without knowing the identity of the voter. One of the authentication schemes that fulfilled this requirement is called a deniable authentication scheme, where the receiver can prove the source of the message while another party cannot identify the source of the message. In 2013, Li-Takagi et al. proposed a deniable authentication scheme. However, Li-Takagi's scheme has weaknesses if the receiver fully cooperates with the third party. In this case, the third party can identify the source of a given message. In the proposed method, zero-knowledge proof is introduced to preserve the anonymity of the deniable authentication scheme when the receiver fully cooperates with the third party. Based on the analysis, the proposed scheme fulfills the requirement of the deniable authentication scheme when the receiver fully cooperates with the third party. However, the proposed scheme has additional computation costs for securing the shared secret key. Two attack schemes that are carried out on both Li-Takagi and the proposed scheme are the MITM attack and the impersonation attack. The probability of breaking the proposed scheme using an MITM attack is lower than when using Li-Takagi's scheme, but the probability of breaking the proposed scheme using an impersonation attack is the same as Li-Takagi's scheme.","PeriodicalId":280794,"journal":{"name":"Proceedings of the 2021 11th International Conference on Communication and Network Security","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 11th International Conference on Communication and Network Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3507509.3507513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In an electronic voting system, authentication is used to ensure that the voter is legitimate without knowing his/her identity, while the vote collectors verify the data is received from a legitimate user without knowing the identity of the voter. One of the authentication schemes that fulfilled this requirement is called a deniable authentication scheme, where the receiver can prove the source of the message while another party cannot identify the source of the message. In 2013, Li-Takagi et al. proposed a deniable authentication scheme. However, Li-Takagi's scheme has weaknesses if the receiver fully cooperates with the third party. In this case, the third party can identify the source of a given message. In the proposed method, zero-knowledge proof is introduced to preserve the anonymity of the deniable authentication scheme when the receiver fully cooperates with the third party. Based on the analysis, the proposed scheme fulfills the requirement of the deniable authentication scheme when the receiver fully cooperates with the third party. However, the proposed scheme has additional computation costs for securing the shared secret key. Two attack schemes that are carried out on both Li-Takagi and the proposed scheme are the MITM attack and the impersonation attack. The probability of breaking the proposed scheme using an MITM attack is lower than when using Li-Takagi's scheme, but the probability of breaking the proposed scheme using an impersonation attack is the same as Li-Takagi's scheme.
利用零知识证明增强可否认认证方案的安全性
在电子投票系统中,身份验证用于确保选民在不知道其身份的情况下是合法的,而投票收集者则在不知道选民身份的情况下验证从合法用户接收到的数据。满足此要求的一种身份验证方案称为可否认身份验证方案,其中接收方可以证明消息的来源,而另一方无法识别消息的来源。2013年Li-Takagi等人提出了一种可否认认证方案。然而,如果接收方与第三方完全合作,Li-Takagi的方案就有弱点。在这种情况下,第三方可以识别给定消息的来源。在该方法中,引入零知识证明,在接收方与第三方充分合作的情况下保持可否认认证方案的匿名性。分析表明,当接收方与第三方完全合作时,所提出的方案满足可否认认证方案的要求。然而,该方案在保护共享密钥方面有额外的计算成本。针对Li-Takagi和提出的方案实施的两种攻击方案是MITM攻击和冒充攻击。使用MITM攻击破坏提议方案的概率低于使用Li-Takagi的方案,但使用模拟攻击破坏提议方案的概率与Li-Takagi的方案相同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信