arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.04560cs.PLcs.CR
收藏

松弛不干涉的势型

Existential Types for Relaxed Noninterference

Raimil Cruz, Éric Tanter

摘要:

信息流安全类型系统通过强制非干扰来确保机密性:程序不能将私有数据泄露到公共信道。然而,在实践中,程序需要有选择地解密有关私有数据的信息。有几种方法提供了一个宽松的不干涉的概念,支持选择性和表达性解密,同时保留正式的安全属性。标签作为功能的方法提供了宽松的不干涉的方式表示为功能的解密政策。标签作为类型的方法使用类型抽象和分面类型(一对表示值的秘密和公共方面的类型)来表达解密策略。标签作为类型的最初建议是在面向对象的环境中制定的,其中类型抽象是通过子类型实现的。然而,面向对象的方法由于其以接收者为中心的范例而受到限制。在这项工作中,我们考虑一种替代方法,标签作为类型,适用于非面向对象的语言,这使我们能够表达先进的解密政策,如外部政策,基于不同形式的类型抽象:存在类型。存在类型公开抽象类型和对这些类型的操作;我们利用这种抽象机制来表达可以使用所提供的操作解密的秘密。我们形式化的方法,在一个核心功能演算与存在类型,定义存在松弛不干涉,并证明良好类型的程序满足这种形式的基于类型的松弛不干涉。

英文摘要:

Information-flow security type systems ensure confidentiality by enforcing noninterference: a program cannot leak private data to public channels. However, in practice, programs need to selectively declassify information about private data. Several approaches have provided a notion of relaxed noninterference supporting selective and expressive declassification while retaining a formal security property. The labels-as-functions approach provides relaxed noninterference by means of declassification policies expressed as functions. The labels-as-types approach expresses declassification policies using type abstraction and faceted types, a pair of types representing the secret and public facets of values. The original proposal of labels-as-types is formulated in an object-oriented setting where type abstraction is realized by subtyping. The object-oriented approach however suffers from limitations due to its receiver-centric paradigm. In this work, we consider an alternative approach to labels-as-types, applicable in non-object-oriented languages, which allows us to express advanced declassification policies, such as extrinsic policies, based on a different form of type abstraction: existential types. An existential type exposes abstract types and operations on these; we leverage this abstraction mechanism to express secrets that can be declassified using the provided operations. We formalize the approach in a core functional calculus with existential types, define existential relaxed noninterference, and prove that well-typed programs satisfy this form of type-based relaxed noninterference.

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

↑