Public Key Encryption (PKE) scheme based on isogeny star has been proposed to be against the attack of the quantum computer for several years. But, there is no report about provable security PKE scheme based on isogeny star. In this paper, we propose a PKE scheme based on isogeny star and prove the security of the scheme in the random oracle .
Public Key Encryption (PKE) scheme based on isogeny star has been proposed to be against the attack of the quantum computer for several years. But, there is no report about provable security PKE scheme based on isogeny star. In this paper, we propose a PKE scheme based on isogeny star and prove the security of the scheme in the random oracle .
This paper investigates a quantum version of McEliece public-key encryption (PKE) scheme, and analyzes its security. As is well known, the security of classical McEliece PKE is not stronger than the onewayness of related classical one-way function. We prove the security of quantum McEliece PKE ranks between them. Moreover, we propose the double-encryption technique to improve its security, and the security of the improved scheme is proved to be between the original scheme and the quantum one-time pad.
This paper provides a sufficient condition to construct timed-release public-key encryption (TRPKE), where the constructed TRPKE scheme guarantees strong security against malicious time servers, proposed by Chow et al., and strong security against malicious receivers, defined by Cathalo et al., in the random oracle model if the component IBE scheme is IND-ID-CPA secure, the component PKE scheme is IND-ID-CPA secure, and the PKE scheme satisfies negligible γ-uniformity for every public key. Although Chow et al. proposed a strongly secure TRPKE scheme, which is concrete in the standard model, to the best of our knowledge, the proposed construction is the first generic one for TRPKE that guarantees strong security even in the random oracle model.
In the quantum era, the advent of quantum computers poses significant threats to the security of current cryptosystems. Therefore, designing quantum-resistant cryptoschemes becomes important to guarantee information security. This work concentrates on the development of the post-quantum public key encryption (PKE) scheme. Non-commutative cryptography (NCC) has entered the field of post-quantum cryptography. We utilize the TSPEM problem with asymmetric structures (which serve as a potential candiate for resisting quantum attacks) to construct two PKE schemes which are demonstrated to be CPA security under the DTSPEM assumption. By representing the plaintext as a matrix, these schemes can effectively encrypt a significant amount of information in a single operation. Assuming an equal amount of messages for encryption, the proposed schemes acheive superior efficiency compared to existing PKE schemes. Structurally, our systems exhibit a level of synchronization and coexistence due to the distinct public keys $ (P) $ and ciphertexts $ (C_{1}) .Theefficiencyanalysisisconductedbycomparingknownschemesfromtheaspectofspecificcryptographicindicators.Generally,theproposedonesofferseveraladvantagesincludingprovablesecurity,highefficiency,potentialquantum−resistant,andrelativeeaseofimplementation;alongwithsynchronizationandcoexistence.OurinvestigationhasestablishedthefeasibilityofconstructingPKEschemesbasedontheTSPEMproblem,specificallyforasymmetriccommunicationscenarios.ThepreliminaryresultspavethewayforfurtherexplorationoftheTSPEMproblem ' $s potential in developing other cryptosystems suitable for quantum computing environments.
Since the convenience and advancement of cloud applications, many users (e.g., companies or individuals) adopt remote cloud services to reduce the local storage overload and computing consumption. However, before transferring them to the cloud server, users always encrypt outsourced data for the privacy of important data, which deprives flexible usage of these data. Public key encryption with keyword search (PEKS) undoubtedly offers a precise resolution to this issue. Unfortunately, most PEKS schemes cannot fight against quantum computing attackers, which is increasingly a research hotspot. To achieve postquantum security and privacy-preserving search function, we propose a quantum-resistant PEKS scheme named IsoqurPEKS. Our proposed instantiation satisfies basic semantic security indistinguishable against chosen keyword attack (IND-CKA), and IsoqurPEKS is proved to be secure under the security model. Furthermore, we compare IsoqurPEKS with the other eight current PEKS schemes with respect to security properties, communication, and computation costs. The comparison results indicate that the proposed scheme has the best security and performance among the nine PEKS schemes.
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.
We construct a quantum public key encryption scheme from oneway functions in the random oracle model. While our construction only has indistinguishability against restricted adversaries, who perform individual attacks and can only make classical queries to the random oracle, it possesses two practical advantages that were not achieved in previous works. First, legitimate participants can discard noisy quantum public keys. Second, the scheme only requires products of single-qubit states, and it does not require quantum computing or quantum memory for legitimate participants. Although the security does not hold against adversaries capable of large-scale quantum computation, we believe that our protocol is well-suited for the near-term stage of the quantum era.