TY - GEN
T1 - Private and secure secret shared mapreduce (Extended Abstract)
AU - Dolev, Shlomi
AU - Li, Yin
AU - Sharma, Shantanu
N1 - Publisher Copyright:
© IFIP International Federation for Information Processing 2016.
PY - 2016
Y1 - 2016
N2 - Data outsourcing allows data owners to keep their data in public clouds, which do not ensure the privacy of data and computations. One fundamental and useful framework for processing data in a distributed fashion is Map Reduce. In this paper, we investigate and present techniques for executing Map Reduce computations in the public cloud while preserving privacy. Specifically, we propose a technique to outsource a database using Shamir secret-sharing scheme to public clouds, and then, provide privacy-preserving algorithms for performing search and fetch, equijoin, and range queries using Map Reduce. Consequently, in our proposed algorithms, the public cloud cannot learn the database or computations. All the proposed algorithms eliminate the role of the database owner, which only creates and distributes secret-shares once, and minimize the role of the user, which only needs to perform a simple operation for result reconstructing. We evaluate the efficiency by (i) the number of communication rounds (between a user and a cloud), (ii) the total amount of bit flow (between a user and a cloud), and (iii) the computational load at the user-side and the cloud-side.
AB - Data outsourcing allows data owners to keep their data in public clouds, which do not ensure the privacy of data and computations. One fundamental and useful framework for processing data in a distributed fashion is Map Reduce. In this paper, we investigate and present techniques for executing Map Reduce computations in the public cloud while preserving privacy. Specifically, we propose a technique to outsource a database using Shamir secret-sharing scheme to public clouds, and then, provide privacy-preserving algorithms for performing search and fetch, equijoin, and range queries using Map Reduce. Consequently, in our proposed algorithms, the public cloud cannot learn the database or computations. All the proposed algorithms eliminate the role of the database owner, which only creates and distributes secret-shares once, and minimize the role of the user, which only needs to perform a simple operation for result reconstructing. We evaluate the efficiency by (i) the number of communication rounds (between a user and a cloud), (ii) the total amount of bit flow (between a user and a cloud), and (iii) the computational load at the user-side and the cloud-side.
UR - http://www.scopus.com/inward/record.url?scp=84979586942&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84979586942&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-41483-6_11
DO - 10.1007/978-3-319-41483-6_11
M3 - Conference contribution
AN - SCOPUS:84979586942
SN - 9783319414829
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 151
EP - 160
BT - Data and Applications Security and Privacy - 30th Annual IFIP WG 11.3 Conference, DBSec 2016, Proceedings
A2 - Ranise, Silvio
A2 - Swarup, Vipin
PB - Springer Verlag
T2 - 30th IFIP WG 11.3 Conference on Data and Applications Security, DBSec 2016
Y2 - 18 July 2016 through 20 July 2016
ER -