{"id":278010,"date":"2016-08-17T10:39:43","date_gmt":"2016-08-17T17:39:43","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&#038;p=278010"},"modified":"2025-08-06T11:59:48","modified_gmt":"2025-08-06T18:59:48","slug":"applied-multi-party-computation","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/applied-multi-party-computation\/","title":{"rendered":"Applied Multi-Party Computation"},"content":{"rendered":"\n\n<p>Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation.<span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<p>Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation. The workshop will consist of invited keynote presentations, contributed presentations and round-table discussions on all aspects of applied secure computation.<\/p>\n<p>Some topics of interest include:<\/p>\n<ol>\n<li>General-purpose secure computation<\/li>\n<li>Special-purpose secure computation<\/li>\n<li>Garbled circuits<\/li>\n<li>Private function evaluation<\/li>\n<li>Applications of secure computation<\/li>\n<li>Static circuit designs and compilers<\/li>\n<li>Implementation and deployment challenges<\/li>\n<li>New settings and security models<\/li>\n<\/ol>\n<p>The workshop will include two discussion sessions on important topics related to applied MPC, including:<\/p>\n<ol>\n<li>The business case for MPC<\/li>\n<li>Theory vs. practice<\/li>\n<\/ol>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<ul>\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"http:\/\/www.cs.virginia.edu\/~evans\/\">David Evans<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, University of Virginia<\/li>\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"http:\/\/u.cs.biu.ac.il\/~lindell\/\">Yehuda Lindell<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, Bar-Ilan University<\/li>\n<\/ul>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<p><strong>Thursday, February 20th<\/strong><\/p>\n<p>8:55-9:00<br \/>\nWelcome and Opening Remarks<\/p>\n<p>9:00-9:50 | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/invited-talk-efficient-two-party-secure-computation-for-semi-honest-and-malicious-adversaries\/\">Video<\/a><br \/>\nInvited Talk, Yehuda Lindell<br \/>\n<em>Efficient Two-Party Secure Computation for Semi-Honest and Malicious Adversaries, <\/em><\/p>\n<p>9:50-10:00<br \/>\nBreak<\/p>\n<p>10:00-12:00 &#8211; New Techniques and Models (Chair: Claudio Orlandi)<br \/>\nHoeteck Wee, CNRS and ENS, Paris | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/multipartycomputationofplynomials.pdf\">Slides<\/a><br \/>\n<em>Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction<\/em><br \/>\nAlex J. Malozemoff, University of Maryland, College Park | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Efficient-Secure-Three-Party-Computation.pdf\">Slides<\/a><br \/>\n<em>Efficient Secure Three-party Computation<\/em><br \/>\nRanjit Kumaresan, Technion | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Improved-OT-Extension-for-Transferring-Short-Secrets.pptx\">Slides<\/a> | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/new-techniques-and-models\/\">Video<\/a><br \/>\n<em>Improved OT Extension for Transferring Short Secrets<\/em><br \/>\nTore K. Frederiksen, Aarhus University | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MiniLEGO-Efficient-Secure-Two-Party-Computation-From-General-Assumptions.pptx\">Slides<\/a> | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/new-techniques-and-models\/\">Video<\/a><br \/>\n<em>MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions<\/em><\/p>\n<p>12:00-13:00<br \/>\nLunch<\/p>\n<p>13:00-14:00 &#8211; Panel<br \/>\nTheory vs Practice<\/p>\n<p>14:00-14:15<br \/>\nBreak<\/p>\n<p>14:15-15:45 &#8211; Garbled Circuits (Chair: Vlad Kolesnikov)<br \/>\nMike Rosulek, Oregon State University\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/FleXOR-Flexible-garbling-for-XOR-gates-that-beats-free-XOR.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a><br \/>\n<em>FleXOR: Flexible garbling for XOR gates that beats free-XOR<\/em><br \/>\nClaudio Orlandi, Aarhus University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a><br \/>\n<em>Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently<\/em><br \/>\nViet Tung Hoang, University of California San Diego \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Efficient-garbling-from-a-fixed-key-blockcipher-slides.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a><br \/>\n<em>Efficient garbling from a fixed-key blockcipher<\/em><\/p>\n<p>15:45-16:00<br \/>\nBreak<\/p>\n<p>16:00-18:00 &#8211; Applications (Chair: Mariana Raykova)<br \/>\nTomas Toft, Aarhus University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a><br \/>\n<em>Secure Collaborative Statistics in Credit Rating Using Linear Programming<\/em><br \/>\nAbdelrahaman Aly, C.O.R.E., Univesit\u00e9 catholique de Louvain \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Securely-Solving-Standard-Network-Flow-Problems-with-Secure-Multi-party-Computation-slides.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a><br \/>\n<em>Securely Solving Standard Network Flow Problems with Secure Multi-party Computation<\/em><br \/>\nMahdi Zamani, University of New Mexico \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MPC-in-Large-Networks-with-an-Application-to-Anonymous-Broadcast-1.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a><br \/>\n<em>MPC in Large Networks with an Application to Anonymous Broadcast<\/em><br \/>\nKoki Hamada, NTT Secure Platform Laboratories \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MEVAL-A-Practically-Efficient-System-for-Secure-Multi-party-Statistical-Analysis-1.pptx\">Slides<\/a><br \/>\n<em>MEVAL: A Practically Efficient System for Secure Multi-party Statistical Analysis<\/em><\/p>\n<p><strong>Friday, February 21st<\/strong><\/p>\n<p>9:00-9:50, David Evans \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Secure-Computation-in-2029-Boom-Bust-or-Bonanza.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/invited-talk-secure-computation-in-2029-boom-bust-or-bonanza\/\">Video<\/a><br \/>\nInvited Talk<br \/>\n<em>Secure Computation in 2029: Boom, Bust, or Bonanza<\/em><\/p>\n<p>9:50-10:00<br \/>\nBreak<\/p>\n<p>10:00-11:10 &#8211; Databases (Chair: Aniket Kate)<br \/>\nVlad Kolesnikov, Bell Labs; and Tal Malkin, Columbia University and Bar Ilan University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Practical-Private-Database-Querying.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/databases-and-server-aided-mpc\/\">Video<\/a><br \/>\n<em>Practical Private Database Querying<\/em><br \/>\nRiivo Talviste, Cybernetica AS \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Practical-linking-of-databases-using-secure-multiparty-computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/databases-and-server-aided-mpc\/\">Video<\/a><br \/>\n<em>Practical linking of databases using secure multiparty computation<\/em><\/p>\n<p>11:10-12:10 &#8211; Server-Aided MPC (Chair: Mike Rosulek)<br \/>\nBenjamin Mood, University of Oregon \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/PartialGC-a-system-for-saving-and-reusing-intermediate-garbled-circuit-values.pdf\">Slides<\/a><br \/>\n<em>PartialGC: a system for saving and reusing intermediate garbled circuit values<\/em><br \/>\nHenry Carter, Georgia Institute of Technology \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Whitewash-Outsourcing-Garbled-Circuit-Generation-for-Mobile-Devices.pdf\">Slides<\/a><br \/>\n<em>Whitewash: Outsourcing Garbled Circuit Generation for Mobile Devices<\/em><\/p>\n<p>12:10-13:00<br \/>\nLunch<\/p>\n<p>13:00-14:00 &#8211; Panel \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/panel-on-the-business-case-for-mpc\/\">Video<\/a><br \/>\n<em>The Business Case for MPC<\/em><\/p>\n<p>14:00-14:15<br \/>\nBreak<\/p>\n<p>14:15-15:45 &#8211; Data-Oblivious Computation (Chair: Bryan Parno)<br \/>\nMarcel Keller, University of Bristol \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/How-to-Implement-ORAM-in-MPC.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a><br \/>\n<em>How to Implement (ORAM in) MPC<\/em><br \/>\nMariana Raykova, SRI \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Secure-Computation-with-Random-Access-Machines.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a><br \/>\n<em>Secure Computation with Random Access Machines<\/em><br \/>\nSamee Zahur, University of Virginia \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a><br \/>\n<em>Obliv-C: A Lightweight Compiler for Data-Oblivious Computation<\/em><\/p>\n<p>15:45-16:00<br \/>\nBreak<\/p>\n<p>16:00-17:30 &#8211; Asynchronous & Broadcast-Efficient MPC (Chair: Nishanth Chandran)<br \/>\nJuan Garay, Yahoo Labs \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Broadcast-and-Round-Efficient-Secure-Multiparty-Computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a><br \/>\n<em>Broadcast (and Round) Efficient Secure Multiparty Computation<\/em><br \/>\nAniket Kate, MMCI, Saarland University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a><br \/>\n<em>Asynchronous MPC with t < n\/2 Using Non-equivocation<\/em><br \/>\nMahnush Movahedi, University of New Mexico \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Quorums-Quicken-Queries-Efficient-Asynchronous-Secure-Multiparty-Computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a><br \/>\n<em>Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation<\/em><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation.<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_startdate":"2014-02-20","msr_enddate":"2014-02-21","msr_location":"Microsoft Research, Redmond","msr_expirationdate":"","msr_event_recording_link":"","msr_event_link":"","msr_event_link_redirect":false,"msr_event_time":"","msr_hide_region":false,"msr_private_event":true,"msr_hide_image_in_river":0,"footnotes":""},"research-area":[13558],"msr-region":[197900],"msr-event-type":[210063],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-278010","msr-event","type-msr-event","status-publish","hentry","msr-research-area-security-privacy-cryptography","msr-region-north-america","msr-event-type-workshop","msr-locale-en_us"],"msr_about":"<!-- wp:msr\/event-details {\"title\":\"Applied Multi-Party Computation\",\"backgroundColor\":\"grey\"} \/-->\n\n<!-- wp:msr\/content-tabs --><!-- wp:msr\/content-tab {\"title\":\"Topics\"} --><!-- wp:freeform --><p>Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation.<span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<p>Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation. The workshop will consist of invited keynote presentations, contributed presentations and round-table discussions on all aspects of applied secure computation.<\/p>\n<p>Some topics of interest include:<\/p>\n<ol>\n<li>General-purpose secure computation<\/li>\n<li>Special-purpose secure computation<\/li>\n<li>Garbled circuits<\/li>\n<li>Private function evaluation<\/li>\n<li>Applications of secure computation<\/li>\n<li>Static circuit designs and compilers<\/li>\n<li>Implementation and deployment challenges<\/li>\n<li>New settings and security models<\/li>\n<\/ol>\n<p>The workshop will include two discussion sessions on important topics related to applied MPC, including:<\/p>\n<ol>\n<li>The business case for MPC<\/li>\n<li>Theory vs. practice<\/li>\n<\/ol>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<!-- \/wp:freeform --><!-- \/wp:msr\/content-tab --><!-- wp:msr\/content-tab {\"title\":\"Keynote Speakers\"} --><!-- wp:freeform --><ul>\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"http:\/\/www.cs.virginia.edu\/~evans\/\">David Evans<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, University of Virginia<\/li>\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"http:\/\/u.cs.biu.ac.il\/~lindell\/\">Yehuda Lindell<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, Bar-Ilan University<\/li>\n<\/ul>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<!-- \/wp:freeform --><!-- \/wp:msr\/content-tab --><!-- wp:msr\/content-tab {\"title\":\"Program\"} --><!-- wp:freeform --><p><strong>Thursday, February 20th<\/strong><\/p>\n<p>8:55-9:00<br \/>\nWelcome and Opening Remarks<\/p>\n<p>9:00-9:50 | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/invited-talk-efficient-two-party-secure-computation-for-semi-honest-and-malicious-adversaries\/\">Video<\/a><br \/>\nInvited Talk, Yehuda Lindell<br \/>\n<em>Efficient Two-Party Secure Computation for Semi-Honest and Malicious Adversaries, <\/em><\/p>\n<p>9:50-10:00<br \/>\nBreak<\/p>\n<p>10:00-12:00 &#8211; New Techniques and Models (Chair: Claudio Orlandi)<br \/>\nHoeteck Wee, CNRS and ENS, Paris | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/multipartycomputationofplynomials.pdf\">Slides<\/a><br \/>\n<em>Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction<\/em><br \/>\nAlex J. Malozemoff, University of Maryland, College Park | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Efficient-Secure-Three-Party-Computation.pdf\">Slides<\/a><br \/>\n<em>Efficient Secure Three-party Computation<\/em><br \/>\nRanjit Kumaresan, Technion | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Improved-OT-Extension-for-Transferring-Short-Secrets.pptx\">Slides<\/a> | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/new-techniques-and-models\/\">Video<\/a><br \/>\n<em>Improved OT Extension for Transferring Short Secrets<\/em><br \/>\nTore K. Frederiksen, Aarhus University | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MiniLEGO-Efficient-Secure-Two-Party-Computation-From-General-Assumptions.pptx\">Slides<\/a> | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/new-techniques-and-models\/\">Video<\/a><br \/>\n<em>MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions<\/em><\/p>\n<p>12:00-13:00<br \/>\nLunch<\/p>\n<p>13:00-14:00 &#8211; Panel<br \/>\nTheory vs Practice<\/p>\n<p>14:00-14:15<br \/>\nBreak<\/p>\n<p>14:15-15:45 &#8211; Garbled Circuits (Chair: Vlad Kolesnikov)<br \/>\nMike Rosulek, Oregon State University\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/FleXOR-Flexible-garbling-for-XOR-gates-that-beats-free-XOR.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a><br \/>\n<em>FleXOR: Flexible garbling for XOR gates that beats free-XOR<\/em><br \/>\nClaudio Orlandi, Aarhus University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a><br \/>\n<em>Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently<\/em><br \/>\nViet Tung Hoang, University of California San Diego \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Efficient-garbling-from-a-fixed-key-blockcipher-slides.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a><br \/>\n<em>Efficient garbling from a fixed-key blockcipher<\/em><\/p>\n<p>15:45-16:00<br \/>\nBreak<\/p>\n<p>16:00-18:00 &#8211; Applications (Chair: Mariana Raykova)<br \/>\nTomas Toft, Aarhus University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a><br \/>\n<em>Secure Collaborative Statistics in Credit Rating Using Linear Programming<\/em><br \/>\nAbdelrahaman Aly, C.O.R.E., Univesit\u00e9 catholique de Louvain \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Securely-Solving-Standard-Network-Flow-Problems-with-Secure-Multi-party-Computation-slides.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a><br \/>\n<em>Securely Solving Standard Network Flow Problems with Secure Multi-party Computation<\/em><br \/>\nMahdi Zamani, University of New Mexico \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MPC-in-Large-Networks-with-an-Application-to-Anonymous-Broadcast-1.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a><br \/>\n<em>MPC in Large Networks with an Application to Anonymous Broadcast<\/em><br \/>\nKoki Hamada, NTT Secure Platform Laboratories \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MEVAL-A-Practically-Efficient-System-for-Secure-Multi-party-Statistical-Analysis-1.pptx\">Slides<\/a><br \/>\n<em>MEVAL: A Practically Efficient System for Secure Multi-party Statistical Analysis<\/em><\/p>\n<p><strong>Friday, February 21st<\/strong><\/p>\n<p>9:00-9:50, David Evans \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Secure-Computation-in-2029-Boom-Bust-or-Bonanza.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/invited-talk-secure-computation-in-2029-boom-bust-or-bonanza\/\">Video<\/a><br \/>\nInvited Talk<br \/>\n<em>Secure Computation in 2029: Boom, Bust, or Bonanza<\/em><\/p>\n<p>9:50-10:00<br \/>\nBreak<\/p>\n<p>10:00-11:10 &#8211; Databases (Chair: Aniket Kate)<br \/>\nVlad Kolesnikov, Bell Labs; and Tal Malkin, Columbia University and Bar Ilan University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Practical-Private-Database-Querying.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/databases-and-server-aided-mpc\/\">Video<\/a><br \/>\n<em>Practical Private Database Querying<\/em><br \/>\nRiivo Talviste, Cybernetica AS \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Practical-linking-of-databases-using-secure-multiparty-computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/databases-and-server-aided-mpc\/\">Video<\/a><br \/>\n<em>Practical linking of databases using secure multiparty computation<\/em><\/p>\n<p>11:10-12:10 &#8211; Server-Aided MPC (Chair: Mike Rosulek)<br \/>\nBenjamin Mood, University of Oregon \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/PartialGC-a-system-for-saving-and-reusing-intermediate-garbled-circuit-values.pdf\">Slides<\/a><br \/>\n<em>PartialGC: a system for saving and reusing intermediate garbled circuit values<\/em><br \/>\nHenry Carter, Georgia Institute of Technology \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Whitewash-Outsourcing-Garbled-Circuit-Generation-for-Mobile-Devices.pdf\">Slides<\/a><br \/>\n<em>Whitewash: Outsourcing Garbled Circuit Generation for Mobile Devices<\/em><\/p>\n<p>12:10-13:00<br \/>\nLunch<\/p>\n<p>13:00-14:00 &#8211; Panel \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/panel-on-the-business-case-for-mpc\/\">Video<\/a><br \/>\n<em>The Business Case for MPC<\/em><\/p>\n<p>14:00-14:15<br \/>\nBreak<\/p>\n<p>14:15-15:45 &#8211; Data-Oblivious Computation (Chair: Bryan Parno)<br \/>\nMarcel Keller, University of Bristol \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/How-to-Implement-ORAM-in-MPC.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a><br \/>\n<em>How to Implement (ORAM in) MPC<\/em><br \/>\nMariana Raykova, SRI \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Secure-Computation-with-Random-Access-Machines.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a><br \/>\n<em>Secure Computation with Random Access Machines<\/em><br \/>\nSamee Zahur, University of Virginia \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a><br \/>\n<em>Obliv-C: A Lightweight Compiler for Data-Oblivious Computation<\/em><\/p>\n<p>15:45-16:00<br \/>\nBreak<\/p>\n<p>16:00-17:30 &#8211; Asynchronous &amp; Broadcast-Efficient MPC (Chair: Nishanth Chandran)<br \/>\nJuan Garay, Yahoo Labs \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Broadcast-and-Round-Efficient-Secure-Multiparty-Computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a><br \/>\n<em>Broadcast (and Round) Efficient Secure Multiparty Computation<\/em><br \/>\nAniket Kate, MMCI, Saarland University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a><br \/>\n<em>Asynchronous MPC with t &lt; n\/2 Using Non-equivocation<\/em><br \/>\nMahnush Movahedi, University of New Mexico \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Quorums-Quicken-Queries-Efficient-Asynchronous-Secure-Multiparty-Computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a><br \/>\n<em>Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation<\/em><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<!-- \/wp:freeform --><!-- \/wp:msr\/content-tab --><!-- \/wp:msr\/content-tabs -->","tab-content":[{"id":0,"name":"Topics","content":"Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation. The workshop will consist of invited keynote presentations, contributed presentations and round-table discussions on all aspects of applied secure computation.\r\n\r\nSome topics of interest include:\r\n<ol>\r\n \t<li>General-purpose secure computation<\/li>\r\n \t<li>Special-purpose secure computation<\/li>\r\n \t<li>Garbled circuits<\/li>\r\n \t<li>Private function evaluation<\/li>\r\n \t<li>Applications of secure computation<\/li>\r\n \t<li>Static circuit designs and compilers<\/li>\r\n \t<li>Implementation and deployment challenges<\/li>\r\n \t<li>New settings and security models<\/li>\r\n<\/ol>\r\nThe workshop will include two discussion sessions on important topics related to applied MPC, including:\r\n<ol>\r\n \t<li>The business case for MPC<\/li>\r\n \t<li>Theory vs. practice<\/li>\r\n<\/ol>"},{"id":1,"name":"Keynote Speakers","content":"<ul>\r\n \t<li><a href=\"http:\/\/www.cs.virginia.edu\/~evans\/\">David Evans<\/a>, University of Virginia<\/li>\r\n \t<li><a href=\"http:\/\/u.cs.biu.ac.il\/~lindell\/\">Yehuda Lindell<\/a>, Bar-Ilan University<\/li>\r\n<\/ul>"},{"id":2,"name":"Program","content":"<strong>Thursday, February 20th<\/strong>\r\n\r\n8:55-9:00\r\nWelcome and Opening Remarks\r\n\r\n9:00-9:50 | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/invited-talk-efficient-two-party-secure-computation-for-semi-honest-and-malicious-adversaries\/\">Video<\/a>\r\nInvited Talk, Yehuda Lindell\r\n<em>Efficient Two-Party Secure Computation for Semi-Honest and Malicious Adversaries, <\/em>\r\n\r\n9:50-10:00\r\nBreak\r\n\r\n10:00-12:00 - New Techniques and Models (Chair: Claudio Orlandi)\r\nHoeteck Wee, CNRS and ENS, Paris | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/multipartycomputationofplynomials.pdf\">Slides<\/a>\r\n<em>Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction<\/em>\r\nAlex J. Malozemoff, University of Maryland, College Park | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Efficient-Secure-Three-Party-Computation.pdf\">Slides<\/a>\r\n<em>Efficient Secure Three-party Computation<\/em>\r\nRanjit Kumaresan, Technion | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Improved-OT-Extension-for-Transferring-Short-Secrets.pptx\">Slides<\/a> | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/new-techniques-and-models\/\">Video<\/a>\r\n<em>Improved OT Extension for Transferring Short Secrets<\/em>\r\nTore K. Frederiksen, Aarhus University | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MiniLEGO-Efficient-Secure-Two-Party-Computation-From-General-Assumptions.pptx\">Slides<\/a> | <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/new-techniques-and-models\/\">Video<\/a>\r\n<em>MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions<\/em>\r\n\r\n12:00-13:00\r\nLunch\r\n\r\n13:00-14:00 - Panel\r\nTheory vs Practice\r\n\r\n14:00-14:15\r\nBreak\r\n\r\n14:15-15:45 - Garbled Circuits (Chair: Vlad Kolesnikov)\r\nMike Rosulek, Oregon State University\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/FleXOR-Flexible-garbling-for-XOR-gates-that-beats-free-XOR.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a>\r\n<em>FleXOR: Flexible garbling for XOR gates that beats free-XOR<\/em>\r\nClaudio Orlandi, Aarhus University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a>\r\n<em>Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently<\/em>\r\nViet Tung Hoang, University of California San Diego \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Efficient-garbling-from-a-fixed-key-blockcipher-slides.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/garbled-circuits\/\">Video<\/a>\r\n<em>Efficient garbling from a fixed-key blockcipher<\/em>\r\n\r\n15:45-16:00\r\nBreak\r\n\r\n16:00-18:00 - Applications (Chair: Mariana Raykova)\r\nTomas Toft, Aarhus University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a>\r\n<em>Secure Collaborative Statistics in Credit Rating Using Linear Programming<\/em>\r\nAbdelrahaman Aly, C.O.R.E., Univesit\u00e9 catholique de Louvain \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Securely-Solving-Standard-Network-Flow-Problems-with-Secure-Multi-party-Computation-slides.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a>\r\n<em>Securely Solving Standard Network Flow Problems with Secure Multi-party Computation<\/em>\r\nMahdi Zamani, University of New Mexico \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MPC-in-Large-Networks-with-an-Application-to-Anonymous-Broadcast-1.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/applications\/\">Video<\/a>\r\n<em>MPC in Large Networks with an Application to Anonymous Broadcast<\/em>\r\nKoki Hamada, NTT Secure Platform Laboratories \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/MEVAL-A-Practically-Efficient-System-for-Secure-Multi-party-Statistical-Analysis-1.pptx\">Slides<\/a>\r\n<em>MEVAL: A Practically Efficient System for Secure Multi-party Statistical Analysis<\/em>\r\n\r\n<strong>Friday, February 21st<\/strong>\r\n\r\n9:00-9:50, David Evans \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Secure-Computation-in-2029-Boom-Bust-or-Bonanza.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/invited-talk-secure-computation-in-2029-boom-bust-or-bonanza\/\">Video<\/a>\r\nInvited Talk\r\n<em>Secure Computation in 2029: Boom, Bust, or Bonanza<\/em>\r\n\r\n9:50-10:00\r\nBreak\r\n\r\n10:00-11:10 - Databases (Chair: Aniket Kate)\r\nVlad Kolesnikov, Bell Labs; and Tal Malkin, Columbia University and Bar Ilan University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Practical-Private-Database-Querying.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/databases-and-server-aided-mpc\/\">Video<\/a>\r\n<em>Practical Private Database Querying<\/em>\r\nRiivo Talviste, Cybernetica AS \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Practical-linking-of-databases-using-secure-multiparty-computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/databases-and-server-aided-mpc\/\">Video<\/a>\r\n<em>Practical linking of databases using secure multiparty computation<\/em>\r\n\r\n11:10-12:10 - Server-Aided MPC (Chair: Mike Rosulek)\r\nBenjamin Mood, University of Oregon \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/PartialGC-a-system-for-saving-and-reusing-intermediate-garbled-circuit-values.pdf\">Slides<\/a>\r\n<em>PartialGC: a system for saving and reusing intermediate garbled circuit values<\/em>\r\nHenry Carter, Georgia Institute of Technology \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Whitewash-Outsourcing-Garbled-Circuit-Generation-for-Mobile-Devices.pdf\">Slides<\/a>\r\n<em>Whitewash: Outsourcing Garbled Circuit Generation for Mobile Devices<\/em>\r\n\r\n12:10-13:00\r\nLunch\r\n\r\n13:00-14:00 - Panel \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/panel-on-the-business-case-for-mpc\/\">Video<\/a>\r\n<em>The Business Case for MPC<\/em>\r\n\r\n14:00-14:15\r\nBreak\r\n\r\n14:15-15:45 - Data-Oblivious Computation (Chair: Bryan Parno)\r\nMarcel Keller, University of Bristol \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/How-to-Implement-ORAM-in-MPC.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a>\r\n<em>How to Implement (ORAM in) MPC<\/em>\r\nMariana Raykova, SRI \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Secure-Computation-with-Random-Access-Machines.pptx\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a>\r\n<em>Secure Computation with Random Access Machines<\/em>\r\nSamee Zahur, University of Virginia \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/data-oblivious-computation\/\">Video<\/a>\r\n<em>Obliv-C: A Lightweight Compiler for Data-Oblivious Computation<\/em>\r\n\r\n15:45-16:00\r\nBreak\r\n\r\n16:00-17:30 - Asynchronous &amp; Broadcast-Efficient MPC (Chair: Nishanth Chandran)\r\nJuan Garay, Yahoo Labs \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Broadcast-and-Round-Efficient-Secure-Multiparty-Computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a>\r\n<em>Broadcast (and Round) Efficient Secure Multiparty Computation<\/em>\r\nAniket Kate, MMCI, Saarland University \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a>\r\n<em>Asynchronous MPC with t &lt; n\/2 Using Non-equivocation<\/em>\r\nMahnush Movahedi, University of New Mexico \u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/Quorums-Quicken-Queries-Efficient-Asynchronous-Secure-Multiparty-Computation.pdf\">Slides<\/a>\u00a0 |\u00a0 <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/video\/asynchronous-broadcast-efficient-mpc\/\">Video<\/a>\r\n<em>Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation<\/em>"}],"msr_startdate":"2014-02-20","msr_enddate":"2014-02-21","msr_event_time":"","msr_location":"Microsoft Research, Redmond","msr_event_link":"","msr_event_recording_link":"","msr_startdate_formatted":"February 20, 2014","msr_register_text":"Watch now","msr_cta_link":"","msr_cta_text":"","msr_cta_bi_name":"","featured_image_thumbnail":null,"event_excerpt":"Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation.","msr_research_lab":[199565],"related-researchers":[],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[],"related-videos":[190473,190497,190505,190515,190517,190521,190607,190609,190611],"related-posts":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/278010","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-event"}],"version-history":[{"count":2,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/278010\/revisions"}],"predecessor-version":[{"id":1147301,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/278010\/revisions\/1147301"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=278010"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=278010"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=278010"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=278010"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=278010"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=278010"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=278010"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=278010"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=278010"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}