Abstract Asymmetric encryption has some important applications in the field of communication. In classical computers, most public key encryption schemes are designed based on computational assumption. In other words, they can ensure computational security. When the computing power is large enough, it will pose a threat to these encryption schemes. We propose a quantum public key encryption scheme which based on properties of quantum physics. Our scheme realizes encryption and decryption with few resources and does not rely on any computational assumption. The key in our scheme consists of classical bits and qubits. Where the private key are classical bit and public key are qubits. The public key are generated through private key. We analyze the performance and security of the scheme. Our scheme ensures the information-theoretic secure and can be implemented easily.
Abstract Asymmetric encryption has some important applications in the field of communication. In classical computers, most public key encryption schemes are designed based on computational assumption. In other words, they can ensure computational security. When the computing power is large enough, it will pose a threat to these encryption schemes. We propose a quantum public key encryption scheme which based on properties of quantum physics. Our scheme realizes encryption and decryption with few resources and does not rely on any computational assumption. The key in our scheme consists of classical bits and qubits. Where the private key are classical bit and public key are qubits. The public key are generated through private key. We analyze the performance and security of the scheme. Our scheme ensures the information-theoretic secure and can be implemented easily.
Quantum public-key encryption (PKE), where public-keys and/or ciphertexts can be quantum states, is an important primitive in quantum cryptography. Unlike classical PKE (e.g., RSA or ECC), quantum PKE can leverage quantumsecure cryptographic assumptions or the principles of quantum mechanics for security. It has great potential in providing for secure cryptographic systems under potentially weaker assumptions than is possible classically. In addition, it is of both practical and theoretical interest, opening the door to novel cryptographic systems not possible with classical information alone. While multiple quantum PKE schemes have been proposed, they require a large number of qubits acting coherently, and are not practical on current noisy quantum devices. In this paper, we design a practical quantum PKE scheme, taking into account the constraints of current NISQ devices. Specifically, we design a PKE scheme with quantum-classical public keys and classical ciphertexts, that is noise-resilient and only requires a small number of qubits acting coherently. In addition, our design provides tradeoffs in terms of efficiency and the number of qubits that are required.
Abstract The quantum asymmetric key encryption (QAKE) is a prominent research frontier in quantum information. In this paper, we propose a quantum asymmetric key encryption scheme based on the exact quantum search algorithm (QAKE-EQSA). Leveraging EQSA’s deterministic amplitude amplification and a unique three-oracle structure, comprising an auxiliary oracle, its inverse, and a message-dependent oracle, the proposed QAKE-EQSA scheme guarantees a 100% decryption success rate. Within the scheme, the public key is generated by applying the auxiliary oracle to a specific quantum superposition state and subsequently shared via a public key center; the private key is constructed using a phase-matching diffusion operator; and the message is encoded into a unique target state within the search space, ensuring that only the legitimate receiver can recover it exactly. Furthermore, we demonstrate a 4-qubit instantiation of the QAKE-EQSA scheme on the MindQuantum platform and conduct a comprehensive analysis encompassing its security, qubit efficiency, and practical performance. Our analysis demonstrates that, in comparison to several existing QPKE schemes, the proposed QAKE-EQSA scheme achieves exact decryption, optimal qubit efficiency, and enhanced resistance against quantum attacks.
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.
Here, we propose a quantum asymmetric key cryptography scheme using Grover's quantum search algorithm. In the proposed scheme, Alice generates a pair of public and private keys, keeps the private keys safe, and only discloses public keys to the outside. Bob uses Alice's public key to send a secret message to Alice and Alice uses her private key to decrypt the secret message. Furthermore, we discuss the safety of quantum asymmetric key encryption techniques based on quantum mechanical properties.
Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme.
It is an important question to find constructions of quantum cryptographic protocols which rely on weaker computational assumptions than classical protocols. Recently, it has been shown that oblivious transfer and multi-party computation can be constructed from one-way functions, whereas this is impossible in the classical setting in a black-box way. In this work, we study the question of building quantum public-key encryption schemes from one-way functions and even weaker assumptions. Firstly, we revisit the definition of IND-CPA security to this setting. Then, we propose three schemes for quantum public-key encryption from one-way functions, pseudorandom function-like states with proof of deletion and pseudorandom function-like states, respectively.