The first Charles River Crypto Day will be held on\u00a0Friday, December 2, 2011,\u00a0from \u00a09:30 a.m. to 4 p.m at Boston University’s Rafik B. Hariri Institute for Computing and Computational Sciences Engineering, at 111 Cummington Street,\u00a0Boston, MA 02215. The event is free and open to the public.<\/p>\n
Sponsored and hosted by the Hariri Institute, this inaugural meeting of the Charles River Crypto Day will bring together academics and research scientists from local universities and research labs to discuss recent advances in cryptography. The Charles River Crypto Day series, which is open to the public, is meant to provide a recurring networking opportunity for faculty, postdocs, graduate students, and research scientists pursuing basic cryptography research in the Greater Boston Area.<\/p>\n
9:30-10:00 Gathering and breakfast<\/p>\n
10:00-11:00 Vinod Vaikuntanathan, University of Toronto 11:30-12:30 Rafael Pass, Cornell University 12:30-13:30 Lunch (provided)<\/p>\n 13:30-14:30 Tal Malkin, Columbia University 14:45-15:45 Guy Rothblum, Microsoft Research The event will take place at the Hariri Institute, located at the east end of the Computer Science building at BU (111 Cummington St., Boston, MA.) There is metered parking on Cummington St. as well as a public lot nearby at 665 Commonwealth Ave. (http:\/\/www.bu.edu\/maps\/?id=2307<\/a>).<\/p>\n Shafi Goldwasser (MIT), Yael Kalai (MSR), Ran Canetti (BU).<\/p>\n The organizers thank the\u00a0Rafik B. Hariri Institute for Computing and Computational Science & Engineering for making this event possible via generous financial and logistical support.<\/p>\n","protected":false},"excerpt":{"rendered":" The first Charles River Crypto Day will be held on\u00a0Friday, December 2, 2011,\u00a0from \u00a09:30 a.m. to 4 p.m at Boston University’s Rafik B. Hariri Institute for Computing and Computational Sciences Engineering, at 111 Cummington Street,\u00a0Boston, MA 02215. The event is free and open to the public. Sponsored and hosted by the Hariri Institute, this inaugural […]<\/p>\n","protected":false},"author":5410,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[11748,11969],"tags":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/posts\/864"}],"collection":[{"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/users\/5410"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/comments?post=864"}],"version-history":[{"count":14,"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/posts\/864\/revisions"}],"predecessor-version":[{"id":7638,"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/posts\/864\/revisions\/7638"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/media?parent=864"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/categories?post=864"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.bu.edu\/hic\/wp-json\/wp\/v2\/tags?post=864"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nComputing Blindfolded: New Developments in Fully Homomorphic Encryption <\/em><\/p>\n
\nThe randomness complexity of parallel repetition <\/em><\/p>\n
\nSecure Computation with Sub-linear Amortized Work <\/em><\/p>\n
\nHow to compute in the presence of leakage<\/em><\/p>\nLocation<\/h3>\n
Organizers<\/h3>\n