TCS+ talk *this week*: Wednesday, November 5, Aparna Gupte, MIT
Clement Canonne
This is a reminder that the next TCS+ talk is taking place this week, Wednesday, November 5th at 1:00 PM Eastern Time (10:00 AM Pacific Time, 19:00 Central European Time, 18:00 UTC). The speakers' slides will be made available at https://sites.google.com/view/tcsplus/welcome/past-talks after the talk.
If you’d like to join the Zoom talk, please sign up using the form at https://sites.google.com/view/tcsplus/welcome/next-tcs-talk. The talk will also be recorded and posted shortly afterwards on our YouTube channel, here: http://www.youtube.com/user/TCSplusSeminars.
Hoping to see you all there,
The organizers
-------------------------------
Speaker: Aparna Gupte (MIT)
Title: Quantum One-Time Programs, Revisited
Abstract: One-time programs (Goldwasser, Kalai and Rothblum, CRYPTO 2008) are functions that can be run on any single input of a user’s choice, but not on a second input. Classically, they are unachievable without trusted hardware, but the destructive nature of quantum measurements seems to provide a quantum path to constructing them. Unfortunately, Broadbent, Gutoski and Stebila showed that even with quantum techniques, a strong notion of one-time programs, similar to ideal obfuscation, cannot be achieved for any non-trivial quantum function. On the positive side, Ben-David and Sattath (Quantum, 2023) showed how to construct a one-time program for a certain (probabilistic) digital signature scheme, under a weaker notion of one-time program security.
There is a vast gap between achievable and provably impossible notions of one-time program security, and it is unclear what functionalities are one-time programmable under the achievable notions of security.In this work, we present new, meaningful, yet achievable definitions of one-time program security for probabilistic classical functions. We show how to construct one time programs satisfying these definitions for all functions in the classical oracle model and for constrained pseudorandom functions in the plain model. Finally, we examine the limits of these notions: we show a class of functions which cannot be one-time programmed in the plain model, as well as a class of functions which appears to be highly random given a single query, but whose one-time program must leak the entire function, even in the oracle model.
This is joint work with Jiahui Liu, Justin Raizes, Bhaskar Roberts, and Vinod Vaikuntanathan.
Clement Canonne
The link for tomorrow's TCS+ talk has been posted: you will be able to join tomorrow (Wednesday), starting at 12:50pm ET: https://berkeley.zoom.us/j/98954371813?pwd=V1hxN2Nrc2c5OEJFSWRqS29JeWM1dz09
(you will need to be logged in on Zoom to join: a free account suffices)
Best,
-- Clément, on behalf of the TCS+ team
________________________________________
From: 'Clement Canonne' via TCS+ <tcsplus_...@googlegroups.com>
Sent: Monday, November 3, 2025 3:21 PM
To: TCS+ Announcement Mailing List
Subject: TCS+ talk *this week*: Wednesday, November 5, Aparna Gupte, MIT
Hello everyone,
This is a reminder that the next TCS+ talk is taking place this week, Wednesday, November 5th at 1:00 PM Eastern Time (10:00 AM Pacific Time, 19:00 Central European Time, 18:00 UTC). The speakers' slides will be made available at https://url.au.m.mimecastprotect.com/s/MiEHCP7LAXfNQAQQjhzf4CxjGGZ?domain=sites.google.com after the talk.
If you’d like to join the Zoom talk, please sign up using the form at https://url.au.m.mimecastprotect.com/s/EXOgCQnMBZfl74772hPhlCGVgi4?domain=sites.google.com. The talk will also be recorded and posted shortly afterwards on our YouTube channel, here: https://url.au.m.mimecastprotect.com/s/452-CROND2u0NPNNMtPiLC1GLVV?domain=youtube.com.
Hoping to see you all there,
The organizers
-------------------------------
Speaker: Aparna Gupte (MIT)
Title: Quantum One-Time Programs, Revisited
Abstract: One-time programs (Goldwasser, Kalai and Rothblum, CRYPTO 2008) are functions that can be run on any single input of a user’s choice, but not on a second input. Classically, they are unachievable without trusted hardware, but the destructive nature of quantum measurements seems to provide a quantum path to constructing them. Unfortunately, Broadbent, Gutoski and Stebila showed that even with quantum techniques, a strong notion of one-time programs, similar to ideal obfuscation, cannot be achieved for any non-trivial quantum function. On the positive side, Ben-David and Sattath (Quantum, 2023) showed how to construct a one-time program for a certain (probabilistic) digital signature scheme, under a weaker notion of one-time program security.
There is a vast gap between achievable and provably impossible notions of one-time program security, and it is unclear what functionalities are one-time programmable under the achievable notions of security.In this work, we present new, meaningful, yet achievable definitions of one-time program security for probabilistic classical functions. We show how to construct one time programs satisfying these definitions for all functions in the classical oracle model and for constrained pseudorandom functions in the plain model. Finally, we examine the limits of these notions: we show a class of functions which cannot be one-time programmed in the plain model, as well as a class of functions which appears to be highly random given a single query, but whose one-time program must leak the entire function, even in the oracle model.
This is joint work with Jiahui Liu, Justin Raizes, Bhaskar Roberts, and Vinod Vaikuntanathan.
You received this message because you are subscribed to the Google Groups "TCS+" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tcsplus_announ...@googlegroups.com.
To view this discussion visit https://url.au.m.mimecastprotect.com/s/7gw9CVARKgCkMjMMWcJs0CEfKOM?domain=groups.google.com.
For more options, visit https://url.au.m.mimecastprotect.com/s/wIbYCWLVXkUX0w00MCmtlCoW26b?domain=groups.google.com.