Hosting Services on an Untrusted Cloud

被引:12
作者
Boneh, Dan [1 ]
Gupta, Divya [2 ,3 ]
Mironov, Ilya [4 ]
Sahai, Amit [2 ,3 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
[2] Univ Calif Los Angeles, Los Angeles, CA USA
[3] Ctr Encrypted Funct, Los Angeles, CA USA
[4] Google, Mountain View, CA USA
来源
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT II | 2015年 / 9057卷
关键词
PROOFS;
D O I
10.1007/978-3-662-46803-6_14
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider a scenario where a service provider has created a software service S and desires to outsource the execution of this service to an untrusted cloud. The software service contains secrets that the provider would like to keep hidden from the cloud. For example, the software might contain a secret database, and the service could allow users to make queries to different slices of this database depending on the user's identity. This setting presents significant challenges not present in previous works on outsourcing or secure computation. Because secrets in the software itself must be protected against an adversary that has full control over the cloud that is executing this software, our notion implies indistinguishability obfuscation. Furthermore, we seek to protect knowledge of the software S to the maximum extent possible even if the cloud can collude with several corrupted users. In this work, we provide the first formalizations of security for this setting, yielding our definition of a secure cloud service scheme. We provide constructions of secure cloud service schemes assuming indistinguishability obfuscation, one-way functions, and non-interactive zero-knowledge proofs. At the heart of our paper are novel techniques to allow parties to simultaneously authenticate and securely communicate with an obfuscated program, while hiding this authentication and communication from the entity in possession of the obfuscated program.
引用
收藏
页码:404 / 436
页数:33
相关论文
共 18 条
[1]  
Barak B., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P1
[2]  
Boneh D, 2013, LECT NOTES COMPUT SC, V8270, P280, DOI 10.1007/978-3-642-42045-0_15
[3]  
Boyle E, 2014, LECT NOTES COMPUT SC, V8383, P501, DOI 10.1007/978-3-642-54631-0_29
[4]   FAMILIES OF FINITE SETS IN WHICH NO SET IS COVERED BY THE UNION OF R OTHERS [J].
ERDOS, P ;
FRANKL, P ;
FUREDI, Z .
ISRAEL JOURNAL OF MATHEMATICS, 1985, 51 (1-2) :79-89
[5]   Multiple noninteractive zero knowledge proofs under general assumptions [J].
Feige, U ;
Lapidot, D ;
Shamir, A .
SIAM JOURNAL ON COMPUTING, 1999, 29 (01) :1-28
[6]   Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits (Extended Abstract) [J].
Garg, Sanjam ;
Gentry, Craig ;
Halevi, Shai ;
Raykova, Mariana ;
Sahai, Amit ;
Waters, Brent .
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, :40-49
[7]  
Gennaro R, 2010, LECT NOTES COMPUT SC, V6223, P465, DOI 10.1007/978-3-642-14623-7_25
[8]  
Gentry C., 2014, 2014148 CRYPT EPRINT
[9]  
Goldreich O., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P464, DOI 10.1109/SFCS.1984.715949
[10]  
Goldwasser S, 2014, LECT NOTES COMPUT SC, V8441, P578, DOI 10.1007/978-3-642-55220-5_32