<div dir="ltr">All, this is today 4-5pm at <span style="color:rgb(0,0,0);font-family:verdana,sans-serif;font-size:12px">Patil/Kiva G449.  Looks like a really exciting result.</span><div><br></div><div><a href="http://toc.csail.mit.edu/node/1043">http://toc.csail.mit.edu/node/1043</a></div></div><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Nov 7, 2016 at 9:32 PM, Ran Canetti <span dir="ltr">&lt;<a href="mailto:canetti@bu.edu" target="_blank">canetti@bu.edu</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
  

    
  
  <div bgcolor="#FFFFFF" text="#000000">
    <p><br>
    </p>
    <div class="m_5191836847962673734moz-forward-container">FYI. Well worth attending!<br>
      <br>
      Ran<br>
      <div dir="ltr">
        <div><br>
          <div class="gmail_quote">---------- Forwarded message
            ----------<br>
            From: <b class="gmail_sendername">Vinod Vaikuntanathan</b>
            <span dir="ltr">&lt;<a href="mailto:vinodv@mit.edu" target="_blank">vinodv@mit.edu</a>&gt;</span><br>
            Date: Mon, Nov 7, 2016 at 10:18 AM<br>
            Subject: Yuval Ishai: TOC Colloquium tomorrow<br>
            To: <a href="mailto:toc-faculty@lists.csail.mit.edu" target="_blank">toc-faculty@lists.csail.mit.<wbr>edu</a>,
            Debbie Lehto &lt;<a href="mailto:dlehto@csail.mit.edu" target="_blank">dlehto@csail.mit.edu</a>&gt;<br>
            <br>
            <br>
            <div dir="ltr"><span style="font-size:12.8px">Hi all,</span><br style="font-size:12.8px">
              <br>
              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.) <br style="font-size:12.8px">
              <br>
              Yuval&#39;s work spans cryptography and complexity (e.g.
              locally decodable codes, communication complexity and
              private information retrieval).
              <div><br>
                <span style="font-size:12.8px">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.</span><br style="font-size:12.8px">
                <br style="font-size:12.8px">
                <span style="font-size:12.8px">Best,</span>
                <div><br style="font-size:12.8px">
                  <span style="font-size:12.8px">Vinod</span><br>
                  <div><span style="font-size:12.8px"><br>
                    </span></div>
                  <div><span style="font-size:12.8px"><br>
                    </span></div>
                  <div><span style="font-size:12.8px">==============================<wbr>==============================<wbr>========</span></div>
                  <div>
                    <h3>Yuval <span class="m_5191836847962673734m_5544693214606141737gmail-il">Ishai</span>:
                      Succinct Secure Computation from DDH</h3>
                    <p style="font-size:12.8px">Abstract:</p>
                    <p style="font-size:12.8px">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.</p>
                    <p style="font-size:12.8px">We present a new
                      technique for succinct secure computation that
                      replaces FHE by &#39;&#39;homomorphic secret sharing&#39;&#39; 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.</p>
                    <p style="font-size:12.8px">Our technique yields a
                      number of new DDH-based applications, including:</p>
                    <p style="font-size:12.8px">- 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.</p>
                    <p style="font-size:12.8px">- A secure 2-party
                      protocol for evaluating any leveled boolean
                      circuit of size S with communication complexity
                      O(S/logS).</p>
                    <p style="font-size:12.8px">- A secure k-party
                      protocol for evaluating general circuits using
                      only two rounds of interaction given a public-key
                      infrastructure.</p>
                    <p style="font-size:12.8px">Joint work with Elette
                      Boyle and Niv Gilboa</p>
                    <p style="font-size:12.8px"><br>
                    </p>
                  </div>
                </div>
              </div>
            </div>
          </div>
          <br>
        </div>
      </div>
    </div>
  </div>

<br>______________________________<wbr>_________________<br>
Busec mailing list<br>
<a href="mailto:Busec@cs.bu.edu">Busec@cs.bu.edu</a><br>
<a href="http://cs-mailman.bu.edu/mailman/listinfo/busec" rel="noreferrer" target="_blank">http://cs-mailman.bu.edu/<wbr>mailman/listinfo/busec</a><br>
<br></blockquote></div><br><br clear="all"><div><br></div>-- <br><div class="gmail_signature" data-smartmail="gmail_signature">Sharon Goldberg<br>Computer Science, Boston University<br><a href="http://www.cs.bu.edu/~goldbe" target="_blank">http://www.cs.bu.edu/~goldbe</a></div>
</div>