Secure distributed CSP (DisCSP) solvers (patent), remotely-programmable, applet-based

The secure distributed CSP (DisCSP) solvers, a suite of remotely-programable secure multi-party computation solvers with applet-based interfaces for several problems:

Secure (Private) Meeting Scheduling Problem Solver
Secure (Private) Stable Marriages Problem Solver: (Note: Amit, the developer of the web version of stable marriages graduated and left FIT in Fall 2004 and the link is no longer maintained) therefore I recommend: (see the downloadable version implemented as homework by two of my students in April 2005)

For a line-command alternative check the SMC interpreter. The systems treat both Distributed CSPs, and Distributed Weighted CSPs (DisWCSPs) for optimization.

The techniques we use (FIT intellectual property) are described in:
"Distributed Constraint Satisfaction and Optimization with Privacy Enforcement", 3rd IC on Intelligence Agent Technology, 2004
"Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP)", 3rd IC on Web Intelligence, 2004
"The effect of policies for selecting the solution of a DisCSP on privacy loss", pp 1396-1397, AAMAS 2004
"Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers", IJCAI 2003 DCR, Acapulco, Mexico, 2003
"A suite of secure multi-party algorithms for solving DisCSPs", Florida Tech, TR:CS-2004-04, April 2004
"Incentive Auctions and Stable Marriages Problems Solved with n/2-Privacy of Human Preferences", Florida Tech, TR:CS-2004-11, July 2004