On Best-Possible One-Time Programs
The research investigates limits on one-time programs (OTPs) used for program evaluation. It proves that a generic best-possible compiler cannot exist under certain cryptographic assumptions, establishing an impossibility result. However, it shows that stronger security guarantees, like SEQ security and stateful quantum indistinguishability obfuscation, are achievable in specific models.