Secure distributed constraint satisfaction: Reaching agreement without revealing private information

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

Volumn 2470, Issue , 2002, Pages 387-401

  Yokoo, Makoto ^a   Suzuki, Koutarou ^b   Hirayama, Katsutoshi ^c  

^a NTT Communication Science Laboratories   (Japan)

^b NTT CORPORATION   (Japan)

^c KOBE UNIVERSITY OF MERCANTILE MARINE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; MULTI AGENT SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SOFTWARE AGENTS;

DISTRIBUTED CONSTRAINT SATISFACTION; DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM; ENCRYPTED INFORMATIONS; MULTIPLE AGENTS; MULTIPLE SERVERS; PRIVATE INFORMATION; PUBLIC-KEY ENCRYPTION; VALUE ASSIGNMENT;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957005324     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_26     Document Type: Conference Paper

References (16)

1. Ben-Or, M., Goldwasser, S., and Wigderson, A.: Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation, Proceedings of 20th ACM Symposium on the Theory of Computing (1988) 1–10
2. ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, Vol. IT-31, No. 4, (1985) 469–472
3. Freuder, E. C., Minca, M., andWallace, R. J.: Privacy/Efficiency Tradeoffs in Distributed Meeting Scheduling by Constraint-based Agents, Proceedings of IJCAI- 01 Workshop on Distributed Constraint Reasoning (2001)
4. Goldreich, O., Micli, S., and Wigderson, A.: How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority, Proceedings of 19th ACM Symposium on the Theory of Computing (1987) 218–229
5. Hamadi, Y., Bessiére, C., and Quinqueton, J.: Backtracking in Distributed Constraint Networks, Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI-98) (1998) 219–223
6. Herlea, T., Claessens, J., Neven, G., Piessens, F., Preneel, B., and De Decker, B.: On Securely Scheduling a Meeting, Dupuy, M. and Paradinas, P. eds., Trusted Information - The New Decade Challenge, Proceedings of IFIP SEC (2001) 183– 198
7. Mesequer, P. and Jiménez, M. A.: Distributed Forward Checking, Proceedings of CP-00 Workshop on Distributed Constraint Satisfaction (2000)
8. Pedersen, T.: A Threshold Cryptosystem without a Trusted Party, Proceedings of EUROCRYPT’91 (1991) 522–526, Lecture Notes in Computer Science 547
9. Shamir, A.: How to share a secret, Communications of the ACM, Vol. 22, No. 11, (1979) 612–613
10. Silaghi, M.-C., Sam-Haroud, D., and Faltings, B. V.: Asynchronous Search with Aggregations, Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000) (2000) 917–922
11. Suyama, T., Yokoo, M., Sawada, H., and Nagoya, A.: Solving Satisfiability Problems using Reconfigurable Computing, IEEE Transactions on VLSI, Vol. 9, No. 1, (2001) 109–116
12. Suzuki, K. and Yokoo, M.: Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing, Proceedings of Sixth International Financial Cryptography Conference (FC-02) (2002)
13. Yokoo, M., Durfee, E. H., Ishida, T., and Kuwabara, K.: Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving, Proceedings of the Twelfth IEEE International Conference on Distributed Computing Systems (1992) 614–621
14. Yokoo, M., Durfee, E. H., Ishida, T., and Kuwabara, K.: The Distributed constraint satisfaction problem: formalization and algorithms, IEEE Transactions on Knowledge and Data Engineering, Vol. 10, No. 5, (1998) 673–685
15. Yokoo, M. and Hirayama, K.: Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems, Proceedings of the Second International Conference on Multi-Agent Systems, MIT Press (1996) 401–408
16. Yokoo, M. and Suzuki, K.: Secure Multi-agent Dynamic Programming based on Homomorphic Encryption and its Application to Combinatorial Auctions, Proceedings of the First International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2002) (2002): (to appear)