Abstract
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value. With this strategy, plus the use of sequence numbers, some privacy level is achieved. In particular, each agent knows its value in the solution, but ignores the values of the others. However, the idea of sending the whole compatible domain each time an agent changes its value may cause a privacy loss on shared constraints that was initially overlooked. To solve this issue, we propose DisFC lies , an algorithm that works like DisFC but it may lie about the compatible domains of other agents. It requires a single extra condition: if an agent sends a lie, it has to tell the truth in finite time afterwards. We prove that the algorithm is sound, complete and terminates. We provide experimental results on the increment in privacy achieved, at the extra cost of more search.
Supported by the Spanish project TIN2005-09312-C03-01.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bessiere, C., Brito, I., Maestre, A., Meseguer, P.: The Asynchronous Backtracking without adding links: a new member in the ABT family. Artifical Intelligence 161, 1–2 (2005)
Brito, I., Meseguer, P.: Distributed Forward Checking. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 801–806. Springer, Heidelberg (2003)
Brito, I., Meseguer, P.: Synchronous, Asynchronous and Hybrid algorithms for DisCSP. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, Springer, Heidelberg (2004)
Brito, I., Meseguer, P.: Distributed Stable Matching Problems with Ties and Incomplete Lists. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 675–680. Springer, Heidelberg (2006)
Chandy, K., Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. Computer Systems 3(2), 63–75 (1985)
Haralick, R., Elliot, G.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–313 (1980)
Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing Performance of Distributed Constraint Processing Algorithms. In: AAMAS 2002 Workshop on Distributed Constraint Reasoning, pp. 86–93 (2002)
Meisels, A., Zivan, R.: Personal communication (2006)
Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Asynchronous Search with Aggregations. In: Proc. of the AAAI 2000, pp. 917–922 (2000)
Silaghi, M.C.: Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers. In: IJCAI 2003, Workshop on Distributed Constraint Reasoning (2003)
Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving. In: Proc. of the 12th DCS, pp. 614–621 (1992)
Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. Knowledge and Data Engineering 10, 673–685 (1998)
Yokoo, M., Suzuki, K., Hirayama, K.: Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 387–401. Springer, Heidelberg (2002)
Zivan, R., Meisels, A.: Asynchronous Backtracking for Asymmetric DisCSPs. In: IJCAI 2005 Workshop on Distributed Constraint Reasoning (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brito, I., Meseguer, P. (2007). Distributed Forward Checking May Lie for Privacy. In: Azevedo, F., Barahona, P., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2006. Lecture Notes in Computer Science(), vol 4651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73817-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-73817-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73816-9
Online ISBN: 978-3-540-73817-6
eBook Packages: Computer ScienceComputer Science (R0)