[Busec] busec this week: Oxana Poburinnaya (Wed 9.30am)

Sharon Goldberg goldbe at cs.bu.edu
Tue Mar 3 16:54:34 EST 2015

Reminder for tomorrow's busec seminar by own Oxana Poburinnaya (Wed
9.30am). Abstract below.


BUsec Calendar:  http://www.bu.edu/cs/busec/
BUsec Mailing list: http://cs-mailman.bu.edu/mailman/listinfo/busec

The busec seminar gratefully acknowledges the support of BU's Center for
Reliable Information Systems and Cyber Security (RISCS).


Adaptively Secure Two-party Computation From Indistinguishability
Speaker: Oxana Poburinnaya. BU.
Wednesday, March 4, 2015. 9:30-11am
Hariri Seminar Room

A basic challenge in the area of secure distributed computation is to
achieve adaptive security, namely security against an adversary that can
adaptively decide whom to corrupt during the execution of the protocol.
Beyond providing better protection from realistic attacks than security
against an adversary that controls a fixed-in-advance set of parties,
adaptive security also provides strong resilience against leakage due to
side channel attacks. However, all known general function evaluation
protocols which provide full adaptive security have round complexity
proportional to the circuit depth of the function. This is the case even
with two-party protocols and even for honest-but-curious corruptions.

We present the first two-round, two-party general function evaluation
protocol that is secure against honest-but-curious adaptive corruption of
both parties. In addition, the protocol is incoercible for one of the
parties, and fully leakage tolerant. It requires a global
(non-programmable) reference string and is based on one way functions and
general-purpose indistinguishability obfuscation with sub-exponential
security, as well as augmented non-committing encryption. A Byzantine
version of the protocol, obtained by applying the CLOS compiler, achieves
UC security with comparable efficiency parameters, but is no longer
incoercible. The protocol uses Yao's garbled circuits and the Sahai-Waters
puncturable deterministic encryption which allows embedding hidden triggers
in a random-looking string.

This is joint work with Ran Canetti and Shafi Goldwasser.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs-mailman.bu.edu/pipermail/busec/attachments/20150303/daa7aa9f/attachment.html>

More information about the Busec mailing list