The Effect of Policies for Selecting the Solution of a DisCSP on Privacy Loss

Authors:
Marius-Calin Silaghi;Vaibhav Rajeshirke
Affiliations:
Florida Institute of Technology;Florida Institute of Technology
Venue:
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Year:
2004

Citing 2
Cited 5

Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Incentive compatible open constraint optimization

Proceedings of the 4th ACM conference on Electronic commerce

Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP)

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Distributed Private Constraint Optimization

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Privacy-preserving linear programming

Proceedings of the 2009 ACM symposium on Applied Computing
Efficient distributed linear programming with limited disclosure

DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Secure and efficient distributed linear programming

Journal of Computer Security - DBSec 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed constraint satisfaction (distributed CSP) addresses the problem of assigning values to a set of variables, to satisfy the secret constraints of several participants. Many have argued so far about how to formalize the privacy requirements on input constraints. However, we notice that not sufficient attention was given to formalizing the description of what solution is desired. Different criteria of selecting a solution have strong consequences on an inherent privacy loss. We conclude proposing a way to minimize privacy loss by specifying expectations about how a solution has to be chosen among possible candidates.