Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Quantum-message-oriented public-key encryption scheme beyond computational hypothesis

Min Liang, Li Yang

Published Apr 21, 2012• 1 citation
Publisher

Abstract

We propose two definitions of quantum one-way transformation and quantum trapdoor one-way transformation beyond computational hypothesis, and give four examples. Then, we present a general way to construct a quantum public-key encryption scheme from a quantum one-way transformation and a quantum trapdoor oneway transformation, and give a concrete example which is quantum-message-oriented. The security of this kind of encryption schemes is based on the one-way property of quantum one-way transformation and quantum trapdoor one-way transformation, and this kind of schemes is information-theoretically secure.

DOI
10.1117/12.922500

Related papers

Quantum public-key cryptosystems based on induced trapdoor one-way transformations

Li Yang, Min Liang, Bao Li +2 more

A concept named induced trapdoor one-way quantum transformation (OWQT) has been introduced, and a theoretical framework of public-key encryption (PKE) of quantum message is presented based on it. Then several kinds of quantum public-key encryption (QPKE) protocols, such as quantum version PKE of RSA, ElGamal, Goldwasser-Micali, elliptic curve, McEliece, Niederreiter and Okamoto-Tanaka-Uchiyama, are given within this framework. Though all of these protocols are only computationally secure, the last three are probably secure in post-quantum era. Besides, theoretical frameworks for public-key authentication and signature of quantum message are also given based on the induced trapdoor OWQT. As examples, a public-key authentication protocol of quantum message based on SN-S authentication scheme and two quantum digital signature protocols based on RSA and McEliece algorithms respectively are presented.

arXiv:1012.5249•Dec 23, 2010•20 citations

Quantum Public-Key Encryption with Information Theoretic Security

Jiangyou Pan, Li Yang

We propose a definition for the information theoretic security of a quantum public-key encryption scheme, and present bit-oriented and two-bit-oriented encryption schemes satisfying our security definition via the introduction of a new public-key algorithm structure. We extend the scheme to a multi-bitoriented one, and conjecture that it is also information theoretically secure, depending directly on the structure of our new algorithm.

arXiv:1006.0354•Jun 2, 2010•17 citations

Quantum Public-Key Encryption Schemes Based on Conjugate Coding

Li Yang, Biyao Yang, Chong Xiang

We present several quantum public-key encryption (QPKE) protocols designed with conjugate coding single-photon string, thus may be realized in laboratory with nowadays techniques. Two of these schemes are orienting one-bit message, and are extended to two kinds of QPKE schemes orienting multi-bits. The novel structure of these protocols ensures they are information-theoretically secure with, probably, a bound greater than any given polynomial of $n$. Finally, we describe a way to conceal the classical part of the public key with quantum state, this idea is expected to enhance a scheme to be information-theoretically secure.

arXiv:1112.0421•Dec 2, 2011•6 citations

Quantum public-key cryptosystem with two indistinguishable quantum states

Jiangyou Pan, Yang Li

We propose a definition for the information theoretic security of a quantum public-key encryption scheme, and present bit-oriented and two-bit-oriented encryption schemes satisfying our security definition via the introduction of a new public-key algorithm structure. We extend the scheme to a multi-bitoriented one, and conjecture that it is also information theoretically secure, depending directly on the structure of our new algorithm.

•Jun 2, 2010•0 citations

Quantum trapdoor functions from classical one-way functions

Andrea Coladangelo

We formalize and study the notion of a quantum trapdoor function. This is an efficiently computable unitary that takes as input a "public" quantum state and a classical string $x$, and outputs a quantum state. This map is such that (i) it is hard to invert, in the sense that it is hard to recover $x$ given the output state (and many copies of the public state), and (ii) there is a classical trapdoor that allows efficient inversion. We show that a quantum trapdoor function can be constructed from any quantum-secure one-way function. A direct consequence of this result is that, assuming just the existence of quantum-secure one-way functions, there exists a public-key encryption scheme with a (pure) quantum public key.

