返回
Secure Tensor Decomposition for Big Data Using Transparent Computing Paradigm
DOI:10.1109/TC.2018.2814046.png)
摘要
En 中文
The exponential growth of big data places a great burden on current computing environment. However, there exists a vast gap in the approaches that can securely and efficiently process the large scale heterogeneous data. This paper, on the basis of transparent computing paradigm, presents a unified approach that coordinates the transparent servers and transparent clients to decompose tensor, a mathematical model widely used in data intensive applications, to a core tensor multiplied with a number of truncated orthogonal bases. The structured, semi-structured as well as structured data are transformed to low-order sub-tensors, which are then encrypted using the Paillier homomorphic encryption scheme on the transparent clients. The cipher sub-tensors are transported to the transparent servers for carrying out the integration and decomposition operations. Three secure decomposition algorithms, namely secure bidiagonalization algorithm, secure singular value decomposition algorithm, and secure mode product algorithm, are presented to generate the bidiagonal matrices, truncated orthogonal bases, and core tensor respectively. The homomorphic operations of the three algorithms are carried out on the transparent servers, while the non-homomorphic operations, namely division and square root, are performed on the transparent clients. Experimental results indicate that the proposed method is promising for secure tensor decomposition for big data.
Keyword:
Big data
transparent computing
tensor decompostion
homomorphic encryption
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Heavy metal tolerance of marine phytoplankton. IV. Combined effect of zinc and cadmium on growth and uptake in some marine diatoms海洋浮游植物对重金属的耐受性。四。锌和镉对某些海洋硅藻生长和吸收的综合影响

