首页> 外文会议>Fundamental approaches to software engineering >Certification of Smart-Card Applications in Common Criteria: Proving Representation Correspondences
【24h】

Certification of Smart-Card Applications in Common Criteria: Proving Representation Correspondences

机译:通用标准中的智能卡应用程序认证:证明表示形式的对应关系

获取原文
获取原文并翻译 | 示例

摘要

We present a method for proving representation correspondences in the Common Criteria (CC) certification of smart-card applications. For security policy enforcement, the CC defines a chain of requirements: a security policy model (SPM), a functional specification (FSP), and a target-of-evaluation design (TDS). In our approach to the CC certification, these requirements are models of applications that can have different representations. A representation correspondence (RCR) describes a correlation between the representations of two adjacent requirements. One task in the CC certification is to demonstrate formal proofs of RCRs. We first develop a modelling framework by which the representations of SPM, FSP and TDS can be described uniformly as models of an application. We then define RCRs as mutual simulations between two application models over sets of observable events and variables. We describe a proof technique for proving RCRs and providing certificates about them based on assertions relating two models at specific locations. We show how RCRs can help us prove property preservation from the SPM to the FSP and the TDS.
机译:我们提出了一种方法来证明智能卡应用程序的通用标准(CC)认证中的表示形式对应关系。对于安全策略实施,CC定义了一系列需求:安全策略模型(SPM),功能规范(FSP)和评估目标设计(TDS)。在我们的CC认证方法中,这些要求是可以具有不同表示形式的应用程序模型。表示对应关系(RCR)描述了两个相邻需求的表示之间的相关性。 CC认证的一项任务是证明RCR的形式证明。我们首先开发一个建模框架,通过该框架可以将SPM,FSP和TDS的表示形式统一描述为应用程序的模型。然后,我们将RCR定义为两个应用程序模型之间对可观察事件和变量集的相互模拟。我们描述了一种证明技术,用于基于特定位置的两个模型的断言来证明RCR并为其提供证书。我们展示了RCR如何帮助我们证明从SPM到FSP和TDS的财产保护。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号