کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9650049 | 658412 | 2005 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Secure distributed constraint satisfaction: reaching agreement without revealing private information
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Artificial Intelligence - Volume 161, Issues 1â2, January 2005, Pages 229-245
Journal: Artificial Intelligence - Volume 161, Issues 1â2, January 2005, Pages 229-245
نویسندگان
Makoto Yokoo, Koutarou Suzuki, Katsutoshi Hirayama,