back to main page
Privacy Guarantees through Distributed Constraint Satisfaction
Published in Proceedings of the 2008
IEEE/WIC/ACM
International
Conference
on
Web Intelligence and Intelligent Agent
Technology (WI-IAT 2008), 2008
Abstract
The reason for using distributed constraint satisfaction
algorithms
is often to allow agents to find a solution while revealing as
little
as possible about their variables and constraints. So far, most
algorithms for DisCSP do not guarantee privacy of this
information.
This paper describes some simple techniques that can be used with
DisCSP algorithms such as DPOP,
and
provide
sensible
privacy
guarantees
based
on
the distributed
solving process without sacrificing its efficiency.
full
text in PDF
@inproceedings{Faltings08a,
Address =
{Sydney, Australia},
Author =
{Boi
Faltings and Thomas L{\'e}aut{\'e} and Adrian Petcu},
Booktitle =
{Proceedings of the 2008 IEEE/WIC/ACM International Conference on
Intelligent Agent Technology (IAT'08)},
Month =
{December~9--12},
Pages =
{350--358},
Title =
{Privacy Guarantees through Distributed Constraint Satisfaction},
Url =
{http://thomas.leaute.name/main/privacy_dcsp_iat08.html},
Year =
{2008}
}