期刊
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
卷 18, 期 4, 页码 1645-1666出版社
IEEE COMPUTER SOC
DOI: 10.1109/TDSC.2019.2933844
关键词
Servers; Data privacy; Outsourcing; Encryption; Cloud computing; Databases; Computation and data privacy; data and computation outsourcing; distributed computing; MapReduce; Shamir's secret-sharing
类别
资金
- Lynne and WilliamFrankel Center for Computer Science
- Rita Altura Trust Chair in Computer Science
- Israeli Ministry of Science, Technology and Space, Infrastructure Research in the Field of Advanced Computing and Cyber Security
- Israel National Cyber Bureau
- Israel & the Japan Science and Technology Agency (JST)
- German Research Funding Organization (DFG) [8767581199]
- National Natural Science Foundation of China [61402393, 61601396]
- DARPA [FA8750-16-2-0021]
- NSF [1527536, 1545071]
The paper introduces algorithms for data outsourcing based on Shamir's secret-sharing scheme and for executing privacy-preserving SQL queries using MapReduce. These algorithms prevent an adversary from knowing the database or the query, and also prevent output-size and access-pattern attacks.
Data outsourcing allows data owners to keep their data at untrusted clouds that do not ensure the privacy of data and/or computations. One useful framework for fault-tolerant data processing in a distributed fashion is MapReduce, which was developed for trusted private clouds. This paper presents algorithms for data outsourcing based on Shamir's secret-sharing scheme and for executing privacy-preserving SQL queries such as count, selection including range selection, projection, and join while using MapReduce as an underlying programming model. Our proposed algorithms prevent an adversary from knowing the database or the query while also preventing output-size and access-pattern attacks. Interestingly, our algorithms do not involve the database owner, which only creates and distributes secret-shares once, in answering any query, and hence, the database owner also cannot learn the query. Logically and experimentally, we evaluate the efficiency of the algorithms on the following parameters: (i) the number of communication rounds (between a user and a server), (ii) the total amount of bit flow (between a user and a server), and (iii) the computational load at the user and the server.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据