IQC Math and CS seminar featuring Eli Goldin

Eli Goldin | NYU

We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to U,U†,U∗,UT for a Haar random unitary U. Our scheme satisfies the standard notion of unclonable indistinguishability security, supports reuse of the secret key, and can encrypt arbitrary-length messages. That is, we give the first evidence that (reusable) UE, which requires computational assumptions, exists in "micocrypt", a world where one-way functions may not exist.

As one of our central technical contributions, we build on the recently introduced path recording framework to prove a natural ``unitary reprogramming lemma'', which may be of independent interest.

Location

• QNC 4104
• Online on Zoom

  • Meeting ID: 912 8146 6256 

    Passcode

    : 494237

Add event to calendar