Secure distributed constraint satisfaction: Reaching agreement without revealing private information

29Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

This paper develops a secure distributed constraint satisfaction algorithm. A Distributed Constraint Satisfaction Problem (DisCSP) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. A major motivation for solving a DisCSP without gathering all information in one server is the concern about privacy/security. However, existing DisCSP algorithms leak some information during the search process, and privacy/security issues are not dealt with formally. Our newly developed algorithm utilizes a public key encryption scheme. In this algorithm, multiple servers, which receive encrypted information from agents, cooperatively perform a search process that is equivalent to a standard chronological backtracking algorithm. This algorithm does not leak any private information on the obtained solution, i.e., neither agents nor servers can obtain any additional information on the value assignment of variables that belong to other agents. © 2004 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Yokoo, M., Suzuki, K., & Hirayama, K. (2005). Secure distributed constraint satisfaction: Reaching agreement without revealing private information. Artificial Intelligence, 161(1–2), 229–245. https://doi.org/10.1016/j.artint.2004.10.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free