{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T03:48:06Z","timestamp":1763178486279},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_26","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"387-401","source":"Crossref","is-referenced-by-count":11,"title":["Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Yokoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koutarou","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsutoshi","family":"Hirayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"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\u201310","DOI":"10.1145\/62212.62213"},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"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\u2013472","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR3","unstructured":"Freuder, E. C., Minca, M., and Wallace, R. J.: Privacy\/Efficiency Tradeoffs in Distributed Meeting Scheduling by Constraint-based Agents, Proceedings of IJCAI-01 Workshop on Distributed Constraint Reasoning (2001)"},{"key":"26_CR4","unstructured":"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\u2013229"},{"key":"26_CR5","unstructured":"Hamadi, Y., Bessi\u00e8re, C., and Quinqueton, J.: Backtracking in Distributed Constraint Networks, Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI-98) (1998) 219\u2013223"},{"key":"26_CR6","unstructured":"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\u2013198"},{"key":"26_CR7","unstructured":"Mesequer, P. and Jim\u00e9nez, M. A.: Distributed Forward Checking, Proceedings of CP-00 Workshop on Distributed Constraint Satisfaction (2000)"},{"key":"26_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Proceedings of EUROCRYPT\u2019 91","author":"T. Pedersen","year":"1991","unstructured":"Pedersen, T.: A Threshold Cryptosystem without a Trusted Party, Proceedings of EUROCRYPT\u2019 91 (1991) 522\u2013526, Lecture Notes in Computer Science 547"},{"issue":"11","key":"26_CR9","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret, Communications of the ACM, Vol. 22, No. 11, (1979) 612\u2013613","journal-title":"Communications of the ACM"},{"key":"26_CR10","unstructured":"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\u2013922"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/92.920826","volume":"9","author":"T. Suyama","year":"2001","unstructured":"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\u2013116","journal-title":"IEEE Transactions on VLSI"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/3-540-36504-4_4"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013621","DOI":"10.1109\/ICDCS.1992.235101"},{"issue":"5","key":"26_CR14","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M. Yokoo","year":"1998","unstructured":"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\u2013685","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"26_CR15","unstructured":"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\u2013408"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"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 Multi-agent Systems (AAMAS-2002) (2002): (to appear)","DOI":"10.1145\/544741.544770"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:25:55Z","timestamp":1556411155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}