Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Mödersheim, Sebastian Alexander"'
Diss., Eidgenössische Technische Hochschule ETH Zürich, Nr. 17013, 2007.
Externí odkaz:
http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17013
Publikováno v:
Fernet, L P K & Mödersheim, S A 2021, Deciding a Fragment of (α, β)-Privacy . in Proceedings of 17 th International Workshop on Security and Trust Management . 17 th International Workshop on Security and Trust Management, Darmstadt, Hesse, Germany, 08/10/2021 .
We show how to automate fragments of the logical framework (α, β)-privacy which provides an alternative to bisimilarity-based and tracebased definitions of privacy goals for security protocols. We consider the so-called message-analysis problem, wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::a1587a0be9136e8025f5e27fc7ced135
https://orbit.dtu.dk/en/publications/6d74d2f5-f9c2-4d69-889b-ee4e1edba44d
https://orbit.dtu.dk/en/publications/6d74d2f5-f9c2-4d69-889b-ee4e1edba44d
Publikováno v:
Open Identity Summit 2020
Schlichtkrull, A & Mödersheim, S A 2020, Accountable Trust Decisions: A Semantic Approach . in H Roßnagel, C H Schunck, S A Mödersheim & D Hühnlein (eds), Open Identity Summit 2020 . Gesellschaft für Informatik e.V., Lecture Notes in Informatics, vol. P305, pp. 71-82, Open Identity Summit 2020, 26/05/2020 . https://doi.org/10.18420/ois2020_06
Schlichtkrull, A & Mödersheim, S A 2020, Accountable Trust Decisions: A Semantic Approach . in H Roßnagel, C H Schunck, S A Mödersheim & D Hühnlein (eds), Open Identity Summit 2020 . Gesellschaft für Informatik e.V., Lecture Notes in Informatics, vol. P305, pp. 71-82, Open Identity Summit 2020, 26/05/2020 . https://doi.org/10.18420/ois2020_06
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 happe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7290ca16714fb6b1c52b8d218fd94cc
Publikováno v:
Gondron, S P C & Mödersheim, S A 2019, Formalizing and Proving Privacy Properties of Voting Protocols Using Alpha-Beta Privacy . in Proceedings of 24th European Symposium on Research in Computer Security . Springer, Lecture Notes in Computer Science, vol. 11735, pp. 535-555, 24th European Symposium on Research in Computer Security, Luxembourg city, Luxembourg, 23/09/2019 . https://doi.org/10.1007/978-3-030-29959-0_26
Most common formulations of privacy-type properties for security protocols are specified as bisimilarity of processes in appliedπ calculus. For instance, voting privacy is specified as the bisimilarity between two processes that differ only by a swa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::819c24cec9cf3dda5d7502c7b5b333db
https://orbit.dtu.dk/en/publications/7cc638a7-2e7a-4c49-a69f-10198120c3b0
https://orbit.dtu.dk/en/publications/7cc638a7-2e7a-4c49-a69f-10198120c3b0
Publikováno v:
Mödersheim, S A & Ni, B 2019, GTPL : A graphical trust policy language . in H Rossnagel, S Wagner & D Huhnlein (eds), Proceedings of Open Identity Summit 2019 . Gesellschaft fur Informatik (GI), Lecture Notes in Informatics (LNI), Proceedings-Series of the Gesellschaft fur Informatik (GI), vol. P-293, pp. 107-118, Open Identity Summit 2019, Garmisch-Partenkirchen, Germany, 28/03/2019 .
We present GTPL, a Graphical Trust Policy Language, as an easy-to-use interface for the Trust Policy Language TPL proposed by the LIGHTest project. GTPL uses a simple graphical representation where the central graphical metaphor is to consider the in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::6c6f4db8bae08ecf72b1e3be90e021a2
https://orbit.dtu.dk/en/publications/04c83c26-dea1-4eee-a217-326bc784b13e
https://orbit.dtu.dk/en/publications/04c83c26-dea1-4eee-a217-326bc784b13e
Publikováno v:
Mödersheim, S A & Schlichtkrull, A 2018, The LIGHT est Foundation . DTU Compute Technical Report-2018, vol. 6, Technical University of Denmark .
This technical report presents the Trust Policy Language (TPL), its semantics, and shows how it can be used to specify policies for trust, trust translation, and delegation. TPL and its semantics are highly inspired by Prolog. The semantics come in t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::094428c76041a5d2f716e18d2a206d51
https://orbit.dtu.dk/en/publications/0ff92ef5-4a56-49d0-b73c-4ddb700b4cd2
https://orbit.dtu.dk/en/publications/0ff92ef5-4a56-49d0-b73c-4ddb700b4cd2
Publikováno v:
Hess, A V & Mödersheim, S A 2018, A Typing Result for Stateful Protocols-Extended Version . DTU Compute Technical Report-2018, vol. 4, DTU Compute .
There are several typing results that, for certain classes of protocols, show it is without loss of attacks to restrict the intruder to sending only well-typed messages. So far, all these typing results hold only for relatively simple protocols that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::5c82610712f8d883cc9b2a2b81c7cd02
https://orbit.dtu.dk/en/publications/58b6850b-fb81-4e9d-8e8c-c4bfd0c89f7c
https://orbit.dtu.dk/en/publications/58b6850b-fb81-4e9d-8e8c-c4bfd0c89f7c
Publikováno v:
Hess, A V, Mödersheim, S A & Brucker, A D 2018, Stateful Protocol Composition-Extended Version . DTU Compute Technical Report-2018, vol. 3, DTU Compute .
We prove a parallel compositionality result for protocols with a shared mutable state, i.e., stateful protocols. For protocols satisfying certain compositionality conditions our result shows that verifying the component protocols in isolation is su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::cddd5adc5afd63f27a4428a632b6f8dc
https://orbit.dtu.dk/en/publications/2f121f42-ab42-48b6-a68d-ee92538e0a27
https://orbit.dtu.dk/en/publications/2f121f42-ab42-48b6-a68d-ee92538e0a27
Publikováno v:
Mödersheim, S A & Bruni, A 2016, ' AIF-ω: Set-Based Protocol Abstraction with Countable Families ', Lecture Notes in Computer Science, vol. 9635, 12, pp. 233-253 . https://doi.org/10.1007/978-3-662-49635-0_12
ion based approaches like ProVerif are very efficient in protocol verification, but have a limitation in dealing with stateful protocols. A number of extensions have been proposed to allow for a limited amount of state information while not destroyin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2988::c3378e5f46abcde2796987bbac0f9fcc
https://pure.itu.dk/portal/da/publications/4f436fe2-0c8b-4adb-9127-3f5c00cf76ea
https://pure.itu.dk/portal/da/publications/4f436fe2-0c8b-4adb-9127-3f5c00cf76ea