BOB'S SIDEKICK(OR HOW LIMITATIONS ON TRIPARTITE QUANTUM CORRELATIONS ARE USEFUL FOR CRYPTOGRAPHY)

Speaker: ANNE BROADBENT

Date: Friday, March 04, 2022

Time: 10:30 AM to 12:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: Hybrid in Hewlett G882 or email Fraton@mit.edu for zoom link

Event Type: Seminar

Room Description:

Host: Vinod Vaikuntanathan and Yael Kalai

Contact: Felicia Raton, 4015805009, fraton@csail.mit.edu

Relevant URL:

Speaker URL: None

Speaker Photo:
A2b2c8a5 348b 4f4d bec0 eab67b7bf4fc

Reminders to: seminars@csail.mit.edu, cis-seminar@csail.mit.edu, crypto@lists.csail.mit.edu

Reminder Subject: TALK: BOB'S SIDEKICK(OR HOW LIMITATIONS ON TRIPARTITE QUANTUM CORRELATIONS ARE USEFUL FOR CRYPTOGRAPHY)

Abstract:

We present a variant of the two-prover interactive proof model, where the interaction pattern is limited to a 3-messages: setup-broadcast-response. By virtue of these limitations, classically, the model has the same power as the single-prover model where 3 messages are exchanged. In stark contrast, the quantum version of this model (which we call the ‘Bob’s sidekick’ model) gives rise to monogamy-of-entanglement’ (MoE) games, wherein the limitation on tri-partite entanglement hampers the provers, as compared to the single-prover case. We show how this limitation can be exploited for cryptographic purposes, for instance in “unclonable encryption” where the capacity of an adversary to copy a ciphertext is limited; this is achieved using an MoE game based on conjugate coding. What is more, we show the first rigidity theorem for this MoE game, which means that producing optimal winning statistics strongly constrains the quantum strategy of the provers. From this rigidity result, we derive a weak string erasure protocol, which implies bit commitment — in a model where classical bit commitment is impossible.

Research Areas:

Impact Areas:

This event is not part of a series.

Created by Felicia Raton Email at Thursday, February 24, 2022 at 12:33 PM.