Accountable Trust Decisions: A Semantic Approach

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

35 Downloads (Pure)


This paper is concerned with the question of how to obtain the highest possible assurance on trust policy decisions: when accepting an electronic transaction of substantial value or significant implications, we want to be sure that this did not happen because of a bug in a policy checker. Potential bugs include bugs in parsing documents, in signature checking, in checking trust lists, and in the logical evaluation of the policy. This paper focuses on the latter kind of problems and our idea
is to validate the logical steps of the trust decision by another, complementary method. We have implemented this for the Trust Policy Language of the LIGHTest project and we use the completely independently developed FOL theorem prover RPx as a complementary method.
Original languageEnglish
Title of host publicationOpen Identity Summit 2020
EditorsH. Roßnagel, C. H. Schunck, S. A. Mödersheim, D. Hühnlein
PublisherGesellschaft für Informatik e.V.
Publication date2020
ISBN (Print)978-3-88579-699-2
Publication statusPublished - 2020
Event Open Identity Summit 2020 - OID 2020 is publication only.
Duration: 26 May 202027 May 2020


Conference Open Identity Summit 2020
LocationOID 2020 is publication only.
Internet address
SeriesLecture Notes in Informatics


  • Trust policies
  • Accountability
  • Security
  • Logic
  • Theorem Prover
  • Isabelle
  • eIDAS

Fingerprint Dive into the research topics of 'Accountable Trust Decisions: A Semantic Approach'. Together they form a unique fingerprint.

Cite this