Arithmetic consistency attack-resistant integrity verification for secure outsourced computing

IF 3.7 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ting Liu , Renwan Bi , Jinbo Xiong , Yuanyuan Zhang , Youliang Tian
{"title":"Arithmetic consistency attack-resistant integrity verification for secure outsourced computing","authors":"Ting Liu ,&nbsp;Renwan Bi ,&nbsp;Jinbo Xiong ,&nbsp;Yuanyuan Zhang ,&nbsp;Youliang Tian","doi":"10.1016/j.jisa.2025.104218","DOIUrl":null,"url":null,"abstract":"<div><div>Secure outsourced computing (SOC) enables clients to offload data and computational tasks to cloud servers, thereby liberating them from the constraints of storage and computational resources. As a novel computational paradigm, it has garnered widespread attention for its ability to offer significant advantages while ensuring data confidentiality and integrity. To address the issues of high computational cost, lack of bidirectional verification capability, and vulnerability to attacks in existing integrity verification schemes based on homomorphic encryption (HE), this paper proposes an arithmetic consistency attack-resistant integrity verification framework (ACIV). Firstly, we design two verification protocols combining HE and arithmetic secret sharing (ASS), which support integrity verification for both outsourced data and computational results. The incorporation of lightweight ASS significantly reduces computational cost during verification. Secondly, we construct a novel arithmetic consistency attack method, exposing the security vulnerabilities in this type of verification protocols. The malicious adversary can easily exploit the homomorphic properties of HE to tamper with data. On the basis, we propose corresponding countermeasures. Under the assumption of pre-generated immutable random numbers, the optimized protocols effectively defend against arithmetic consistency attack while ensuring data confidentiality and integrity during transmission. Theoretical analysis and performance evaluation demonstrate that the optimized version achieves stronger security and better efficiency than the baseline protocols. This work provides a feasible solution for integrity verification in SOC environments.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"94 ","pages":"Article 104218"},"PeriodicalIF":3.7000,"publicationDate":"2025-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212625002558","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Secure outsourced computing (SOC) enables clients to offload data and computational tasks to cloud servers, thereby liberating them from the constraints of storage and computational resources. As a novel computational paradigm, it has garnered widespread attention for its ability to offer significant advantages while ensuring data confidentiality and integrity. To address the issues of high computational cost, lack of bidirectional verification capability, and vulnerability to attacks in existing integrity verification schemes based on homomorphic encryption (HE), this paper proposes an arithmetic consistency attack-resistant integrity verification framework (ACIV). Firstly, we design two verification protocols combining HE and arithmetic secret sharing (ASS), which support integrity verification for both outsourced data and computational results. The incorporation of lightweight ASS significantly reduces computational cost during verification. Secondly, we construct a novel arithmetic consistency attack method, exposing the security vulnerabilities in this type of verification protocols. The malicious adversary can easily exploit the homomorphic properties of HE to tamper with data. On the basis, we propose corresponding countermeasures. Under the assumption of pre-generated immutable random numbers, the optimized protocols effectively defend against arithmetic consistency attack while ensuring data confidentiality and integrity during transmission. Theoretical analysis and performance evaluation demonstrate that the optimized version achieves stronger security and better efficiency than the baseline protocols. This work provides a feasible solution for integrity verification in SOC environments.
面向安全外包计算的抗算术一致性攻击完整性验证
安全外包计算(SOC)使客户能够将数据和计算任务卸载到云服务器上,从而将其从存储和计算资源的限制中解放出来。作为一种新的计算范式,它在保证数据机密性和完整性的同时提供了显著的优势,引起了广泛的关注。针对现有基于同态加密(HE)的完整性验证方案计算成本高、缺乏双向验证能力、易受攻击等问题,提出了一种抗算法一致性攻击的完整性验证框架(ACIV)。首先,我们设计了HE和算法秘密共享(ASS)相结合的验证协议,支持对外包数据和计算结果的完整性验证。轻量级ASS的结合显著降低了验证过程中的计算成本。其次,构造了一种新的算法一致性攻击方法,揭示了这类验证协议存在的安全漏洞。恶意攻击者可以很容易地利用HE的同态特性来篡改数据。在此基础上,提出了相应的对策。在预先生成不可变随机数的假设下,优化后的协议在保证传输过程中数据的保密性和完整性的同时,有效防御了算法一致性攻击。理论分析和性能评估表明,优化后的版本比基线协议具有更高的安全性和效率。该工作为SOC环境下的完整性验证提供了一种可行的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信