{"id":2364,"date":"2019-03-14T15:15:43","date_gmt":"2019-03-14T19:15:43","guid":{"rendered":"https:\/\/www.bu.edu\/riscs\/?p=2364"},"modified":"2021-02-24T13:35:01","modified_gmt":"2021-02-24T18:35:01","slug":"2019-dimacs-workshop","status":"publish","type":"post","link":"https:\/\/www.bu.edu\/riscs\/2019\/03\/14\/2019-dimacs-workshop\/","title":{"rendered":"2019 DIMACS Workshop"},"content":{"rendered":"<h3>DIMACS\/MACS Workshop on Usable, Efficient, and Formally Verified Secure Computation<\/h3>\n<h5 class=\"bold\"><strong>March 14, 2019 \u2013 March 15, 2019<\/strong><\/h5>\n<div id=\"organizer-content\" class=\"location\">\n<p class=\"organizer-title bold\"><strong>Location:<br \/>\n<\/strong>Barrister\u2019s Hall \u2013 first floor<br \/>\nBoston University Law School<br \/>\n765 Commonwealth Avenue<br \/>\nBoston, MA 02215<\/p>\n<\/div>\n<p>Groundbreaking results from the 1980s showed the surprising result that any function can be securely computed by a group of participants in a distributed fashion such that each party learns its intended output and nothing more. These celebrated results were viewed as theoretical proofs of concept. Starting with the FairPlay system, however, a series of theoretical and practical advances in the field have supported the idea that secure computation can perhaps be as practical and ubiquitous as public key cryptography. Some of these advances involve new cryptographic techniques such as building secure computation from fully homomorphic encryption, oblivious RAM, and reusable rather than use-once garbled circuits.<\/p>\n<p>For more information:\u00a0<a href=\"https:\/\/www.bu.edu\/hic\/2019-dimacs-workshop\/\">https:\/\/www.bu.edu\/hic\/2019-dimacs-workshop\/<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>DIMACS\/MACS Workshop on Usable, Efficient, and Formally Verified Secure Computation March 14, 2019 \u2013 March 15, 2019 Location: Barrister\u2019s Hall \u2013 first floor Boston University Law School 765 Commonwealth Avenue Boston, MA 02215 Groundbreaking results from the 1980s showed the surprising result that any function can be securely computed by a group of participants in [&hellip;]<\/p>\n","protected":false},"author":8550,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[3897,1],"tags":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/posts\/2364"}],"collection":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/users\/8550"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/comments?post=2364"}],"version-history":[{"count":3,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/posts\/2364\/revisions"}],"predecessor-version":[{"id":2367,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/posts\/2364\/revisions\/2367"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/media?parent=2364"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/categories?post=2364"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/tags?post=2364"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}