Publication

Privacy Guarantees through Distributed Constraint Satisfaction

Boi Faltings, Adrian Petcu, Thomas Léauté
2008
Conference Papers

Abstract

The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and constraints. So far, most algorithms for DisCSP do not guarantee privacy of this information. This paper describes some simple techniques that can be used with DisCSP algorithms such as DPOP, and provide sensible privacy guarantees based on the distributed solving process without sacrificing its efficiency.

Official source

https://infoscience.epfl.ch/entities/publication/469a5804-d757-4aa3-9f96-68732981aaf4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Privacy Guarantees through Distributed Constraint Satisfaction

Chat with Graph Search

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

The Privacy Power of Correlated Noise in Decentralized Learning

Differentially private multi-agent constraint optimization