STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A multi-agent model for the resource allocation problem: a reactive approach
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
Distributed asynchronous search with private constraints (extended abstract)
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Communications of the ACM
Solving satisfiability problems using reconfigurable computing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low power electronics and design
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Use of Elliptic Curves in Cryptography
CRYPTO '85 Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Asynchronous Search with Aggregations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On Securely Scheduling a Meeting
IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
Distributed Constraint Satisfaction Algorithm for Complex Local Problems
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Interleaved Backtracking in Distributed Constraint Networks
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure combinatorial auctions by dynamic programming with polynomial secret sharing
FC'02 Proceedings of the 6th international conference on Financial cryptography
Asynchronous Forward-checking for DisCSPs
Constraints
Unifying distributed constraint algorithms in a BDI negotiation framework
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Unifying distributed constraint algorithms in a BDI negotiation framework
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
| Hi-index | 0.00 |
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.