BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220421T090000
DTEND;TZID=America/New_York:20220421T100000
DTSTAMP:20240301T103156Z
CREATED:20240214T113250Z
LAST-MODIFIED:20240301T103156Z
UID:10002700-1650531600-1650535200@cmsa.fas.harvard.edu
SUMMARY:Secure Multi-Party Computation: from Theory to Practice
DESCRIPTION:Abstract:\nEncryption is the backbone of cybersecurity. While encryption can secure data both in transit and at rest\, in the new era of ubiquitous computing\, modern cryptography also aims to protect data during computation. Secure multi-party computation (MPC) is a powerful technology to tackle this problem\, which enables distrustful parties to jointly perform computation over their private data without revealing their data to each other. Although it is theoretically feasible and provably secure\, the adoption of MPC in real industry is still very much limited as of today\, the biggest obstacle of which boils down to its efficiency. \nMy research goal is to bridge the gap between the theoretical feasibility and practical efficiency of MPC. Towards this goal\, my research spans both theoretical and applied cryptography. In theory\, I develop new techniques for achieving general MPC with the optimal complexity\, bringing theory closer to practice. In practice\, I design tailored MPC to achieve the best concrete efficiency for specific real-world applications. In this talk\, I will discuss the challenges in both directions and how to overcome these challenges using cryptographic approaches. I will also show strong connections between theory and practice. \nBiography:\nPeihan Miao is an assistant professor of computer science at the University of Illinois Chicago (UIC). Before coming to UIC\, she received her Ph.D. from the University of California\, Berkeley in 2019 and had brief stints at Google\, Facebook\, Microsoft Research\, and Visa Research. Her research interests lie broadly in cryptography\, theory\, and security\, with a focus on secure multi-party computation — especially in incorporating her industry experiences into academic research.
URL:https://cmsa.fas.harvard.edu/event/4-21-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-04.21.22-1583x2048-1.jpg
END:VEVENT
END:VCALENDAR