Related papers: Efficient Quantum Public-Key Encryption From Learning With Errors

Efficient Quantum Public-Key Encryption From Learning With Errors

URL: http://arxiv.org/abs/2105.12790v1
Date: Wed, 26 May 2021 18:48:26 GMT
Title: Efficient Quantum Public-Key Encryption From Learning With Errors
Authors: Javad Doliskani
Abstract summary: Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) For limited number of public keys, the proposed scheme is information-theoretically secure.
Score: 1.8021287677546958
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) which is equivalent, under quantum polynomial-time reductions, to the Learning With Errors (LWE) problem. For limited number of public keys (roughly linear in the security parameter), the proposed scheme is information-theoretically secure. For polynomial number of public keys, breaking the scheme is as hard as solving the LWE problem. The public keys in our scheme are quantum states of size $\tilde{O}(n)$ qubits. The key generation and decryption algorithms require $\tilde{O}(n)$ qubit operations while the encryption algorithm takes $O(1)$ qubit operations.

Related papers

Public-Key Encryption with Quantum Keys [11.069434965621683]
We study the notion of quantum public-key encryption (qPKE) where keys are allowed to be quantum states. We show that computational assumptions are necessary to build quantum public-key encryption.
arXiv Detail & Related papers (2023-06-13T11:32:28Z)
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions [12.45203887838637]
We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical.
arXiv Detail & Related papers (2023-04-04T13:57:17Z)
Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z)
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments [8.834776091974218]
We show the first public key encryption scheme from cryptographic emphnon-abelian group actions. We construct the scheme through a new abstraction called swap-trapdoor function pairs. We give a simple and efficient compiler that converts the flavor of quantum bit commitments.
arXiv Detail & Related papers (2022-10-12T07:40:05Z)
Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z)
Recovering AES Keys with a Deep Cold Boot Attack [91.22679787578438]
Cold boot attacks inspect the corrupted random access memory soon after the power has been shut down. In this work, we combine a novel cryptographic variant of a deep error correcting code technique with a modified SAT solver scheme to apply the attack on AES keys. Our results show that our methods outperform the state of the art attack methods by a very large margin.
arXiv Detail & Related papers (2021-06-09T07:57:01Z)
Quantum Fully Homomorphic Encryption by Integrating Pauli One-time Pad with Quaternions [4.182969308816531]
Quantum fully homomorphic encryption (QFHE) allows to evaluate quantum circuits on encrypted data. We present a novel QFHE scheme, which extends Pauli one-time pad encryption by relying on the quaternion of SU(2).
arXiv Detail & Related papers (2020-12-08T04:54:02Z)
A quantum encryption design featuring confusion, diffusion, and mode of operation [0.0]
We propose a non-OTP quantum encryption scheme utilizing a quantum state creation process to encrypt messages. As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features.
arXiv Detail & Related papers (2020-10-06T22:23:30Z)
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
arXiv Detail & Related papers (2020-09-29T08:41:53Z)
Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
arXiv Detail & Related papers (2020-03-23T18:23:12Z)

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