A Comparison of Distributed Constraint Satisfaction Techniques with respect to Privacy

@inproceedings{Silaghi2002ACO,
  title={A Comparison of Distributed Constraint Satisfaction Techniques with respect to Privacy},
  author={Marius-Calin Silaghi and Boi. Faltings},
  year={2002}
}
There is an increasing interest in distributed and asynchronous search algorithms for solving distributed constraint satisfaction problems (DisCSP). An important motivation for distributed problem solving is the agents’ ability to keep their constraints private. Cryptographic techniques [GB96] offer a certain protection from several types of attacks. However, when an attack succeeds, no agent can know how much privacy he has lost. We assume that agents enforce their privacy by dropping out of… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS
18 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Cryptographic protocols and interactive zero-knowledge proofs

  • Ueli Maurer
  • Invited Presentation at EPFL,
  • 2002

Discussion about research on cryptographic protocols for DisCSPs

  • Marius-Călin Silaghi, Makoto Yokoo
  • Private email-based discussion,
  • 2002

Polynomial-Space Asynchronous Search

  • Marius-Călin Silaghi
  • PhD thesis, Swiss Federal Institute of Technology…
  • 2002

Similar Papers

Loading similar papers…