ε-Strong Privacy Preserving Multiagent Planner by Computational Tractability

Jan Tožička, Antonín Komenda, Michal Štolba

Abstract

Classical planning can solve large and real-world problems, even when multiple entities, such as robots, trucks or companies, are concerned. But when the interested parties, such as cooperating companies, are interested in maintaining their privacy while planning, classical planning cannot be used. Although, privacy is one of the crucial aspects of multi-agent planning, studies of privacy are underepresented in the literature. A strong privacy property, necessary to leak no information at all, has not been achieved by any planner in general yet. In this contribution, we propose a multiagent planner which can get arbitrarily close to the general strong privacy preserving planner for the price of decreased planning efficiency. The strong privacy assurances are under computational tractability assumptions commonly used in secure computation research.

References

  1. Ben-Or, M., Goldwasser, S., and Wigderson, A. (1988). Completeness theorems for non-cryptographic faulttolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 7888, pages 1-10, New York, NY, USA. ACM.
  2. Brafman, R. I. (2015). A privacy preserving algorithm for multi-agent planning and search. In Yang, Q. and Wooldridge, M., editors, Proceedings of the TwentyFourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 1530-1536. AAAI Press.
  3. Brafman, R. I. and Domshlak, C. (2008). From one to many: Planning for loosely coupled multi-agent systems. In Procs. of the ICAPS'08, pages 28-35.
  4. Diffie, W. and Hellman, M. (1976). New directions in cryptography. IEEE Trans. Inf. Theor., 22(6):644-654.
  5. Guanciale, R., Gurov, D., and Laud, P. (2014). Private intersection of regular languages. In Miri, A., Hengartner, U., Huang, N., Jøsang, A., and Garc ía-Alfaro, J., editors, 2014 Twelfth Annual International Conference on Privacy, Security and Trust, Toronto, ON, Canada, July 23-24, 2014, pages 112-120. IEEE.
  6. Jarecki, S. and Liu, X. (2010). Fast secure computation of set intersection. In Garay, J. A. and Prisco, R. D., editors, Security and Cryptography for Networks, 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings, volume 6280 of Lecture Notes in Computer Science, pages 418-435. Springer.
  7. Maliah, S., Shani, G., and Brafman, R. (2016a). Online macro generation for privacy preserving planning. In Proceedings of the 26th International Conference on Automated Planning and Scheduling, ICAPS'16.
  8. Maliah, S., Shani, G., and Stern, R. (2016b). Collaborative privacy preserving multi-agent planning. Procs. of the AAMAS'16, pages 1-38.
  9. Nissim, R. and Brafman, R. I. (2014). Distributed heuristic forward search for multi-agent planning. JAIR, 51:293-332.
  10. Pinkas, B., Schneider, T., Segev, G., and Zohner, M. (2015). Phasing: Private set intersection using permutationbased hashing. In 24th USENIX Security Symposium (USENIX Security 15), pages 515-530, Washington, D.C. USENIX Association.
  11. Stolba, M., Tozicka, J., and Komenda, A. (2016). Secure multi-agent planning algorithms. In ECAI 2016, pages 1714-1715.
  12. Torren˜o, A., Onaindia, E., and Sapena, O. (2014). FMAP: distributed cooperative multi-agent planning. AI, 41(2):606-626.
  13. Toz?ic?ka, J., Jakubu°v, J., Komenda, A., and Pe?chouc?ek, M. (2015). Privacy-concerned multiagent planning. KAIS, pages 1-38.
  14. Van Der Krogt, R. (2009). Quantifying privacy in multiagent planning. Multiagent and Grid Systems, 5(4):451-469.
  15. Yao, A. C. (1982). Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS 7882, pages 160- 164, Washington, DC, USA. IEEE Computer Society.
  16. Yao, A. C.-C. (1986). How to generate and exchange secrets. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS 7886, pages 162-167, Washington, DC, USA. IEEE Computer Society.
Download


Paper Citation


in Harvard Style

Tožička J., Komenda A. and Štolba M. (2017). ε-Strong Privacy Preserving Multiagent Planner by Computational Tractability . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-219-6, pages 51-57. DOI: 10.5220/0006176400510057


in Bibtex Style

@conference{icaart17,
author={Jan Tožička and Antonín Komenda and Michal Štolba},
title={ε-Strong Privacy Preserving Multiagent Planner by Computational Tractability},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2017},
pages={51-57},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006176400510057},
isbn={978-989-758-219-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - ε-Strong Privacy Preserving Multiagent Planner by Computational Tractability
SN - 978-989-758-219-6
AU - Tožička J.
AU - Komenda A.
AU - Štolba M.
PY - 2017
SP - 51
EP - 57
DO - 10.5220/0006176400510057