Privacy preserving solution of DCOPs by mediation

פרסום מחקרי: פרסום בכתב עתמאמרביקורת עמיתים

תקציר

In this study, we propose a new paradigm for solving DCOPs, whereby the agents delegate the computational task to a set of external mediators who perform the computations for them in an oblivious manner. That is, the mediators perfectly simulate the operation of the chosen DCOP algorithm, but without getting access to the problem inputs or to its outputs. Specifically, we propose MD-MAX-SUM, a mediated implementation of the MAX-SUM algorithm. MD-MAX-SUM offers topology, constraint, and decision privacy. Moreover, MD-MAX-SUM is collusion-secure, as long as the set of mediators has an honest majority. We evaluate the performance of MD-MAX-SUM on different benchmarks, problem sizes, and constraint densities. In particular, we compare its performance to PC-SYNCBB, the only privacy-preserving DCOP algorithm to date that is collusion-secure, and show the significant advantages of MD-MAX-SUM in terms of runtime. We conclude that MD-MAX-SUM can be used in practice for solving DCOPs when strong privacy guarantees are required. The main takeaway from this study is a demonstration of the power of mediated computing. It allows either a single party or a set of parties, who may have limited computational or communication resources, to delegate an intricate computation to external dedicated servers who can perform the computation for them in an oblivious manner that protects the privacy of the initiating parties.

שפה מקוריתאנגלית
מספר המאמר103916
כתב עתArtificial Intelligence
כרך319
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - יוני 2023

ASJC Scopus subject areas

  • ???subjectarea.asjc.1200.1203???
  • ???subjectarea.asjc.3300.3310???
  • ???subjectarea.asjc.1700.1702???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Privacy preserving solution of DCOPs by mediation'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי