Contributions

The first secure solver for meeting-scheduling (and general DisCSPs) was implemented and is deployed on WWW.
Proves that the slowest secure multiparty algorithm (MPC-DisCSP1) is sufficiently efficient to solve quite large meeting scheduling problems: http://www.cs.fit.edu/~msilaghi/secure/
Measured time: 1 second/participant/tuple/mixnet (tuple = meeting place alternative). e.g. 10 participant, 10 places, 2 mixnets => 3 minutes.
Main cost: public key operations in mixnets. =>faster computer/language brings improvements.

The first secure solver for meeting-scheduling (and general DisCSPs) was implemented and is deployed on WWW.