arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.04565cs.CRcs.OS
收藏

Shai:以接近零的网络开销实施特定于数据的策略

Shai: Enforcing Data-Specific Policies with Near-Zero Runtime Overhead

Eslam Elnikety, Deepak Garg, Peter Druschel

摘要:

在线搜索引擎和在线社交网络等数据检索系统必须遵守个人和选择性共享数据项的隐私政策、有关数据保留和审查的监管政策以及提供商自己的数据使用政策。执行这些策略很困难,而且容易出错。强制执行策略的系统化技术要么局限于基于类型的策略,这些策略统一应用于同一类型的所有数据,要么会导致显著的运行时开销。本文介绍了Shai,这是第一个系统地执行数据特定策略的系统,在常见情况下开销接近零。Shai的关键思想是将尽可能多的策略检查推到离线的提前分析阶段,通常依赖于运行时参数的预测值,例如访问控制列表的状态或连接的用户的属性。拦截策略很少使用,仅用于验证这些预测并进行任何剩余的策略检查。我们的原型实现依赖于有效的,现代的操作系统原语的沙箱和隔离。我们提出了Shai的设计,并量化其开销的实验数据索引和搜索管道的基础上流行的搜索引擎Apache Lucene。

英文摘要:

Data retrieval systems such as online search engines and online social networks must comply with the privacy policies of personal and selectively shared data items, regulatory policies regarding data retention and censorship, and the provider's own policies regarding data use. Enforcing these policies is difficult and error-prone. Systematic techniques to enforce policies are either limited to type-based policies that apply uniformly to all data of the same type, or incur significant runtime overhead. This paper presents Shai, the first system that systematically enforces data-specific policies with near-zero overhead in the common case. Shai's key idea is to push as many policy checks as possible to an offline, ahead-of-time analysis phase, often relying on predicted values of runtime parameters such as the state of access control lists or connected users' attributes. Runtime interception is used sparingly, only to verify these predictions and to make any remaining policy checks. Our prototype implementation relies on efficient, modern OS primitives for sandboxing and isolation. We present the design of Shai and quantify its overheads on an experimental data indexing and search pipeline based on the popular search engine Apache Lucene.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