arXiv:2302.12821•Feb 24, 2023•20 citations

Quantum Public-Key Cryptosystems

Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama

Abstract. This paper presents a new paradigm of cryptography, quantum public-key cryptosystems. In quantum public-key cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) poly-time Turing (QPT) machines and only classical channels (i.e., no quantum channels) are employed. A quantum trapdoor one-way function, f, plays an essential role in our system, in which a QPT machine can compute f with high probability, any QPT machine can invert f with negligible probability, and a QPT machine with trapdoor data can invert f. This paper proposes a concrete scheme for quantum public-key cryptosystems: a quantum public-key encryption scheme or quantum trapdoor one-way function. The security of our schemes is based on the computational assumption (over QPT machines) that a class of subset-sum problems is intractable against any QPT machine. Our scheme is very efficient and practical if Shor’s discrete logarithm algorithm is efficiently realized on a quantum machine.

•Nov 30, 2006•1 citation
We propose two definitions of quantum one-way transformation and quantum trapdoor one-way transformation beyond computational hypothesis, and give four examples. Then, we present a general way to construct a quantum public-key encryption scheme from a quantum one-way transformation and a quantum trapdoor oneway transformation, and give a concrete example which is quantum-message-oriented. The security of this kind of encryption schemes is based on the one-way property of quantum one-way transformation and quantum trapdoor one-way transformation, and this kind of schemes is information-theoretically secure.
A concept named induced trapdoor one-way quantum transformation (OWQT) has been introduced, and a theoretical framework of public-key encryption (PKE) of quantum message is presented based on it. Then several kinds of quantum public-key encryption (QPKE) protocols, such as quantum version PKE of RSA, ElGamal, Goldwasser-Micali, elliptic curve, McEliece, Niederreiter and Okamoto-Tanaka-Uchiyama, are given within this framework. Though all of these protocols are only computationally secure, the last three are probably secure in post-quantum era. Besides, theoretical frameworks for public-key authentication and signature of quantum message are also given based on the induced trapdoor OWQT. As examples, a public-key authentication protocol of quantum message based on SN-S authentication scheme and two quantum digital signature protocols based on RSA and McEliece algorithms respectively are presented.
We present several quantum public-key encryption (QPKE) protocols designed with conjugate coding single-photon string, thus may be realized in laboratory with nowadays techniques. Two of these schemes are orienting one-bit message, and are extended to two kinds of QPKE schemes orienting multi-bits. The novel structure of these protocols ensures they are information-theoretically secure with, probably, a bound greater than any given polynomial of nnn. Finally, we describe a way to conceal the classical part of the public key with quantum state, this idea is expected to enhance a scheme to be information-theoretically secure.
We formalize and study the notion of a quantum trapdoor function. This is an efficiently computable unitary that takes as input a "public" quantum state and a classical string xxx, and outputs a quantum state. This map is such that (i) it is hard to invert, in the sense that it is hard to recover xxx given the output state (and many copies of the public state), and (ii) there is a classical trapdoor that allows efficient inversion. We show that a quantum trapdoor function can be constructed from any quantum-secure one-way function. A direct consequence of this result is that, assuming just the existence of quantum-secure one-way functions, there exists a public-key encryption scheme with a (pure) quantum public key.
Abstract. This paper presents a new paradigm of cryptography, quantum public-key cryptosystems. In quantum public-key cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) poly-time Turing (QPT) machines and only classical channels (i.e., no quantum channels) are employed. A quantum trapdoor one-way function, f, plays an essential role in our system, in which a QPT machine can compute f with high probability, any QPT machine can invert f with negligible probability, and a QPT machine with trapdoor data can invert f. This paper proposes a concrete scheme for quantum public-key cryptosystems: a quantum public-key encryption scheme or quantum trapdoor one-way function. The security of our schemes is based on the computational assumption (over QPT machines) that a class of subset-sum problems is intractable against any QPT machine. Our scheme is very efficient and practical if Shor’s discrete logarithm algorithm is efficiently realized on a quantum machine.