Solving secure distributed constraint satisfaction problems based on encrypted weighted-privacy

MaRDI QIDQ3611173zbMATH OpenFDO

Authors Qinhui Wang, Enhong Chen, Xufa Wang

Publication date 6 March 2009

zbMATH Keywords

encryptasynchronously backtrackdistributed constraintprivate secure

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Secure distributed constraint satisfaction: reaching agreement without revealing private information
• Distributed constraint satisfaction with partially known constraints
• P-syncBB: A privacy preserving branch and bound DCOP algorithm
• Privacy preserving implementation of the \textsc{Max-Sum} algorithm and its variants
• scientific article; zbMATH DE number 2084769

Cited in

(2)

• Secure distributed constraint satisfaction: reaching agreement without revealing private information
• Distributed constraint satisfaction with partially known constraints

This page was built for publication: Solving secure distributed constraint satisfaction problems based on encrypted weighted-privacy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611173)