- Protecting Cryptography aga...
- Edit Event
- Cancel Event
- Preview Reminder
- Send Reminder
- Other events happening in December 2020
Protecting Cryptography against Compelled Self-Incrimination
Speaker:
Sarah Scheffler
, Boston University
Date: Thursday, December 03, 2020
Time: 2:00 PM to 3:00 PM Note: all times are in the Eastern Time Zone
Public: Yes
Location:
Event Type: Seminar
Room Description:
Host: Srini Devadas, CSAIL
Contact: Kyle L Hogan, klhogan@csail.mit.edu
Relevant URL:
Speaker URL: None
Speaker Photo:
None
Reminders to:
seminars@csail.mit.edu, sscheff@bu.edu
Reminder Subject:
TALK: Protecting Cryptography against Compelled Self-Incrimination
Abstract: The information security community has devoted substantial effort to the design, development, and universal deployment of strong encryption schemes that withstand search and seizure by computationally-powerful nation-state adversaries. In response, governments are increasingly turning to a different tactic: issuing subpoenas that compel people to decrypt devices themselves, under the penalty of contempt of court if they do not comply. Compelled decryption subpoenas sidestep questions around government search powers that have dominated the Crypto Wars and instead touch upon a different (and still unsettled) area of the law: how encryption relates to a person's right to silence and against self-incrimination. In this work, we provide a rigorous, composable definition of a critical piece of the law that determines whether cryptosystems are vulnerable to government compelled disclosure in the United States. We justify our definition by showing that it is consistent with prior court cases. We prove that decryption is often not compellable by the government under our definition. Conversely, we show that many techniques that bolster security overall can leave one more vulnerable to compelled disclosure. As a result, we initiate the study of protecting cryptographic protocols against the threat of future compelled disclosure. We find that secure multi-party computation is particularly vulnerable to this threat, and we design and implement new schemes that are provably resilient in the face of government compelled disclosure. We believe this work should influence the design of future cryptographic primitives and contribute toward the legal debates over the constitutionality of compelled decryption. Joint work with Mayank Varia.
Zoom Info:
Topic: CSAIL Security Seminar
Time: This is a recurring meeting Meet anytime
Join Zoom Meeting
https://mit.zoom.us/j/97527284254
Password: <3security
One tap mobile
+16465588656,,97527284254# US (New York)
+16699006833,,97527284254# US (San Jose)
Meeting ID: 975 2728 4254
US : +1 646 558 8656 or +1 669 900 6833
International Numbers: https://mit.zoom.us/u/avDSojTEU
Join by SIP
97527284254@zoomcrc.com
Join by Skype for Business
https://mit.zoom.us/skype/97527284254
Research Areas:
Security & Cryptography
Impact Areas:
Created by Kyle L Hogan at Monday, November 16, 2020 at 4:16 PM.