Ting Liu , Renwan Bi , Jinbo Xiong , Yuanyuan Zhang , Youliang Tian
{"title":"Arithmetic consistency attack-resistant integrity verification for secure outsourced computing","authors":"Ting Liu , Renwan Bi , Jinbo Xiong , Yuanyuan Zhang , 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.
期刊介绍:
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.