Specifying and verifying secrecy in workflows with arbitrarily many agents

Bernd Finkbeiner, Helmut Seidl, Christian Müller

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

Web-based workflow management systems, like EasyChair, HealthVault, Ebay, or Amazon, often deal with confidential information such as the identity of reviewers, health data, or credit card numbers. Because the number of participants in the workflow is in principle unbounded, it is difficult to describe the information flow policy of such systems in specification languages that are limited to a fixed number of agents. We introduce a first-order version of HyperLTL, which allows us to express information flow requirements in workflows with arbitrarily many agents. We present a bounded model checking technique that reduces the violation of the information flow policy to the satisfiability of a first-order formula. We furthermore identify conditions under which the resulting satisfiability problem is guaranteed to be decidable.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016, Proceedings
EditorsCyrille Artho, Doron Peled, Axel Legay
PublisherSpringer Verlag
Pages157-173
Number of pages17
ISBN (Print)9783319465197
DOIs
StatePublished - 2016
Event14th International Symposium on Automated Technology for Verification and Analysis, ATVA 2016 - Chiba, Japan
Duration: 17 Oct 201620 Oct 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9938 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Symposium on Automated Technology for Verification and Analysis, ATVA 2016
Country/TerritoryJapan
CityChiba
Period17/10/1620/10/16

Fingerprint

Dive into the research topics of 'Specifying and verifying secrecy in workflows with arbitrarily many agents'. Together they form a unique fingerprint.

Cite this