[Busec] Fwd: Fwd: Yuval Ishai: TOC Colloquium tomorrow

Sharon Goldberg goldbe at cs.bu.edu
Tue Nov 8 05:14:44 EST 2016


All, this is today 4-5pm at Patil/Kiva G449.  Looks like a really exciting
result.

http://toc.csail.mit.edu/node/1043

On Mon, Nov 7, 2016 at 9:32 PM, Ran Canetti <canetti at bu.edu> wrote:

>
> FYI. Well worth attending!
>
> Ran
>
> ---------- Forwarded message ----------
> From: Vinod Vaikuntanathan <vinodv at mit.edu>
> Date: Mon, Nov 7, 2016 at 10:18 AM
> Subject: Yuval Ishai: TOC Colloquium tomorrow
> To: toc-faculty at lists.csail.mit.edu, Debbie Lehto <dlehto at csail.mit.edu>
>
>
> Hi all,
>
> Our next colloquium speaker is Yuval Ishai from Technion. Yuval will talk
> about a breakthrough result which won the best paper award at Crypto 2016.
> (Abstract below.)
>
> Yuval's work spans cryptography and complexity (e.g. locally decodable
> codes, communication complexity and private information retrieval).
>
> Let me (and Debbie) know if you can join for dinner and/or want to meet
> with him. Yuval is visiting us tomorrow, Thursday and Friday.
>
> Best,
>
> Vinod
>
>
> ====================================================================
> Yuval Ishai: Succinct Secure Computation from DDH
>
> Abstract:
>
> Fully homomorphic encryption (FHE) is a powerful cryptographic tool that
> can be used to minimize the communication complexity of secure computation
> protocols. However, known FHE schemes rely on a relatively narrow set of
> assumptions and algebraic structures that are all related to lattices.
>
> We present a new technique for succinct secure computation that replaces
> FHE by ''homomorphic secret sharing'' and can be based on discrete-log-type
> assumptions. More concretely, under the Decisional Diffie-Hellman (DDH)
> assumption, we construct a 2-out-of-2 secret sharing scheme that supports a
> compact evaluation of branching programs on the shares.
>
> Our technique yields a number of new DDH-based applications, including:
>
> - A secure 2-party protocol for evaluating branching programs or NC1
> circuits, where the communication complexity is linear in the input and
> output size and only the time complexity grows with the branching program
> or circuit size.
>
> - A secure 2-party protocol for evaluating any leveled boolean circuit of
> size S with communication complexity O(S/logS).
>
> - A secure k-party protocol for evaluating general circuits using only two
> rounds of interaction given a public-key infrastructure.
>
> Joint work with Elette Boyle and Niv Gilboa
>
>
>
>
> _______________________________________________
> Busec mailing list
> Busec at cs.bu.edu
> http://cs-mailman.bu.edu/mailman/listinfo/busec
>
>


-- 
Sharon Goldberg
Computer Science, Boston University
http://www.cs.bu.edu/~goldbe
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs-mailman.bu.edu/pipermail/busec/attachments/20161108/ad00a45d/attachment.html>


More information about the Busec mailing list