arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.11376cs.CR
收藏

信任与可信系统的建模:一个范畴论方法

Modelling Trust and Trusted Systems: A Category Theoretic Approach

University of Oulu(奥卢大学);National Defence University(国防大学)

Ian Oliver, Pekka Kuure

AI总结:

本文提出了一种基于范畴论的框架,用于建模可信计算系统中的信任,利用Heyting代数和指数运算来定义信任决策空间和认证操作的组合。

摘要:

我们介绍了一个范畴论框架,用于对可信计算系统和远程认证中的信任进行建模。通过将元素、声明、结果和决策作为范畴内的对象进行形式化,并将认证、验证和决策过程作为态射,该框架提供了一种严谨的方法来理解信任的建立,并为诸如'可信性'和'正当性/取证'等术语提供了明确的语义。信任决策空间通过Heyting代数进行形式化,允许超越二元可信/不可信状态的细致信任级别。我们随后介绍了额外的结构,特别是利用范畴论意义上的指数运算来定义认证操作的组合,并提供了一个衡量认证环境可表达性的基础。我们还展示了多个实例,包括启动-运行-关闭序列、Evil Maid攻击以及基于该模型的认证环境规范。最后,我们讨论了在建模动态和更大系统时所面临的挑战,这些系统由多个组合构成。

英文摘要:

We introduces a category-theoretic framework for modelling trust as applied to trusted computation systems and remote attestation. By formalizing elements, claims, results, and decisions as objects within a category, and the processes of attestation, verification, and decision-making as morphisms, the framework provides a rigorous approach to understanding trust establishment and provides a well-defined semantics for terms such as `trustworthiness' and 'justification'/forensics. The trust decision space is formalized using a Heyting Algebra, allowing nuanced trust levels that extend beyond binary trusted/untrusted states. We then present additional structures and in particular utilise exponentiation in a category theoretic sense to define compositions of attestation operations and provide the basis of a measurement for the expressibility of an attestation environment. We present a number of worked examples including boot-run-shutdown sequences, Evil Maid attacks and the specification of an attestation environment based upon this model. We then address challenges in modelling dynamic and larger systems made of multiple compositions.

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

↑