Usable and Efficient Secure Multiparty Computation

On January 7-8 a meeting between project partners was held in Tartu.

KTH is working on private language intersection. During the meeting alternative approaches to implement efficient state partitioning in sharemind were discussed. This enables the implementation of new automata minimization algorithms and their comparison with the existing proposal.

University of Athens' focused on providing technical Game Theory advice to other partners. More specifically, the routing framework and chain-production problem (worked on in KTH and Cybernetica respectively) were addressed.

Representatives of the University of Tartu consulted KTH to ensure that the usefulness of experts' feedback on prototype applications could be maximized and new domains of application unveiled. The statistics prototype application was also discussed. Finally, an agreement on a script for the demo presentation was reached.