{"id":2385,"date":"2019-09-30T10:47:50","date_gmt":"2019-09-30T14:47:50","guid":{"rendered":"https:\/\/www.bu.edu\/riscs\/?page_id=2385"},"modified":"2020-03-06T11:24:25","modified_gmt":"2020-03-06T16:24:25","slug":"courses","status":"publish","type":"page","link":"https:\/\/www.bu.edu\/riscs\/courses\/","title":{"rendered":"Fall 2019: Law for Algorithms"},"content":{"rendered":"<div id=\"post-130\" class=\"spf-single post-130 page type-page status-publish hentry\">\n<div class=\"spiffy-page-content\">\n<p>A collaboration between Boston University and UC Berkeley for CS and law graduate students exploring how the use of algorithms and data might be understood, regulated and adjudicated by our legal system, with focus on machine learning and cryptographic algorithms.<\/p>\n<p><strong>Syllabus<\/strong><span>\u00a0<\/span>[<a href=\"https:\/\/docs.google.com\/document\/d\/e\/2PACX-1vTuiFeRgaCFiHS04PmPFNgh4BOSlW1_SBhNEtaxL5DSHzmFxNsWD0-_yffhnZn5y65QiUqnKuMOJZ4u\/pub\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]<\/p>\n<p><strong>Course Numbers<\/strong><br \/>\nBU: CS 791 \/ JD 673<br \/>\nUC Berkeley: CS 294<\/p>\n<p><strong>Instructors<\/strong><br \/>\nBU: Ran Canetti (CS), Stacey Dogan (Law), Aloni Cohen (CS &amp; Law)<br \/>\nUC Berkeley: Shafi Goldwasser (CS), Frank Partnoy (Law)<\/p>\n<p><strong>When<br \/>\n<\/strong>Thursdays, Sep 5 to Dec 5<br \/>\n1:30\u20133:20pm pacific (UC Berkeley),<br \/>\n4:20\u20136:20pm eastern (BU)<br \/>\n<em>UC Berkeley will hold an additional meeting on Thursday, Aug 29, 1:30-3:20pm pacific<\/em><\/p>\n<p><strong>Where<\/strong><br \/>\nBU: Law School, Room 204<br \/>\nUC Berkeley: Simons Institute, Room 116<\/p>\n<p><strong>Slides, Handouts, and Assignments<\/strong><span>\u00a0<\/span>[<a href=\"https:\/\/drive.google.com\/drive\/folders\/1Il2x8cx6s8iAuZPg3JnVyXKHlCQMEkTK?usp=sharing\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]<\/p>\n<p><strong>Office Hours<\/strong>:<br \/>\nAloni: Friday 9:00-10:30, Law 1404H.<\/p>\n<h4>Readings<\/h4>\n<p><em><span><strong>The syllabus linked above will always be more up-to-date than this page.<\/strong><\/span> If they are inconsistent, trust the syllabus. Additional resources are available in the syllabus.<br \/>\n<\/em><\/p>\n<p><strong>9\/12<\/strong><\/p>\n<ul>\n<li>All students: Frankle &amp; Ohm, Machine Learning [<a href=\"https:\/\/aloni.net\/wp-content\/uploads\/2019\/09\/Frankle-Ohm-Machine-Learning.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]. This is a chapter from a textbook, \u201cComputer Science for Lawyers\u201d. Skip Sections 18.2.3 and 18.3.2, and the red-highlighted material. Depending on background, CS students may find this material very familiar.<\/li>\n<li>CS students: Orin Kerr, How to Read a Legal Opinion [<a href=\"http:\/\/www.volokh.com\/files\/howtoreadv2.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]<\/li>\n<li>All students: State v. Loomis, 881 N.W.2d 749 (Wis. 2016) [<a href=\"https:\/\/aloni.net\/wp-content\/uploads\/2019\/09\/State-v-Loomis.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]. B<span class=\"c0\">egin reading on p. 752. Read paragraphs 1-101, and 123-29 (concurring opinion).<\/span><\/li>\n<li>All students: &#8220;COMPAS decision tree.txt&#8221; [<a href=\"https:\/\/aloni.net\/wp-content\/uploads\/2019\/09\/COMPAS-decision-tree.txt\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>] and &#8220;COMPAS decision tree.png&#8221; [<a href=\"https:\/\/aloni.net\/wp-content\/uploads\/2019\/09\/COMPAS-decision-tree.png\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>].<\/li>\n<\/ul>\n<p><strong>9\/19<\/strong><\/p>\n<ul>\n<li>All: Deborah Hellman, What is Discrimination? Plenary talk at FAT* 2018. [<a href=\"https:\/\/www.youtube.com\/watch?v=qomsX8ZvvIY\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]<\/li>\n<li>All: Barocas &amp; Selbst, Big Data&#8217;s Disparate Impact. Parts 1 and 2 (37 pages). [<a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=2477899\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]<\/li>\n<li>All: Kleinberg, Mullainathan, &amp; Raghavan, Inherent Trade-Offs in the Fair Determination of Risk Scores. Section 1 (8 pages). [<a href=\"https:\/\/arxiv.org\/pdf\/1609.05807.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]<\/li>\n<li><em>Additional Resources<\/em>: The original ProPublica COMPAS article: &#8220;Machine Bias&#8221; [<a href=\"https:\/\/www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>] and the sequel &#8220;Bias in Criminal Risk Scores Is Mathematically Inevitable, Researchers Say&#8221; [<a href=\"https:\/\/www.propublica.org\/article\/bias-in-criminal-risk-scores-is-mathematically-inevitable-researchers-say\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>].<\/li>\n<\/ul>\n<p><strong>9\/26<\/strong><\/p>\n<ul>\n<li class=\"c10\"><span class=\"c0\">All students: Daphne Keller, <\/span><span class=\"c13 c0\">Internet Platforms: Observations on Speech, Danger, and Money<\/span><span class=\"c0\"> (Hoover Institution Aegis Series Paper No. 1807), [<\/span><span class=\"c0 c4\"><a class=\"c17\" href=\"https:\/\/www.hoover.org\/sites\/default\/files\/research\/docs\/keller_webreadypdf_final.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>]<\/span> <span class=\"c6 c0\">(pp. 1-28).<\/span><\/li>\n<li class=\"c10\"><span class=\"c0\">All students: Ellen P. Goodman &amp; Ryan Whittington, <\/span><span class=\"c0 c13\">Section 230 of the Communications Decency Act and the Future of Online Speech<\/span><span class=\"c0\"> (German Marshall Fund, 2019), <\/span><span class=\"c4 c0 c23\">[<a class=\"c17\" href=\"http:\/\/www.gmfus.org\/publications\/section-230-communications-decency-act-and-future-online-speech\" target=\"_blank\" rel=\"noopener noreferrer\">link<\/a>].<\/span><\/li>\n<\/ul>\n<p><strong>10\/3<\/strong><\/p>\n<ul>\n<li>All: Educause Review, <a href=\"https:\/\/er.educause.edu\/blogs\/2018\/8\/naicu-commends-the-student-right-to-know-before-you-go-act-for-inclusion-of-technology-requirements\">NAICU Commends the Student Right to Know Before You Go Act for Inclusion of Technology Requirements<\/a> &#8211; and follow the links to the proposed bills, noting the references to multi-party computation.<\/li>\n<li>All: Evans, Kolesnikov, and Rosulek, &#8220;A Pragmatic Introduction to Secure Multi-Party Computation.&#8221; Chapter 1. <a href=\"http:\/\/securecomputation.org\/\">http:\/\/securecomputation.org\/<\/a><\/li>\n<li>Law students:\u00a0 <a href=\"https:\/\/www.bu.edu\/articles\/2019\/secure-multiparty-computation\/\">What Is Secure Multiparty Computation?<\/a> &#8211; watch the video and follow all links.<\/li>\n<li>CS students: Ben-Or, Goldwasser, Wigderson, &#8220;Completeness theorems for non-cryptographic fault-tolerant distributed computation&#8221; pp 1-4\u00bd. [<a href=\"http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.116.2968&amp;rep=rep1&amp;type=pdf\">link<\/a>]<\/li>\n<\/ul>\n<p><strong>10\/10 <\/strong>(updated 10\/4\/2019)<\/p>\n<ul>\n<li>Paul Ohm, <a href=\"https:\/\/www.uclalawreview.org\/pdf\/57-6-3.pdf\"><i>Broken Promises of Privacy: Responding to the Surprising Failure of Anonymization<\/i><\/a>, 57 UCLA L. Rev. 1701 (2010). You should all read pp 1701-45 (it\u2019s not as long as it looks; law review articles have lots of footnotes which you need not read). You may skim the rest.<\/li>\n<li>Matt Burgess, <a href=\"https:\/\/www.wired.co.uk\/article\/what-is-gdpr-uk-eu-legislation-compliance-summary-fines-2018\"><i>What is GDPR?<\/i><\/a>, Wired, Jan 21, 2019.<\/li>\n<li>Future of Privacy Forum, <a href=\"https:\/\/fpf.org\/wp-content\/uploads\/2018\/11\/GDPR_CCPA_Comparison-Guide.pdf\"><i>Comparing Privacy Laws: GDPR v. CCPA<\/i><\/a>. Read the introduction and browse the headings, to get a sense of some of the similarities and differences between California and the EU\u2019s approaches to privacy regulation.<\/li>\n<\/ul>\n<p><strong>10\/17<\/strong><\/p>\n<ul>\n<li>All: John M. Abowd, &#8220;The U.S. Census Bureau Tries to be a Good Data Steward in the 21st Century.&#8221; 8:16-22:00. [<a href=\"https:\/\/www.youtube.com\/watch?v=R_8riuhIw-4&amp;feature=youtu.be&amp;t=496\">link<\/a>]<\/li>\n<li>All: U.S. Code Title 13, Section 9(a)\u00a0[<a href=\"https:\/\/www.law.cornell.edu\/uscode\/text\/13\/9\">link<\/a>]<\/li>\n<li>Law Students: Wood et al. &#8220;Differential Privacy: A Primer for a Non-Technical Audience.&#8221; Sections I-III (pp 209-232). [<a href=\"http:\/\/www.jetlaw.org\/wp-content\/uploads\/2018\/12\/4_Wood_Final.pdf\">link<\/a>]<\/li>\n<li>CS Students: Dwork and Roth, &#8220;Algorithmic Foundations of Differential Privacy.&#8221; Chapter 2 (pp 11-27). [<a href=\"https:\/\/www.cis.upenn.edu\/~aaroth\/Papers\/privacybook.pdf\">link<\/a>]<\/li>\n<\/ul>\n<p><strong>10\/24<\/strong><\/p>\n<ul>\n<li><span>Both CS &amp; Law students: (11 pages + a video)<\/span>\n<ul>\n<li><span>Physical ZK, Sections 1 &amp; 2<\/span><a href=\"https:\/\/www.iacr.org\/archive\/crypto2014\/86160292\/86160292.pdf\"> <span>https:\/\/www.iacr.org\/archive\/crypto2014\/86160292\/86160292.pdf<\/span><\/a><\/li>\n<li><span>Nuclear ZK, pages 1-5. <\/span><a href=\"https:\/\/www.boazbarak.org\/Papers\/nuclear-zk.pdf\"><span>https:\/\/www.boazbarak.org\/Papers\/nuclear-zk.pdf<\/span><\/a><\/li>\n<li><span>Practical Accountability of Secret Processes, video: <\/span><a href=\"https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/frankie\"><span>https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/frankie<\/span><\/a><span>\u00a0<\/span><\/li>\n<li><span>Public Accountability vs Secret Laws: Section 1,<\/span><a href=\"https:\/\/eprint.iacr.org\/2018\/664.pdf\"> <span>https:\/\/eprint.iacr.org\/2018\/664.pdf<\/span><\/a><\/li>\n<\/ul>\n<\/li>\n<li><span>CS Students (33 pages):<\/span>\n<ul>\n<li><span>Goldwasser, Micali, Rackoff: <\/span><a href=\"https:\/\/people.csail.mit.edu\/silvio\/Selected%20Scientific%20Papers\/Proof%20Systems\/The_Knowledge_Complexity_Of_Interactive_Proof_Systems.pdf\"><span>https:\/\/people.csail.mit.edu\/silvio\/Selected%20Scientific%20Papers\/Proof%20Systems\/The_Knowledge_Complexity_Of_Interactive_Proof_Systems.pdf<\/span><\/a><\/li>\n<li><span>Goldreich&#8217;s chapter on Zero Knowledge, Section 9.2-9.2.2 (p 411- 422) :<\/span><a href=\"http:\/\/www.wisdom.weizmann.ac.il\/~oded\/CC\/x9.pdf\"> <span>http:\/\/www.wisdom.weizmann.ac.il\/~oded\/CC\/x9.pdf<\/span><\/a><\/li>\n<\/ul>\n<\/li>\n<li><span>Law Students (40 pages)<\/span>\n<ul>\n<li><span>Accountable Algorithms, Parts 1 and 2<\/span><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=2765268\"> <span>https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=2765268<\/span><\/a><\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p><strong>11\/14: <\/strong>&#8220;Corporate Voting and Financial Algorithms&#8221;<\/p>\n<p><em>All PDFs available on Piazza in a .zip file.<\/em><\/p>\n<ul>\n<li>\u201cBusiness Organizations\u201d excerpts:\n<ul>\n<li>Ch 4, pages 71-83: basics of corporations<\/li>\n<li>Ch 16, pages 399-402: basics of SH voting<\/li>\n<li>Ch 26, pages 812-18: basics of securities trading<\/li>\n<\/ul>\n<\/li>\n<li>\u201cWAIT\u201d excerpt: pages 33-48: high frequency trading<\/li>\n<li>\u201cEncumbered Shares\u201d: pages 775-81: share voting and economic interests<\/li>\n<li>\u201cUS hedge fund activism\u201d: pages 107, 110-13: Mylan and Telus examples<\/li>\n<\/ul>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>A collaboration between Boston University and UC Berkeley for CS and law graduate students exploring how the use of algorithms and data might be understood, regulated and adjudicated by our legal system, with focus on machine learning and cryptographic algorithms. Syllabus\u00a0[link] Course Numbers BU: CS 791 \/ JD 673 UC Berkeley: CS 294 Instructors BU: [&hellip;]<\/p>\n","protected":false},"author":8550,"featured_media":0,"parent":0,"menu_order":2,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/pages\/2385"}],"collection":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/types\/page"}],"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=2385"}],"version-history":[{"count":15,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/pages\/2385\/revisions"}],"predecessor-version":[{"id":2405,"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/pages\/2385\/revisions\/2405"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/riscs\/wp-json\/wp\/v2\/media?parent=2385"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}