Eavesdropper-Blind Remote State Preparation and Applications to Quantum Public-Key Encryption

• URL: http://arxiv.org/abs/2608.21241v1
• Date: Fri, 21 Aug 2026 15:51:55 GMT
• Title: Eavesdropper-Blind Remote State Preparation and Applications to Quantum Public-Key Encryption
• Abstract summary: We study a weaker form of remote state preparation, which we call eavesdropper-blind remote state preparation (EB-RSP)<n>EB-RSP requires blindness only against external observers who see the transcript of the honest protocol, rather than against the quantum server itself.<n>We show that two-message EB-RSP already suffices to construct quantum public-key encryption with classical public keys and quantumtext ciphers.
• Score: 46.01993114598725
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Remote state preparation (RSP) is a central primitive in quantum cryptography, enabling classical parties to remotely construct quantum states using only classical communication. As a result, RSP serves as a key building block in numerous protocols involving classical clients and quantum servers, allowing classical parties to leverage the advantages offered by powerful quantum computers. All known constructions of RSP rely on strong cryptographic assumptions, typically variants of trapdoor claw-free functions (TCFs). In this work, we initiate the study of a weaker form of remote state preparation, which we call eavesdropper-blind remote state preparation (EB-RSP). Informally, EB-RSP requires blindness only against external observers who see the transcript of the honest protocol, rather than against the quantum server itself. Despite this relaxed adversarial model, the resulting notion remains sufficient for useful cryptographic applications. In particular, we show that two-message EB-RSP already suffices to construct quantum public-key encryption with classical public keys and quantum ciphertexts. We then construct two-message EB-RSP protocols from specific one-way group actions, yielding a first step toward RSP-type primitives based on assumptions that do not rely on trapdoors. Finally, we observe that existing RSP constructions are likely naturally adaptable to the two-message EB-RSP notion; we demonstrate this explicitly for a concrete TCF-based RSP construction.

Related papers

• Hybrid Authentication Protocols for Advanced Quantum Networks [0.6827423171182154]
  We introduce a new authentication approach that combines hardware assumptions, particularly Physical Unclonable Functions (PUFs), along with quantum properties of non-local states, such as local indistinguishability, to achieve provable security in entanglement-based protocols.<n>These protocols are suitable for implementation across various platforms, particularly photonics-based ones, and offer a practical and flexible solution to the long-standing challenge of authentication in quantum communication networks.
  arXiv  Detail & Related papers  (2025-04-15T18:51:22Z)
• On the Power of Oblivious State Preparation [14.520515990983897]
  Oblivious State Preparation (OSP) is a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client. Results help to ''explain'' the use of public-key cryptography in approaches to establishing a ''classical leash'' on a quantum server.
  arXiv  Detail & Related papers  (2024-11-06T19:58:53Z)
• A Feasible Semi-quantum Private Comparison Based on Entanglement Swapping of Bell States [5.548873288570182]
  We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states. Security analysis shows that our protocol is resilient to both external and internal attacks. Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
  arXiv  Detail & Related papers  (2023-05-12T13:28:44Z)
• Preparing Remote States for Genuine Quantum Networks [0.0]
  We introduce and experimentally study a quantum resource that we call the RSP capability. This resource validates all the static and dynamic elements required to enable genuine quantum networks. Results help reveal the quantum advantages that emerge when networking RSP is in play.
  arXiv  Detail & Related papers  (2022-12-05T00:46:43Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.