Seminars
View all Seminars | Download ICal for this eventScalable Secure Multiparty Computation in Constant Rounds with RAM Support
Series: Department Seminar
Speaker: Varun Narayanan
Date/Time: Sep 29 15:00:00
Location: CSA Auditorium, (Room No. 104, Ground Floor)
Abstract:
Secure Multiparty Computation (MPC) is a fundamental
primitive in cryptography that enables mutually distrusting parties to
collaborate using their private data via a communication protocol,
eliminating the need for a trusted intermediary. A key obstacle to
deploying MPC in practice is that secure protocols are typically far
less efficient than their non-secure counterparts.
In this talk, I will present a recent result on achieving general MPC
with scalable communication, a constant number of rounds, and concrete
efficiency. Our construction builds on the work of Wang et al.
[WRK17], which uses multiparty garbling to achieve MPC for general
function computation with constant-round complexity and per-party
communication that scales with the complexity of the function and the
number of parties. To achieve scalability, we remove the dependence of
per-party communication on the number of parties while basing the
construction on minimal assumptions (oblivious transfer and the random
oracle), which helps us achieve concrete efficiency. The construction
is secure as long as an arbitrarily small fraction of parties are
guaranteed to be honest. I will describe the construction in WRK17, as
well as the modifications we make to the protocol to ensure
scalability.
Speaker Bio:
Varun Narayanan just completed postdoctoral research in the
Computer Science department at UCLA, hosted by Prof. Rafail Ostrovsky.
He previously held a postdoctoral position at Technion, working with
Prof. Yuval Ishai and Prof. Eyal Kushilevitz. He earned his PhD from
TIFR, Mumbai, advised by Dr. Vinod Prabhakaran. Varuns research
focuses on theoretical and practical aspects of cryptography, with an
emphasis on secure multiparty computation.
Host Faculty: Prof. Chaya Ganesh