Seminars & Colloquia
Department of Computer Science, University of Maryland
"Round-Efficient Secure Computation"
Thursday March 01, 2007 10:00 AM
Location: 3211, EB II NCSU Centennial Campus
(Visitor parking instructions)
This talk surveys recent work aimed at improving the round complexity of protocols for secure MPC:
- I show that Byzantine agreement with an honest majority is possible in an expected constant number of rounds, answering a question that has been open since 1987. As a by-product, this gives the first (expected) constant-round protocols for secure MPC.
- A useful design methodology is to design protocols under the assumption that a broadcast channel exists, and then emulate the broadcast channel using a Byzantine agreement sub-protocol. I show that secure MPC is possible using only a single round of broadcast. (This is optimal.) This gives MPC protocols whose round complexity substantially improves on existing work.
The speaker is a faculty candidate.
Host: Peng Ning, Computer Science