arXiv:0903.5156

Public-key cryptography based on bounded quantum reference frames

Lawrence M. Ioannou, Michele Mosca

Published Mar 30, 2009• 6 citations

Abstract

We demonstrate that the framework of bounded quantum reference frames has application to building quantum-public-key cryptographic protocols and proving their security. Thus, the framework we introduce can be seen as a public-key analogue of the framework of Bartlett et al. (Phys. Rev. A 70, 032307), where a private shared reference frame is shown to have cryptographic application. The protocol we present in this paper is an identification scheme, which, like a digital signature scheme, is a type of authentication scheme. We prove that our protocol is both reusable and secure under the honest-verifier assumption. Thus, we also demonstrate that secure reusable quantum-public-key authentication is possible to some extent.

DOI: 10.48550/arxiv.0903.5156

Related papers

Unconditionally-secure and reusable public-key authentication

Lawrence M. Ioannou, Michele Mosca

We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that unconditionally-secure and reusable public-key authentication is possible in principle with (pure-state) public keys.

arXiv:1108.2887Aug 14, 20111 citation

Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem

Liu, Le-Ran, He, Min-Quan, Zhang, Dan-Bo +1 more

We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key cryptography system, where the public key is a set of local density matrices generated from the private key, a global quantum state. This construction uniquely eliminates the need for trusted third parties, pre-shared secrets, or authenticated classical channels for public key distribution, making a significant departure from symmetric protocols like quantum key distribution. We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries. The proof proceeds by a formal reduction, demonstrating that a successful forgery would imply an efficient quantum algorithm for the QMA-complete Consistency of Quantum Marginal Problem~(QMP). We further analyze the efficiency of verification using partial quantum state tomography, establishing the protocol's theoretical robustness and outlining a path towards practical implementation

arXiv:2506.16904Jun 20, 20250 citations

Decoherence-full subsystems and the cryptographic power of a private shared reference frame

Stephen D. Bartlett, Terry Rudolph, Robert W. Spekkens

We show that private shared reference frames can be used to perform private quantum and private classical communication over a public quantum channel. Such frames constitute a type of private shared correlation, distinct from private classical keys or shared entanglement, useful for cryptography. We present optimally efficient schemes for private quantum and classical communication given a finite number of qubits transmitted over an insecure channel and given a private shared Cartesian frame and∕or a private shared reference ordering of the qubits. We show that in this context, it is useful to introduce the concept of a decoherence-full subsystem, wherein every state is mapped to the completely mixed state under the action of the decoherence.

arXiv:quant-ph/0403161Physical Review ASep 10, 200461 citations

Quantum key management

Richard Hughes

Innovations for quantum key management harness quantum communications to form a cryptography system within a public key infrastructure framework. In example implementations, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a Merkle signature scheme (using Winternitz one-time digital signatures or other one-time digital signatures, and Merkle hash trees) to constitute a cryptography system. More generally, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a hash-based signature scheme. This provides a secure way to identify, authenticate, verify, and exchange secret cryptographic keys. Features of the quantum key management innovations further include secure enrollment of users with a registration authority, as well as credential checking and revocation with a certificate authority, where the registration authority and/or certificate authority can be part of the same system as a trusted authority for quantum key distribution.

Jan 23, 20230 citations

Approaches to Practical Quantum Cryptography

Peter Yuen

There are various practical obstacles in quantum cryptography. These include the problems that arise in implementing quantum cryptographic protocols with current and near-term technology, and those that come with the development and security analysis of new protocols. In this work, we examine a few of these obstacles and, for each one, we highlight an approach that aims to mitigate it. We start by examining the setting of device-independence, with oblivious transfer in the bounded-quantum-storage-model as the primitive of interest. The typical approach to enabling device-independence is the use of a Bell-inequality violation, which requires a strict non-communication assumption that is practically difficult to enforce. We develop and analyze the security of a device-independent oblivious transfer protocol that replaces the Bell-inequality violation approach with a computational assumption, thereby relaxing the non-communication assumption. Our second topic examines the problem of noise in a quantum money scheme. We show how to achieve noise-tolerance in the public-key setting. Our scheme can be seen as a generalization of the [AC12] scheme: a valid banknote is now a subspace state possibly affected by noise, and verification is performed by using classical oracles to check for membership in "larger spaces." Additionally, a banknote in our scheme is minted by preparing conjugate coding states and applying a unitary. For our last topic, we consider the general task of proving security against a specious adversary, which is the quantum analogue of the classical semi-honest adversary. A useful feature of specious adversaries is that security against them can guarantee security against stronger adversaries [DNS12]. This motivates the search for a canonical specious adversary, where proving security against such an adversary guarantees security against the entire class of specious adversaries. Within a restricted setting, we define a particular specious adversary and show that it satisfies our definition of canonical.

Jul 7, 20250 citations

A public-key quantum group blind signature scheme based on single-qubit rotations

Fuyao Tian, Dianjun Lu, Cheng‐Xiang Wang +1 more

Abstract With the continuous development of quantum technology, the quantum signature as an application of quantum cryptography has received great attention. In this paper, we propose a public-key quantum group blind signature scheme based on single-qubit rotations. In this scheme, the group manager generates a public key. Each group member randomly generates his own private key according to the public key. The signer uses his private key and random sequence to generate the signature. The verifier uses the public key to verify the correctness of the quantum signature. The public and private keys can be reused, which simplifies the key management of the signature system. In this scheme, the random sequence is used to enhance the security of the scheme. At the same time, the quantum efficiency is improved by using single-qubit rotations. The security analysis shows that our scheme can ensure the security of the keys, the unforgeability and the non-deniability of the signature.

Laser Physics LettersJan 24, 20247 citations