Secure distributed constraint satisfaction: reaching agreement without revealing private information

Ben-Or, 1988, Completeness theorems for non-cryptographic fault-tolerant distributed computation, 1 ElGamal, 1985, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory, IT-31, 469, 10.1109/TIT.1985.1057074 Freuder, 2001, Privacy/efficiency tradeoffs in distributed meeting scheduling by constraint-based agents Ghedira, 1992, A multi-agent model for the resource allocation problem: A reactive approach, 252 Goldreich, 1987, How to play any mental game or a completeness theorem for protocols with honest majority, 218 Goldwasser, 1984, Probabilistic encryption, J. Comput. System Sci., 28, 270, 10.1016/0022-0000(84)90070-9 Gordon, 1993, Discrete logarithms in GF(P) using the number field sieve, SIAM J. Discrete Math., 6, 124, 10.1137/0406010 Hamadi, 1998, Backtracking in distributed constraint networks, 219 Herlea, 2001, On securely scheduling a meeting, 183 Koblitz, 1987, Elliptic curve cryptosystems, Math. Comput., 48, 203, 10.1090/S0025-5718-1987-0866109-5 Menezes, 1996 Mesequer, 2000, Distributed forward checking Micali, 1991, Secure computation, vol. 576, 392 Miller, 1986, Use of elliptic curves in cryptography, 417 Paillier, 1999, Public-key cryptosystems based on composite degree residuosity classes, 223 Pedersen, 1991, A threshold cryptosystem without a trusted party, vol. 547, 522 Shamir, 1979, How to share a secret, Comm. ACM, 22, 612, 10.1145/359168.359176 M.-C. Silaghi, Asynchronously solving problems with privacy requirements, Ph.D. Thesis, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland, 2002 Silaghi, 2003, Solving a distributed csp with cryptographic multi-party computations, without revealing constraints and without involving trusted servers Silaghi, 2000, Asynchronous search with aggregations, 917 Silaghi, 2000, Asynchronous search with private constraints Stadler, 1996, Publicly verifiable secret sharing, vol. 1070, 190 Suyama, 2001, Solving satisfiability problems using reconfigurable computing, IEEE Trans. VLSI, 9, 109, 10.1109/92.920826 Suzuki, 2002, Secure combinatorial auctions by dynamic programming with polynomial secret sharing, vol. 2357, 44 Tsiounis, 1998, On the security of elgamal based encryption, 117 Yokoo, 2001 Yokoo, 1992, Distributed constraint satisfaction for formalizing distributed problem solving, 614 Yokoo, 1998, The distributed constraint satisfaction problem: formalization and algorithms, IEEE Trans. Knowledge Data Engrg., 10, 673, 10.1109/69.729707 Yokoo, 1996, Distributed breakout algorithm for solving distributed constraint satisfaction problems, 401 Yokoo, 2002, Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions, 112