Now showing items 1-4 of 4
A suite of secure multi-party computation algorithms for solving distributed constraint satisfaction and optimization problems
Privacy requirements can be modeled within the distributed constraint satisfaction framework, where the constraints are secrets of the participants. In  we introduced a first technique allowing agents to solve distributed ...
Improving arithmetic circuits for solving constraint satisfaction and optimization problems
In the recent years we have proposed a set of secure multiparty computations for solving distributed constraint satisfaction and optimization problems, with applications to areas like distributed scheduling, configurations, ...
Using a reply path and handshaking protocol to allow for incentives with mix-net servers
Sending a message to a destination anonymously so that the destination cannot figure out who the originator was, and ensuring that the message reaches the destination untampered with, can be a difficult problem. Chaum's ...
A faster technique for distributed constraint satisfaction and optimization with privacy enforcement
A problem that received recent attention is the development of negotiation/cooperation techniques for solving naturally distributed problems with privacy requirements. An important amount of research focused on those ...