...
首页> 外文期刊>Journal of intelligent & fuzzy systems: Applications in Engineering and Technology >Data confidentiality and integrity preserving outsourcing algorithm for matrix chain multiplication over malicious cloud server
【24h】

Data confidentiality and integrity preserving outsourcing algorithm for matrix chain multiplication over malicious cloud server

机译:恶意云服务器矩阵链乘法的数据机密性和完整性包装算法

获取原文
获取原文并翻译 | 示例
           

摘要

Cloud computing offers an economical, convenient and elastic pool of computing resources over the internet. It enables computationally weak client to execute large computations by outsourcing their computation load to the cloud servers. However, outsourcing of data and computation to the third-party cloud servers bring multifarious security and privacy challenges that needed to be understood and address before the development of outsourcing algorithm. In this paper, the authors propose solutions for matrix-chain multiplication (MCM) problem. Our goal is to minimize the execution burden on the client without sacrificing the confidentiality and integrity of the input/output. Conventionally, the complexity of matrix-chain multiplication is O(n(3)). After leveraging the facility of outsourcing, the client-side complexity reduces to O(n(2)). In the proposed algorithm, the client employs some efficient linear transformation schemes, which preserve the data confidentiality. It also developed a novel result verification scheme, which verifies the result with modest burden and high probability and maintain the integrity of computed result. The analytical analysis of algorithm depicted that the algorithm is simultaneously meeting the design goals of correctness, security, efficiency and verifiability. We conduct many experiments to validate the algorithm and demonstrate its practical usability. The algorithm is implemented on public cloud "Amazon EC2", and found that the proposed outsource algorithm performs 11.655 times faster computation of matrix-chain multiplication than the direct implementation.
机译:云计算提供互联网上的经济,方便,有弹性的计算资源池。它通过将它们的计算负载外包给云服务器来实现计算机弱的客户端来执行大计算。但是,将数据和计算外包给第三方云服务器带来了多种安全的安全性和隐私挑战,以便在外包算法开发之前理解和解决。在本文中,作者提出了矩阵链乘法(MCM)问题的解决方案。我们的目标是最大限度地减少客户端的执行负担,而不会牺牲输入/输出的机密性和完整性。传统上,矩阵链倍增的复杂性是O(n(3))。在利用外包设施后,客户端复杂性降低到O(n(2))。在所提出的算法中,客户端采用了一些有效的线性变换方案,其保密了数据机密性。它还开发了一种新颖的结果验证方案,它验证了谦虚负担和高概率的结果,并保持计算结果的完整性。算法的分析分析描述了算法同时满足了正确性,安全性,效率和验证性的设计目标。我们进行许多实验来验证算法,并展示其实际可用性。该算法在公共云“Amazon EC2”上实现,发现所提出的外部算法比直接实现更快地计算矩阵链乘法的11.655倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号