IQC Math and CS seminar featuring Archishna Bhattacharya

Uncloneable Encryption from Decoupling

Archishna Bhattacharya| IQC

An uncloneable encryption scheme encodes a classical message as a quantum ciphertext in order to guarantee that two non-interacting adversaries cannot both learn the message, even when given the encryption key. This defines a stronger classically-impossible notion of security, as any classical ciphertext can be copied. So far, a security proof for uncloneable encryption has been elusive.

We show that uncloneable encryption exists with no computational assumptions, with security inverse-polynomial in the security parameter. We use properties of a monogamy-of-entanglement game associated with the Haar-measure encryption to guarantee that any state that succeeds with high probability cannot be close to maximally-entangled between the referee and either of the players, whence we can apply a decoupling theorem to show that either player becomes completely uncorrelated, and therefore cannot win significantly better than random guessing.

Based on Uncloneable Encryption from Decoupling, this is joint work with Eric Culf.

Location

• QNC 1201

• Online on Zoom

  • Meeting ID: 979 7165 4976

    Passcode: 842258