Model Checking of Qualitative Sensitivity Preferences to Minimize Credential Disclosure
Model Checking of Qualitative Sensitivity Preferences to Minimize Credential Disclosure
复制标题
定性敏感性偏好的模型检查以最大限度地减少凭证泄露
DOI：
10.1007/978-3-642-35861-6_13
复制
发表时间：
2012
影响因子：
2.4
通讯作者：
Vasant G Honavar
中科院分区：
文献类型：
--
作者：
Zachary J. Oster;Ganesh Ram Santhanam;Samik Basu;Vasant G Honavar
在Web上的大多数客户端-服务器交互中，服务器要求客户端在向客户端提供所请求的服务之前公开某些凭据（服务器策略）。另一方面，客户端希望最小化所公开的凭证集的敏感性（客户端偏好）。我们提出了一个定性的偏好形式主义的基础上的条件重要性网络（CI-网）表示和推理与客户端的偏好在相对敏感性的证书集。CI-网络偏好的语义是使用偏好图在表示偏好的凭证集合上描述的。我们开发了一种基于模型检查的方法来分析偏好图，有效地验证一组凭证是否比另一组更敏感（优势测试）。此外，我们确定了最不（最小）敏感的信息集，可能会被客户端披露，以获得所需的服务。我们提出了一种基于迭代验证和细化的偏好图计算一系列的凭证集的技术，确保具有较高灵敏度的凭证集永远不会返回之前，具有较低的灵敏度。我们提出了一个原型实现和初步的模拟结果。
In most client-server interactions over the Web, the server requires the client to disclose certain credentials before providing the client with the requested service (server policy). The client, on the other hand, wants to minimize the sensitivity of the set of credentials disclosed (client preference). We present a qualitative preference formalism based on conditional importance networks (CI-nets) for representing and reasoning with client preferences over the relative sensitivity of sets of credentials. The semantics of CI-net preferences is described using a preference graph over the set of credentials for which the preferences are expressed. We develop a model checking-based approach for analyzing the preference graph, efficiently verifying whether one set of credentials is more sensitive than another (dominance testing). Further, we identify the least (minimum) sensitive set of information that may be disclosed by the client to get access to the desired service. We present a technique based on iterative verification and refinement of the preference graph for computing a sequence of credential sets, ensuring that a credential set with higher sensitivity is never returned before one with lower sensitivity. We present a prototype implementation and preliminary simulation results.