Skip to main content
Springer Nature Link
Log in

Distributed Forward Checking May Lie for Privacy

  • Conference paper
Recent Advances in Constraints (CSCLP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4651))

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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Article  Google Scholar 

  2. Brito, I., Meseguer, P.: Distributed Forward Checking. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 801–806. Springer, Heidelberg (2003)

    Google Scholar 

  3. Brito, I., Meseguer, P.: Synchronous, Asynchronous and Hybrid algorithms for DisCSP. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, Springer, Heidelberg (2004)

    Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Chandy, K., Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. Computer Systems 3(2), 63–75 (1985)

    Article  Google Scholar 

  6. Haralick, R., Elliot, G.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–313 (1980)

    Article  Google Scholar 

  7. 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)

    Google Scholar 

  8. Meisels, A., Zivan, R.: Personal communication (2006)

    Google Scholar 

  9. Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Asynchronous Search with Aggregations. In: Proc. of the AAAI 2000, pp. 917–922 (2000)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Article  Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. Zivan, R., Meisels, A.: Asynchronous Backtracking for Asymmetric DisCSPs. In: IJCAI 2005 Workshop on Distributed Constraint Reasoning (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IIIA, Institut d’Investigació en Intel.ligència Artificial, CSIC, Consejo Superior de Investigaciones Científicas, Campus UAB, 08193 Bellaterra, Spain

    Ismel Brito & Pedro Meseguer

Authors
  1. Ismel Brito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Francisco Azevedo Pedro Barahona François Fages Francesca Rossi

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics