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

18 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
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
CountryUnited States
CityIthaca
Period9/9/029/13/02

Fingerprint

Private Information
Constraint Satisfaction
Constraint satisfaction problems
Constraint Satisfaction Problem
Servers
Server
Privacy
Public Key Encryption
Backtracking
Cryptography
Assignment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yokoo, M., Suzuki, K., & Hirayama, K. (2002). Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In P. Van Hentenryck (Ed.), Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings (pp. 387-401). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2470). Springer Verlag.

Secure distributed constraint satisfaction : Reaching agreement without revealing private information. / Yokoo, Makoto; Suzuki, Koutarou; Hirayama, Katsutoshi.

Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings. ed. / Pascal Van Hentenryck. Springer Verlag, 2002. p. 387-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2470).

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

Yokoo, M, Suzuki, K & Hirayama, K 2002, Secure distributed constraint satisfaction: Reaching agreement without revealing private information. in P Van Hentenryck (ed.), Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2470, Springer Verlag, pp. 387-401, 8th International Conference on Principles and Practice of Constraint Programming, CP 2002, Ithaca, United States, 9/9/02.
Yokoo M, Suzuki K, Hirayama K. Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In Van Hentenryck P, editor, Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings. Springer Verlag. 2002. p. 387-401. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Yokoo, Makoto ; Suzuki, Koutarou ; Hirayama, Katsutoshi. / Secure distributed constraint satisfaction : Reaching agreement without revealing private information. Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings. editor / Pascal Van Hentenryck. Springer Verlag, 2002. pp. 387-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{10c737e6a64d4ea6b44e28c44ccc53af,
title = "Secure distributed constraint satisfaction: Reaching agreement without revealing private information",
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.",
author = "Makoto Yokoo and Koutarou Suzuki and Katsutoshi Hirayama",
year = "2002",
month = "1",
day = "1",
language = "English",
isbn = "3540441204",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "387--401",
editor = "{Van Hentenryck}, Pascal",
booktitle = "Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Secure distributed constraint satisfaction

T2 - Reaching agreement without revealing private information

AU - Yokoo, Makoto

AU - Suzuki, Koutarou

AU - Hirayama, Katsutoshi

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957005324&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957005324&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84957005324

SN - 3540441204

SN - 9783540441205

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 387

EP - 401

BT - Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings

A2 - Van Hentenryck, Pascal

PB - Springer Verlag

ER -