Secure distributed constraint satisfaction: Reaching agreement without revealing private information

Makoto Yokoo, Koutarou Suzuki, Katsutoshi Hirayama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

This paper develops a secure distributed Constraint Satisfaction algorithm. A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP 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. This algorithm does not leak any private information, i.e., neither agents nor servers can obtain any additional information on the value assignment of variables that belong to other agents.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings
EditorsPascal Van Hentenryck
PublisherSpringer Verlag
Pages387-401
Number of pages15
ISBN (Print)3540441204, 9783540441205
DOIs
Publication statusPublished - Jan 1 2002
Externally publishedYes
Event8th International Conference on Principles and Practice of Constraint Programming, CP 2002 - Ithaca, United States
Duration: Sep 9 2002Sep 13 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2470
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Conference on Principles and Practice of Constraint Programming, CP 2002
Country/TerritoryUnited States
CityIthaca
Period9/9/029/13/02

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Secure distributed constraint satisfaction: Reaching agreement without revealing private information'. Together they form a unique fingerprint.

Cite this