<html>
  <head>

    <meta http-equiv="content-type" content="text/html; charset=utf-8">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    <p><br>
    </p>
    <div class="moz-forward-container"><br>
      <div dir="ltr">
        <div>
          <div>
            <div class="gmail_quote">---------- Forwarded message
              ----------<br>
              From: <span dir="ltr">&lt;<a
                  href="mailto:calendar@csail.mit.edu"
                  moz-do-not-send="true">calendar@csail.mit.edu</a>&gt;</span><br>
              Date: Fri, Sep 15, 2017 at 12:01 AM<br>
              Subject: [Theory-seminars] TALK: Tuesday 09-19-2017 TOC
              Seminar: Identity-Based Encryption from the Diffie-Hellman
              Assumption by Sanjam Garg - Tuesday, September 19 at 4pm<br>
              To: <a href="mailto:theory-seminars@csail.mit.edu"
                moz-do-not-send="true">theory-seminars@csail.mit.edu</a>,
              <a href="mailto:seminars@csail.mit.edu"
                moz-do-not-send="true">seminars@csail.mit.edu</a><br>
              <br>
              <br>
              <h3> Identity-Based Encryption from the Diffie-Hellman
                Assumption</h3>
              <p><b>Seminar Series:</b> Theory of Computation (TOC) 2017</p>
              <p><b>Speaker:</b> Sanjam Garg</p>
              <p><b>Host:</b> Vinod Vaikuntanathan</p>
              <p><b>Host Affiliation:</b> MIT</p>
              <p><b>Date:</b> Tuesday, September 19, 2017</p>
              <p><b>Time:</b> 4:00 PM to 5:00 PM</p>
              <p><b>Refreshments Time:</b> 3:45 PM</p>
              <p><b>Location:</b> 32-G449</p>
              <p>Abstract: In this talk, I will describe a new
                construction of identity-based encryption based on the
                hardness of the (Computational) Diffie-Hellman Problem
                (without using groups with pairings). This construction
                achieves the standard notion of identity-based
                encryption as considered by Boneh and Franklin [CRYPTO
                2001]. The presented construction bypasses known
                impossibility results using garbled circuits that make a
                non-black-box use of the underlying cryptographic
                primitives.</p>
              <p>(Based on joint work with Nico Döttling)</p>
              <p>Relevant URL: </p>
              <p>For more information please contact: Nardos Abbay, <a
                  href="tel:%28617%29%20253-6054" value="+16172536054"
                  target="_blank" moz-do-not-send="true">617-253-6054</a>,
                <a href="mailto:nardos@mit.edu" target="_blank"
                  moz-do-not-send="true">nardos@mit.edu</a></p>
              <br>
              ______________________________<wbr>_________________<br>
              Theory-seminars mailing list<br>
              <a href="mailto:Theory-seminars@lists.csail.mit.edu"
                moz-do-not-send="true">Theory-seminars@lists.csail.<wbr>mit.edu</a><br>
              <a
                href="https://lists.csail.mit.edu/mailman/listinfo/theory-seminars"
                rel="noreferrer" target="_blank" moz-do-not-send="true">https://lists.csail.mit.edu/<wbr>mailman/listinfo/theory-<wbr>seminars</a><br>
              <br>
            </div>
            <br>
          </div>
        </div>
      </div>
    </div>
  </body>
</html>