向恶意云服务器公开委派和验证矩阵乘法

Malay Kumar, Jasraj Meena, M. Vardhan, Sanjeev Jain
{"title":"向恶意云服务器公开委派和验证矩阵乘法","authors":"Malay Kumar, Jasraj Meena, M. Vardhan, Sanjeev Jain","doi":"10.1109/POWERI.2016.8077371","DOIUrl":null,"url":null,"abstract":"The rapid development of cloud computing services and expansion of mobile computing devices have made computation outsourcing a promising solution for execution of extensive computation. In this framework, a computationally weak client outsources its large computation load to a cloud server. However, outsourcing of data and computation to a cloud server brings many security and privacy concern. In this paper, we are addressing matrix multiplication (MM) problem, because MM is a computation-intensive problem and useful in many domains. In the proposed MM outsourcing algorithm, the client outsources input dataset to the cloud server without revealing to them both the input dataset and the output. The algorithm is a non-interactive solution to the client, it sends only input and receives output along with the proof of verification from the cloud server. Further, this work extends the definition of verifiable computation to public verifiable computation, which allows participating worker (not only the client) to verify the correctness of the result computed on the cloud server. The analytical analysis shows that the algorithm is successfully meeting the challenges of correctness, security, verifiability, and efficiency. The practical evaluation validates the proposed algorithm. The result analysis shows that the algorithm is highly efficient and endorses the practical usability of the algorithm.","PeriodicalId":332286,"journal":{"name":"2016 IEEE 7th Power India International Conference (PIICON)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Public delegation & verifiability of matrix multiplication to a malicious cloud server\",\"authors\":\"Malay Kumar, Jasraj Meena, M. Vardhan, Sanjeev Jain\",\"doi\":\"10.1109/POWERI.2016.8077371\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid development of cloud computing services and expansion of mobile computing devices have made computation outsourcing a promising solution for execution of extensive computation. In this framework, a computationally weak client outsources its large computation load to a cloud server. However, outsourcing of data and computation to a cloud server brings many security and privacy concern. In this paper, we are addressing matrix multiplication (MM) problem, because MM is a computation-intensive problem and useful in many domains. In the proposed MM outsourcing algorithm, the client outsources input dataset to the cloud server without revealing to them both the input dataset and the output. The algorithm is a non-interactive solution to the client, it sends only input and receives output along with the proof of verification from the cloud server. Further, this work extends the definition of verifiable computation to public verifiable computation, which allows participating worker (not only the client) to verify the correctness of the result computed on the cloud server. The analytical analysis shows that the algorithm is successfully meeting the challenges of correctness, security, verifiability, and efficiency. The practical evaluation validates the proposed algorithm. The result analysis shows that the algorithm is highly efficient and endorses the practical usability of the algorithm.\",\"PeriodicalId\":332286,\"journal\":{\"name\":\"2016 IEEE 7th Power India International Conference (PIICON)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 7th Power India International Conference (PIICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/POWERI.2016.8077371\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 7th Power India International Conference (PIICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/POWERI.2016.8077371","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

云计算服务的快速发展和移动计算设备的扩展使得计算外包成为执行大量计算的有前途的解决方案。在这个框架中,计算能力较弱的客户端将其大量计算负载外包给云服务器。然而,将数据和计算外包给云服务器带来了许多安全和隐私问题。在本文中,我们讨论矩阵乘法问题,因为矩阵乘法是一个计算密集型问题,在许多领域都很有用。在本文提出的MM外包算法中,客户端将输入数据集外包给云服务器,而不向云服务器透露输入数据集和输出数据。该算法对客户端是一个非交互式的解决方案,它只发送输入并接收输出以及来自云服务器的验证证明。此外,这项工作将可验证计算的定义扩展到公共可验证计算,这允许参与的工作人员(不仅是客户端)验证云服务器上计算结果的正确性。分析表明,该算法成功地满足了正确性、安全性、可验证性和效率方面的挑战。实际评价验证了该算法的有效性。结果分析表明,该算法是高效的,证明了该算法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Public delegation & verifiability of matrix multiplication to a malicious cloud server
The rapid development of cloud computing services and expansion of mobile computing devices have made computation outsourcing a promising solution for execution of extensive computation. In this framework, a computationally weak client outsources its large computation load to a cloud server. However, outsourcing of data and computation to a cloud server brings many security and privacy concern. In this paper, we are addressing matrix multiplication (MM) problem, because MM is a computation-intensive problem and useful in many domains. In the proposed MM outsourcing algorithm, the client outsources input dataset to the cloud server without revealing to them both the input dataset and the output. The algorithm is a non-interactive solution to the client, it sends only input and receives output along with the proof of verification from the cloud server. Further, this work extends the definition of verifiable computation to public verifiable computation, which allows participating worker (not only the client) to verify the correctness of the result computed on the cloud server. The analytical analysis shows that the algorithm is successfully meeting the challenges of correctness, security, verifiability, and efficiency. The practical evaluation validates the proposed algorithm. The result analysis shows that the algorithm is highly efficient and endorses the practical usability of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信