Abstract
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.
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 language | English |
---|---|
Title of host publication | Open Identity Summit 2020 |
Editors | H. Roßnagel, C. H. Schunck, S. A. Mödersheim, D. Hühnlein |
Publisher | Gesellschaft für Informatik e.V. |
Publication date | 2020 |
Pages | 71-82 |
ISBN (Print) | 978-3-88579-699-2 |
DOIs | |
Publication status | Published - 2020 |
Event | Open Identity Summit 2020 - OID 2020 is publication only. Duration: 26 May 2020 → 27 May 2020 https://oid2020.compute.dtu.dk/ |
Conference
Conference | Open Identity Summit 2020 |
---|---|
Location | OID 2020 is publication only. |
Period | 26/05/2020 → 27/05/2020 |
Internet address |
Series | Lecture Notes in Informatics |
---|---|
Volume | P305 |
ISSN | 1617-5468 |
Keywords
- Trust policies
- Accountability
- Security
- Logic
- Theorem Prover
- Isabelle
- eIDAS