<div dir="ltr"><div>The<a href="http://bostoncryptoday.wordpress.com/" target="_blank"> Charles River Crypto Day</a> is back! We now plan to make it a regular event held about once every two months in the Boston/Cambridge area.<br></div><br>Please join us on <b>Friday, October 24 at MIT for </b>the first crypto day of 2014-2015.<br><br>Location: <a href="https://www.google.com/maps/place/Ray+and+Maria+Stata+Center,+Massachusetts+Institute+of+Technology,+Cambridge,+MA+02142/@42.3616384,-71.0906687,17z/data=!3m1!4b1!4m2!3m1!1s0x89e370a95d3025a9:0xb1de557289ff6bbe" target="_blank">MIT Stata Center </a>Building 32 Gates Tower, 8th floor Room G-882 (Hewlett).<br><br><div>The program and abstracts can be found below.<br><br>Hope to see you there!<br><br>Daniel, Nir,  Vinod<br><br><br>p.s.: if someone forwarded to you this email, and you would like to join the mailing list for future announcements send an email to <a href="mailto:charles-river-crypto-day+subscribe@googlegroups.com" target="_blank">charles-river-crypto-day+subscribe@googlegroups.com</a><div><span><br></span></div><div><span><br><h3 dir="ltr" style="line-height:1.5;margin-top:8pt;margin-bottom:15pt"><span style="font-size:17px;font-family:Georgia;color:rgb(0,0,0);font-weight:normal;vertical-align:baseline;white-space:pre-wrap">Program:</span></h3><div dir="ltr" style="margin-left:0pt"><table style="border:none;border-collapse:collapse"><colgroup><col width="151"><col width="473"></colgroup><tbody><tr style="height:0px"><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">9:00 – 9:30.</span></p></td><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">Introduction/Coffee</span></p></td></tr><tr style="height:0px"><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">9:30 – 10:30.</span></p></td><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">Ron Rivest, MIT</span></p><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);font-weight:bold;vertical-align:baseline;white-space:pre-wrap">TBD</span></p></td></tr><tr style="height:0px"><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">11:00 – 12:00.</span></p></td><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">Allison Bishop Lewko, Columbia</span></p><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);font-weight:bold;vertical-align:baseline;white-space:pre-wrap">Witness Encryption and Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption</span></p></td></tr><tr style="height:0px"><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">12:00 – 2:00.</span></p></td><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">Lunch (provided)</span></p></td></tr><tr style="height:0px"><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">2:00 – 3:00.</span></p></td><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0);border-width:1px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">Alessandro Chiesa, ETH Zurich</span></p><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);font-weight:bold;vertical-align:baseline;white-space:pre-wrap">Scalable Zero Knowledge via Cycles of Elliptic Curves</span></p></td></tr><tr style="height:0px"><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0) rgb(0,0,0);border-width:1px 0px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">3:30 – 4:30.</span></p></td><td style="border-style:solid;border-color:rgb(231,231,231) rgb(0,0,0) rgb(0,0,0);border-width:1px 0px 0px;vertical-align:middle;padding:7px 24px"><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);vertical-align:baseline;white-space:pre-wrap">Alon Rosen, IDC Herzlia</span></p><p dir="ltr" style="line-height:1.5;margin-top:0pt;margin-bottom:18pt"><span style="font-size:16px;font-family:Georgia;color:rgb(51,51,51);font-weight:bold;vertical-align:baseline;white-space:pre-wrap">An Algebraic Approach to Non-Malleability</span></p></td></tr></tbody></table></div><div><span><br></span></div><div><span><br></span></div>Abstracts:<br><br>________________________________<br><br>Speaker: Ron Rivest (MIT)<br><br>Title/Abstract: TBD<br><br>________________________________<br><br>Speaker: Allison Bishop Lewko (Cloumbia U)<br><br>Title: Witness encryption and indistinguishability obfuscation from the multilinear subgroup elimination assumption<br><br>Abstract:<br><br>We present constructions of witness encryption and indistinguishability obfuscation along with security reductions to the multilinear subgroup elimination assumption. This assumption is a natural multilinear extension of the subgroup decision assumptions used in bilineargroups. This talk is based on joint works with Gentry and Waters and with Gentry, Sahai and Waters.<br><br>________________________________<br><br>Speaker: Alessandro Chiesa (ETH Zurich)<br><br>Title: Scalable Zero Knowledge via Cycles of Elliptic Curves<br><br>Abstract: Non-interactive zero-knowledge proofs for general NP statements are a powerful cryptographic primitive. Recent work has achieved theoretical constructions and working implementations of zero-knowledge proofs that are short and easy to verify.<br><br>Alas, all prior implementations suffer from severe scalability limitations: the proving key’s size and the prover’s space complexity grow with the size of the computation being proved.<br><br>The bootstrapping technique of Bitansky et al. (STOC 2013), following Valiant (TCC 2008), offers an approach to scalability, by recursively composing proofs, but it has never been realized in practice, due to enormous computational cost.<br><br>In this work, by leveraging new elliptic-curve cryptographic techniques, we achieve the first practical implementation of recursive proof composition, and thereby achieve the first implementation of *scalable zero knowledge*.<br><br>Joint work with Eli Ben-Sasson, Eran Tromer, and Madars Virza.<br><br>________________________________<br><br>Speaker: Alon Rosen (IDC Herzliya)<br><br>Title: An Algebraic Approach to Non-Malleability<br><br>Abstract: I will present a new technique for constructing non-malleable protocols with only a single &quot;slot&quot;. Two direct byproducts of our ideas are a four round non-malleable commitment and a four round non-malleable zero-knowledge argument, the latter matching the round complexity of the best known zero-knowledge arguments (without the non-malleability requirement). The protocols are based on the existence of one-way functions and admit very efficient instantiations via standard homomorphic commitments and sigma protocols.<br><br>Our analysis relies on algebraic reasoning, and makes use of error correcting codes in order to ensure that committers&#39; tags differ in many coordinates.  One way of viewing our construction is as a method for combining many atomic sub-protocols in a way that simultaneously amplifies soundness and non-malleability, thus requiring much weaker guarantees to begin with, and resulting in a protocol which is much trimmer in complexity compared to the existing ones.<br><br>Joint work with Vipul Goyal, Silas Richelson and Margarita Vald.<div><span style="font-size:16px;font-family:Georgia;color:rgb(80,0,80);vertical-align:baseline;white-space:pre-wrap"><br></span></div></span></div></div></div>

<p></p>

-- <br />
You received this message because you are subscribed to the Google Groups &quot;Charles River Crypto Day&quot; group.<br />
To unsubscribe from this group and stop receiving emails from it, send an email to <a href="mailto:charles-river-crypto-day+unsubscribe@googlegroups.com">charles-river-crypto-day+unsubscribe@googlegroups.com</a>.<br />
To view this discussion on the web visit <a href="https://groups.google.com/d/msgid/charles-river-crypto-day/CAHpnE7acy%3DBBX1M9nftKFsbVAd0nK325tQ56%3D%3D4oYA9eYBRJQw%40mail.gmail.com?utm_medium=email&utm_source=footer">https://groups.google.com/d/msgid/charles-river-crypto-day/CAHpnE7acy%3DBBX1M9nftKFsbVAd0nK325tQ56%3D%3D4oYA9eYBRJQw%40mail.gmail.com</a>.<br />
For more options, visit <a href="https://groups.google.com/d/optout">https://groups.google.com/d/optout</a>.<br />