Cryptanalysis of Double-trapdoor Hash Function and Multi-Trapdoor Hash Function Schemes

Xu An Wang, Yunxuan Su, Jindan Zhang
{"title":"Cryptanalysis of Double-trapdoor Hash Function and Multi-Trapdoor Hash Function Schemes","authors":"Xu An Wang, Yunxuan Su, Jindan Zhang","doi":"10.1109/NaNA53684.2021.00055","DOIUrl":null,"url":null,"abstract":"Cloud-based storage systems are the norm in our interconnected society, although there remain a number of research and operational challenges relating to the security of such systems. One ongoing research challenge is the design of efficient and secure query authentication mechanism for cloud-based storage systems, in the sense that data users can verify the authenticity and integrity of the retrieved data from the cloud servers. In 2017, Chandrasekhar and Singhal proposed a query authentication protocol for cloud-based storage systems, designed with efficiency and scalability in mind [IEEE Transactions on Services Computing, 10(4):520-533]. In this comment, we demonstrate that their protocol is not secure as claimed, due to weaknesses in two core building blocks of the protocol, namely: the double-trapdoor variant and the multi-trapdoor variant of the trapdoor hash function. By revealing this weakness, we hope future protocol designers can avoid similar mistake in their work.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA53684.2021.00055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud-based storage systems are the norm in our interconnected society, although there remain a number of research and operational challenges relating to the security of such systems. One ongoing research challenge is the design of efficient and secure query authentication mechanism for cloud-based storage systems, in the sense that data users can verify the authenticity and integrity of the retrieved data from the cloud servers. In 2017, Chandrasekhar and Singhal proposed a query authentication protocol for cloud-based storage systems, designed with efficiency and scalability in mind [IEEE Transactions on Services Computing, 10(4):520-533]. In this comment, we demonstrate that their protocol is not secure as claimed, due to weaknesses in two core building blocks of the protocol, namely: the double-trapdoor variant and the multi-trapdoor variant of the trapdoor hash function. By revealing this weakness, we hope future protocol designers can avoid similar mistake in their work.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
双陷阱门哈希函数和多陷阱门哈希函数方案的密码分析
基于云的存储系统是我们这个互联社会的常态,尽管在这类系统的安全性方面仍存在许多研究和操作挑战。一个正在进行的研究挑战是为基于云的存储系统设计高效和安全的查询认证机制,从某种意义上说,数据用户可以验证从云服务器检索数据的真实性和完整性。2017年,Chandrasekhar和Singhal提出了一种基于云存储系统的查询认证协议,该协议考虑了效率和可扩展性[IEEE Transactions on Services Computing, 10(4):520-533]。在这篇评论中,我们证明了他们的协议并不像声称的那样安全,因为协议的两个核心构建块存在弱点,即:双trapdoor变体和trapdoor哈希函数的多trapdoor变体。通过揭示这个弱点,我们希望未来的协议设计者可以在他们的工作中避免类似的错误。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Covert Communication in D2D Underlaying Cellular Network Online Scheduling of Machine Learning Jobs in Edge-Cloud Networks Dual attention mechanism object tracking algorithm based on Fully-convolutional Siamese network Fatigue Detection Technology for Online Learning The Nearest Neighbor Algorithm for Balanced and Connected k-Center Problem under Modular Distance
×
引用
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