Quantifying privacy leakage in multi-agent planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00319234" target="_blank" >RIV/68407700:21230/18:00319234 - isvavai.cz</a>
Result on the web
<a href="https://dl.acm.org/citation.cfm?id=3133326" target="_blank" >https://dl.acm.org/citation.cfm?id=3133326</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3133326" target="_blank" >10.1145/3133326</a>
Alternative languages
Result language
angličtina
Original language name
Quantifying privacy leakage in multi-agent planning
Original language description
Multi-agent planning using MA-STRIPS-related models is often motivated by the preservation of private information. Such a motivation is not only natural for multi-agent systems but also is one of the main reasons multi-agent planning problems cannot be solved with a centralized approach. Although the motivation is common in the literature, the formal treatment of privacy is often missing. In this article, we expand on a privacy measure based on information leakage introduced in previous work, where the leaked information is measured in terms of transition systems represented by the public part of the problem with regard to the information obtained during the planning process. Moreover, we present a general approach to computing privacy leakage of search-based multi-agent planners by utilizing search-tree reconstruction and classification of leaked superfluous information about the applicability of actions. Finally, we present an analysis of the privacy leakage of two well-known algorithms-multi-agent forward search (MAFS) and Secure-MAFS- both in general and on a particular example. The results of the analysis show that Secure-MAFS leaks less information than MAFS.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20201 - Electrical and electronic engineering
Result continuities
Project
<a href="/en/project/GJ15-20433Y" target="_blank" >GJ15-20433Y: Heuristic Search for Multiagent and Factored Planning</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ACM Transactions on Internet Technology
ISSN
1533-5399
e-ISSN
1557-6051
Volume of the periodical
18
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
21
Pages from-to
—
UT code for WoS article
000433486600003
EID of the result in the Scopus database
2-s2.0-85041702754