Supporting Privacy of Computations in Mobile Big Data Systems

被引:1
作者
Premnath, Sriram Nandha [1 ]
Haas, Zygmunt J. [2 ,3 ]
机构
[1] Qualcomm Res, Santa Clara, CA 95051 USA
[2] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14853 USA
[3] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75080 USA
基金
美国国家科学基金会;
关键词
secure cloud computing; privacy preserving search; garbled circuits; securemultiparty computation;
D O I
10.3390/fi8020017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud computing systems enable clients to rent and share computing resources of third party platforms, and have gained widespread use in recent years. Numerous varieties of mobile, small-scale devices such as smartphones, red e-health devices, etc., across users, are connected to one another through the massive internetwork of vastly powerful servers on the cloud. While mobile devices store "private information" of users such as location, payment, health data, etc., they may also contribute "semi-public information" (which may include crowdsourced data such as transit, traffic, nearby points of interests, etc.) for data analytics. In such a scenario, a mobile device may seek to obtain the result of a computation, which may depend on its private inputs, crowdsourced data from other mobile devices, and/or any "public inputs" from other servers on the Internet. We demonstrate a new method of delegating real-world computations of resource-constrained mobile clients using an encrypted program known as the garbled circuit. Using the garbled version of a mobile client's inputs, a server in the cloud executes the garbled circuit and returns the resulting garbled outputs. Our system assures privacy of the mobile client's input data and output of the computation, and also enables the client to verify that the evaluator actually performed the computation. We analyze the complexity of our system. We measure the time taken to construct the garbled circuit as well as evaluate it for varying number of servers. Using real-world data, we evaluate our system for a practical, privacy preserving search application that locates the nearest point of interest for the mobile client to demonstrate feasibility.
引用
收藏
页数:25
相关论文
共 34 条
[1]  
Ames S., 2015, ENABLING REAL TIME M, P116
[2]  
[Anonymous], 2004, USENIX SEC S
[3]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[4]  
Barker E., 2012, NIST SPEC PUBL, P700
[5]  
BEAVER D, 1990, PROCEEDINGS OF THE TWENTY SECOND ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, P503, DOI 10.1145/100216.100287
[6]  
Ben-David A, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P257
[7]   A SIMPLE UNPREDICTABLE PSEUDORANDOM NUMBER GENERATOR [J].
BLUM, L ;
BLUM, M ;
SHUB, M .
SIAM JOURNAL ON COMPUTING, 1986, 15 (02) :364-383
[8]   Efficient Fully Homomorphic Encryption from (Standard) LWE [J].
Brakerski, Zvika ;
Vaikuntanathan, Vinod .
2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, :97-106
[9]  
Bugiel S, 2011, LECT NOTES COMPUT SC, V7025, P32, DOI 10.1007/978-3-642-24712-5_3
[10]  
Burkhart M., 2010, P 19 USENIX C SEC WA