Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Friday, July 06, 2012, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Daniel Tschudi

Complexity of Multi-Party Computations Secure Against General Adversaries

Multi-party computation allows players to securely compute a function of their inputs, even when certain players are malicious. Famous applications of MPC are the millionaire problem and e-voting. For practical use, we need MPC protocols with low communication complexity. We look at this problem in the case of general active adversaries and present approaches to design efficient protocols.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login