
Briefing
This paper addresses the critical limitation that most proposed quantum internet applications demand sophisticated quantum resources currently beyond technological reach. It introduces Verifiable One-Time Programs (Ver-OTPs) as a novel cryptographic primitive, constructing from them a new model for single-round Open Secure Computation (OSC). This breakthrough fundamentally redefines quantum-assisted cryptography, enabling complex secure computations with only minimal quantum states and classical primitives, thereby accelerating the practical realization of quantum internet applications and enhancing the security and privacy foundations of future decentralized systems.

Context
Prior to this research, the development of the quantum internet faced a significant theoretical and practical hurdle ∞ the reliance on advanced quantum resources, such as fault-tolerant quantum computation, that remain largely aspirational. Established frameworks for secure computation often necessitated multiple interaction rounds or extensive pre-registration, posing efficiency and deployment challenges. This prevailing limitation meant that many revolutionary quantum applications remained confined to theoretical discourse, awaiting a substantial leap in quantum hardware capabilities.

Analysis
The paper’s core mechanism revolves around Verifiable One-Time Programs (Ver-OTPs), a new primitive that allows a receiver to verify an OTP’s well-formedness against public data non-interactively, without revealing any secret program details beyond its validity. Building upon these Ver-OTPs, the research constructs Open Secure Computation (OSC), a novel single-round secure computation model that eliminates the need for pre-registration. This approach fundamentally differs from previous methods by requiring only single-qubit states alongside classical cryptographic primitives like non-interactive zero-knowledge arguments, commitment schemes, garbled circuits, and secret sharing. This minimal quantum resource requirement, combined with the single-round, non-interactive nature of OSC, represents a significant conceptual leap, making quantum-assisted secure computation feasible with near-term quantum technology.

Parameters
- Core Concept ∞ Verifiable One-Time Programs (Ver-OTPs)
- New System/Protocol ∞ Open Secure Computation (OSC)
- Key Authors ∞ Lev Stambler
- Quantum Resource Requirement ∞ Single-qubit states
- Key Cryptographic Components ∞ Multi-key Homomorphic Encryption (MHE), Non-Interactive Zero-Knowledge Arguments
- Key Application Areas ∞ Sealed-bid auctions, consensus protocol building blocks, differentially private statistical aggregation

Outlook
This research opens new avenues for quantum-assisted cryptography, making previously distant applications potentially realizable within the next 3-5 years. Future work will likely focus on optimizing the classical cryptographic components and exploring further applications in decentralized finance and privacy-preserving machine learning, leveraging the single-round, non-interactive properties of OSC. The framework provides a foundational stepping stone toward a more practical quantum internet, fostering the development of secure, private, and efficient distributed systems that are resilient to emerging computational threats.