Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation
Shamiek Mangipudi, Pavel Chuprikov, Patrick Eugster, Malte Viering, Savvas Savvides
Abstract
As more organizations are leveraging third-party cloud and edge data centers to process data efficiently, the issue of preserving data confidentiality becomes increasingly important. In response, numerous security mechanisms have been introduced and promoted in recent years including software-based ones such as homomorphic encryption, as well as hardware-based ones such as Intel SGX and AMD SEV. However these mechanisms vary in their security properties, performance characteristics, availability, and application modalities, making it hard for programmers to judiciously choose and correctly employ the right one for a given data query. This paper presents a mechanism-independent approach to distributed confidentiality-preserving data analytics. Our approach hinges on a core programming language which abstracts the intricacies of individual security mechanisms. Data is labeled using custom confidentiality levels arranged along a lattice in order to capture its exact confidentiality constraints. High-level mappings between available mechanisms and these labels are captured through a novel expressive form of security policy. Confidentiality is guaranteed through a type system based on a novel formulation of noninterference, generalized to support our security policy definition. Queries written in a largely security-agnostic subset of our language are transformed to the full language to automatically use mechanisms in an efficient, possibly combined manner, while provably preserving confidentiality in data queries end-to-end. We prototype our approach as an extension to the popular Apache Spark analytics engine, demonstrating the significant versatility and performance benefits of our approach over single hardwired mechanisms --- including in existing systems --- without compromising on confidentiality.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on8
- Panoply: Low-TCB Linux Applications With SGX EnclavesShweta Shinde, Dat Le Tien, Shruti Tople, Prateek SaxenaNDSS 2017 · 274 citations
- Occlum: Secure and Efficient Multitasking Inside a Single Enclave of Intel SGXYouren Shen, Hongliang Tian, Yu Chen, Kang Chen et al.ASPLOS 2020 · 144 citations
- Nonmalleable Information Flow ControlEthan Cecchetti, Andrew C. Myers, Owen ArdenCCS 2017 · 49 citations
- Orchard: Differentially Private Analytics at ScaleEdo Roth, Hengchu Zhang, Andreas Haeberlen, Benjamin C. PierceOSDI 2020 · 40 citations
- Efficient Confidentiality-Preserving Data Analytics over Symmetrically Encrypted DatasetsSavvas Savvides, Darshika Khandelwal, Patrick EugsterVLDB 2020 · 38 citations
Related papers
- SGX-BigMatrix: A Practical Encrypted Data Analytic Framework With Trusted ProcessorsFahad Shaon, Murat Kantarcioglu, Zhiqiang Lin, Latifur KhanCCS 2017 · 83 citations
- Secure and Policy-Compliant Query Processing on Heterogeneous Computational Storage ArchitecturesHarshavardhan Unnibhavi, David Cerdeira, Antonio Barbalace, Nuno Santos et al.SIGMOD 2022 · 5 citations
- Oblivious coopetitive analytics using hardware enclavesAnkur Dave, Chester Leung, Raluca Ada Popa, Joseph E. Gonzalez et al.EuroSys 2020 · 26 citations
- FLARE: A Fast, Secure, and Memory-Efficient Distributed Analytics Framework (Flavor: Systems)Xiang Li, Fabing Li, Mingyu GaoVLDB 2023 · 14 citations
- Oblivious Multi-Party Machine Learning on Trusted ProcessorsOlga Ohrimenko, Felix Schuster, Cédric Fournet, Aastha Mehta et al.USENIX Security 2016 · 594 citations
