Show simple item record

dc.contributor.authorSchlichtkrull, Anders
dc.contributor.authorMödersheim, Sebastian
dc.contributor.editorRoßnagel, Heiko
dc.contributor.editorSchunck, Christian H.
dc.contributor.editorMödersheim, Sebastian
dc.contributor.editorHühnlein, Detlef
dc.date.accessioned2020-05-27T12:09:25Z
dc.date.available2020-05-27T12:09:25Z
dc.date.issued2020
dc.identifier.isbn978-3-88579-699-2
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/33183
dc.description.abstractThis 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 RP_X as a complementary method.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofOpen Identity Summit 2020
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-305
dc.subjectTrust policies
dc.subjectAccountability
dc.subjectSecurity
dc.subjectLogic
dc.subjectTheorem Prover
dc.subjectIsabelle
dc.subjecteIDAS
dc.titleAccountable Trust Decisions: A Semantic Approachen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages71-82
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationCopenhagen, Denmark
mci.conference.date26.-27. May 2020
dc.identifier.doi10.18420/ois2020_06


Files in this item

Thumbnail

Show simple item record