Show simple item record

dc.contributor.authorSilaghi, Marius Cӑlin
dc.date.accessioned2013-11-07T17:24:57Z
dc.date.available2013-11-07T17:24:57Z
dc.date.issued2004-07-05
dc.identifier.citationSilaghi, M.C. (2004). A suite of secure multi-party computation algorithms for solving distributed constraint satisfaction and optimization problems (CS-2004-04). Melbourne, FL. Florida Institute of Technology.en_US
dc.identifier.otherCS-2004-04
dc.identifier.urihttp://hdl.handle.net/11141/145
dc.description.abstractPrivacy requirements can be modeled within the distributed constraint satisfaction framework, where the constraints are secrets of the participants. In [20] we introduced a first technique allowing agents to solve distributed constraint problems (DisCSPs), without revealing anything and without trusting each other or some server. The first technique we propose now, MPC-DisCSP2, is a dm times improvement for m variables of domain size d. A second technique we propose, MPC-DisCSP3, has a similar complexity as MPD-DisCSP2, a little slower in the worst case, but guarantees that the returned solutions are picked according to a uniform distribution over the total set of solutions. A third technique, MPC-DisCSP0, is based solely on secure arithmetic circuit evaluation and the distribution for picking its solutions can be manipulated in a more flexible way. Nevertheless this last technique has a O(d **m factorial times d **m) complexity. All techniques of [20] can be extended to solve optimization for distributed weighted CSPs.en_US
dc.language.isoen_USen_US
dc.rightsCopyright held by author.en_US
dc.titleA suite of secure multi-party computation algorithms for solving distributed constraint satisfaction and optimization problemsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record