All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Secure 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%2F16%3A00302397" target="_blank" >RIV/68407700:21230/16:00302397 - isvavai.cz</a>

  • Result on the web

    <a href="https://dl.acm.org/citation.cfm?doid=2970030.2970042" target="_blank" >https://dl.acm.org/citation.cfm?doid=2970030.2970042</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2970030.2970042" target="_blank" >10.1145/2970030.2970042</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Secure Multi-Agent Planning

  • Original language description

    Multi-agent planning using MA-STRIPS-related models is often motivated by the preservation of private information. Such motivation is not only natural for multi-agent systems, but is one of the main reasons, why multi-agent planning problems cannot be solved centrally. Although the motivation is common in the literature, formal treatment of privacy is mostly missing. An exception is a definition of two extreme concepts, weak and strong privacy. In this paper, we first analyze privacy leakage in the terms of secure Multi-Party Computation and Quantitative Information Flow. Then, we follow by analyzing privacy leakage of the most common MAP paradigms. Finally, we propose a new theoretical class of secure MAP algorithms and show how the existing techniques can be modified in order to fall in the proposed class.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GJ15-20433Y" target="_blank" >GJ15-20433Y: Heuristic Search for Multiagent and Factored Planning</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • 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

  • Article name in the collection

    Proceedings of the 1st International Workshop on AI for Privacy and Security

  • ISBN

    978-1-4503-4304-6

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

  • Publisher name

    ACM

  • Place of publication

    New York

  • Event location

    Hague

  • Event date

    Aug 29, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article