paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation

面向高效机密性保护的广义基于策略的非干扰性
PLDI 7(PLDI)2023匹配度 2/10 · 该论文属于编程语言/类型系统与安全领域,关注保密数据分析中的非干扰与安全机制组合,但与用户核心方向(PL与AI/Agentic程序、LLM改进静态分析、浮点程序分析、贝叶斯程序分析)几乎没有直接交集。虽然涉及类型系统这一PL要素,但应用场景和安全目标与画像中的研究问题不匹配。引用 3 inbox
Shamiek Mangipudi, Pavel Chuprikov, Patrick Eugster, Malte Viering, Savvas Savvides
crossref: 2026-09-10

AI 速览

一句话:提出机制无关的保密数据分析语言,以格标签、可表达安全策略和广义非干扰类型系统自动高效组合多种安全机制。

随着组织利用第三方云与边缘数据中心处理数据,机密性保护愈发重要。同态加密、Intel SGX、AMD SEV 等机制在安全属性、性能、可用性和应用方式上差异很大,程序员难以合理选择并正确使用。本文提出一种机制无关的分布式保密数据分析方法:以核心编程语言抽象各安全机制的细节;数据用沿格排列的自定义机密性级别标注;通过一种富有表达力的安全策略描述机制与标签之间的高层映射;并借助基于非干扰新形式化、经推广以支持该策略定义的 类型系统 来保证机密性。用基本安全无关子集编写的查询会被转换为完整语言,从而自动以高效、可能组合的方式使用机制,同时可证明地端到端保持数据查询的机密性。作者在 Apache Spark 上构建原型,展示了相比单一硬编码机制(包括现有系统)在通用性与性能上的显著优势,且不牺牲机密性。

问题
第三方云与边缘数据中心中的数据分析面临机密性挑战;现有软件(同态加密)与硬件(SGX、SEV)机制在安全属性、性能、可用性和使用方式上差异巨大,程序员难以判断并正确选用合适机制。
方法
设计机制无关的核心编程语言:用格结构自定义机密性标签标注数据,用新型可表达安全策略定义标签与机制的映射,并以推广的非干扰类型系统保证机密性;再将安全无关子集查询自动转换为完整语言,以高效且可组合的方式调用机制。
评估
在 Apache Spark 上实现原型,与单一硬编码机制(含现有系统)对比,验证其通用性和性能优势,同时保持端到端机密性。
原文摘要(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.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot1934,
  title = {Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation},
  author = {Shamiek Mangipudi and Pavel Chuprikov and Patrick Eugster and Malte Viering and Savvas Savvides},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {7},
  number = {PLDI},
  year = {2023},
  doi = {10.1145/3591231}
}