skip to main content
10.1145/2970030.2970042acmotherconferencesArticle/Chapter ViewAbstractPublication PagespraiseConference Proceedingsconference-collections
research-article

Secure Multi-Agent Planning

Authors Info & Claims
Published:29 August 2016Publication History

ABSTRACT

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.

References

  1. R. I. Brafman. A privacy preserving algorithm for multi-agent planning and search. In Procs. of the IJCAI'15, pages 1530--1536, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. I. Brafman and C. Domshlak. From one to many: Planning for loosely coupled multi-agent systems. In Procs. of the ICAPS'08, pages 28--35, 2008.Google ScholarGoogle Scholar
  3. C. Braun, K. Chatzikokolakis, and C. Palamidessi. Quantitative notions of leakage for one-try attacks. Electr. Notes Theor. Comput. Sci., 249:75--91, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. Haslum and H. Geffner. Admissible heuristics for optimal planning. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, ICAPS, pages 140--149, 2000.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Maliah, G. Shani, and R. Stern. Collaborative privacy preserving multi-agent planning. Procs. of the AAMAS'16, pages 1--38, 2016.Google ScholarGoogle Scholar
  6. R. Nissim and R. I. Brafman. Distributed heuristic forward search for multi-agent planning. JAIR, 51:293--332, 2014. Google ScholarGoogle ScholarCross RefCross Ref
  7. G. Smith. On the foundations of quantitative information flow. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, FOSSACS, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS, pages 288--302, 2009.Google ScholarGoogle Scholar
  8. A. Torreño, E. Onaindia, and O. Sapena. FMAP: distributed cooperative multi-agent planning. AI, 41(2):606--626, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Tožička, J. Jakubův, K. Durkota, A. Komenda, and M. Pěchouček. Multiagent planning supported by plan diversity metrics and landmark actions. In Proceedings of the 6th International Conference on Agents and Artificial Intelligence, ICAART, volume 1, pages 178--189, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Tožička, J. Jakubův, A. Komenda, and M. Pěchouček. Privacy-concerned multiagent planning. KAIS, pages 1--38, 2015.Google ScholarGoogle Scholar
  11. R. Van Der Krogt. Quantifying privacy in multiagent planning. Multiagent and Grid Systems, 5(4):451--469, 2009. Google ScholarGoogle ScholarCross RefCross Ref
  12. A. C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS, pages 160--164, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    PrAISe '16: Proceedings of the 1st International Workshop on AI for Privacy and Security
    August 2016
    91 pages
    ISBN:9781450343046
    DOI:10.1145/2970030

    Copyright © 2016 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 29 August 2016

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader