MOSE: Practical Multi-User Oblivious Storage via Secure Enclaves

被引:14
作者
Hoang, Thang [1 ]
Behnia, Rouzbeh [1 ]
Jang, Yeongjin [2 ]
Yavuz, Attila A. [1 ]
机构
[1] Univ S Florida, CSE, Tampa, FL 33620 USA
[2] Oregon State Univ, EECS, Corvallis, OR 97331 USA
来源
PROCEEDINGS OF THE TENTH ACM CONFERENCE ON DATA AND APPLICATION SECURITY AND PRIVACY, CODASPY 2020 | 2020年
关键词
secure enclaves; multi-user ORAM; oblivious storage; ATTACKS;
D O I
10.1145/3374664.3375749
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-user oblivious storage allows users to access their shared data on the cloud while retaining access pattern obliviousness and data confidentiality simultaneously. Most secure and efficient oblivious storage systems focus on the utilization of the maximum network bandwidth in serving concurrent accesses via a trusted proxy. However, since the proxy executes a standard ORAM protocol over the network, the performance is capped by the network bandwidth and latency. Moreover, some important features such as access control and security against active adversaries have not been thoroughly explored in such proxy settings. In this paper, we propose MOSE, a multi-user oblivious storage system that is efficient and enjoys from some desirable security properties. Our main idea is to harness a secure enclave, namely Intel SGX, residing on the untrusted storage server to execute proxy logic, thereby, minimizing the network bottleneck of proxy-based designs. In this regard, we address various technical design challenges such as memory constraints, side-channel attacks and scalability issues when enabling proxy logic in the secure enclave. We present a formal security model and analysis for secure enclave multi-user ORAM with access control. We optimize MOSE to boost its throughput in serving concurrent requests. We implemented MOSE and evaluated its performance on commodity hardware. Our evaluation confirmed the efficiency of MOSE, where it achieves approximately two orders of magnitudes higher throughput than the state-of-the-art proxy-based design, and also, its performance is scalable proportional to the available system resources.
引用
收藏
页码:17 / 28
页数:12
相关论文
共 56 条
[1]   OBLIVIATE: A Data Oblivious File System for Intel SGX [J].
Ahmad, Adil ;
Kim, Kyungtae ;
Sarfaraz, Muhammad Ihsanulhaq ;
Lee, Byoungyoung .
25TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2018), 2018,
[2]  
[Anonymous], 2017, P P 10 EUROPEAN WORK, DOI [DOI 10.1145/3065913.3065915, 10.1145/3065913.3065915]
[3]  
[Anonymous], 2014, IACR Cryptol. ePrint Arch.
[4]  
Apon D, 2014, LECT NOTES COMPUT SC, V8383, P131, DOI 10.1007/978-3-642-54631-0_8
[5]  
Asonov D, 2003, LECT NOTES COMPUT SC, V2482, P209
[6]   Practicing Oblivious Access on Cloud Storage: the Gap, the Fallacy, and the New Way Forward [J].
Bindschaedler, Vincent ;
Naveed, Muhammad ;
Pan, Xiaorui ;
Wang, XiaoFeng ;
Huang, Yan .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :837-849
[7]  
Blass Erik-Oliver, 2017, Applied Cryptography and Network Security. 15th International Conference, ACNS 2017. Proceedings: LNCS 10355, P686, DOI 10.1007/978-3-319-61204-1_34
[8]   Oblivious Parallel RAM and Applications [J].
Boyle, Elette ;
Chung, Kai-Min ;
Pass, Rafael .
THEORY OF CRYPTOGRAPHY, TCC 2016-A, PT II, 2016, 9563 :175-204
[9]   Leakage-Abuse Attacks Against Searchable Encryption [J].
Cash, David ;
Grubbs, Paul ;
Perry, Jason ;
Ristenpart, Thomas .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :668-679
[10]   Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs [J].
Chan, T-H Hubert ;
Shi, Elaine .
THEORY OF CRYPTOGRAPHY, TCC 2017, PT II, 2017, 10678 :72-107