Briefing
This research addresses the limitations of existing secure computation models, which often demand complex multi-round interactions or pre-registration, by introducing two foundational primitives. The first, Verifiable One-Time Programs (Ver-OTPs), allows a receiver to non-interactively verify a program’s integrity before execution, leveraging minimal quantum resources alongside classical cryptography. Building upon Ver-OTPs and multi-key homomorphic encryption, the paper then constructs Open Secure Computation (OSC), a novel single-round secure computation model that eliminates the need for pre-registration. This breakthrough enables the deployment of efficient, private, and trust-minimized multi-party protocols for dynamic environments, fundamentally reshaping the landscape for applications such as single-round sealed-bid auctions, honest-majority atomic proposals for consensus, and differentially private statistical aggregation.
Context
Traditional secure multi-party computation (MPC) protocols frequently encounter deployment challenges due to their inherent reliance on multiple interaction rounds, which necessitates simultaneous online participation from all parties, or a mandatory pre-registration phase. These established requirements impose substantial overhead and restrict applicability in scenarios demanding spontaneity and dynamic participation, thereby impeding the widespread adoption of privacy-preserving computational tasks across various domains.
Analysis
The paper’s core mechanism is built upon two interdependent cryptographic primitives. First, Verifiable One-Time Programs (Ver-OTPs) extend the concept of one-time programs by allowing a receiver to cryptographically verify the program’s integrity prior to execution, without exposing its secret data. This is accomplished through a combination of single-qubit BB84-like quantum states and classical cryptographic components, including non-interactive zero-knowledge proofs (NIZKs), garbled circuits, and commitment schemes, integrated via a robust cut-and-choose verification technique. Second, leveraging these Ver-OTPs and multi-key homomorphic encryption (MHE), the research introduces Open Secure Computation (OSC).
OSC empowers a known receiving party to compute a function over inputs from an unknown and potentially unbounded set of sending parties within a single communication round, critically requiring no pre-registration. This fundamentally differentiates it from previous approaches by eliminating interactive overhead and setup prerequisites, thereby enabling spontaneous and private multi-party computations.
Parameters
- Core Concept ∞ Verifiable One-Time Programs
- New System/Protocol ∞ Open Secure Computation
- Key Authors ∞ Lev Stambler
- Underlying Quantum Requirement ∞ Single-qubit BB84-like states
- Classical Cryptographic Components ∞ Multi-key homomorphic encryption, non-interactive zero-knowledge proofs, garbled circuits, commitment schemes, secret sharing
- Security Model ∞ Simulation-based security
- Key Applications ∞ Sealed-bid auctions, atomic proposals, private statistical aggregation
Outlook
Future research trajectories for this work include optimizing Ver-OTPs for enhanced efficiency, investigating constructions that do not require a common reference string, and integrating robust fault-tolerance mechanisms to account for noisy quantum components. The substantial real-world applications of Open Secure Computation are poised to unlock truly single-round, privacy-preserving protocols for dynamic settings such as decentralized finance and private data aggregation within the next three to five years. This research initiates new avenues for exploring single-round protocol compilation and expands the practical utility of minimal quantum resources within cryptographic design.