Revocable Cryptography from Learning with Errors
- URL: http://arxiv.org/abs/2302.14860v3
- Date: Thu, 12 Oct 2023 16:18:20 GMT
- Title: Revocable Cryptography from Learning with Errors
- Authors: Prabhanjan Ananth and Alexander Poremba and Vinod Vaikuntanathan
- Abstract summary: 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.
- Score: 61.470151825577034
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum cryptography leverages many unique features of quantum information in
order to construct cryptographic primitives that are oftentimes impossible
classically. In this work, 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. We
define and construct several fundamental cryptographic primitives with
key-revocation capabilities, namely pseudorandom functions, secret-key and
public-key encryption, and even fully homomorphic encryption, assuming the
quantum subexponential hardness of the learning with errors problem. Central to
all our constructions is our approach for making the Dual-Regev encryption
scheme (Gentry, Peikert and Vaikuntanathan, STOC 2008) revocable.
Related papers
- Relating Quantum Tamper-Evident Encryption to Other Cryptographic Notions [0.0]
A quantum tamper-evident encryption scheme is a non-interactive symmetric-key encryption scheme mapping classical messages to quantum ciphertexts.
This quantum cryptographic primitive was first introduced by Gottesman in 2003.
We further our understanding of tamper-evident encryption by formally relating it to other cryptographic primitives in an information-theoretic setting.
arXiv Detail & Related papers (2024-11-05T02:20:29Z) - Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.
This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
arXiv Detail & Related papers (2024-10-17T02:37:40Z) - 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) - Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
We show that targetcollapsing enables publiclyverifiable deletion (PVD)
We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
arXiv Detail & Related papers (2023-03-15T15:00:20Z) - Encryption with Quantum Public Keys [1.7725414095035827]
We study the question of building quantum public-key encryption schemes from one-way functions and even weaker assumptions.
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.
arXiv Detail & Related papers (2023-03-09T16:17:19Z) - A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography.
In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
arXiv Detail & Related papers (2022-05-07T03:15:15Z) - Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
We construct the first fully homomorphic encryption scheme with certified deletion.
Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
arXiv Detail & Related papers (2022-03-03T10:07:32Z) - 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) - 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) - Classical Homomorphic Encryption for Quantum Circuits [2.1756081703276]
We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys.
We show that it is possible to construct such a scheme directly from a quantum secure classical homomorphic encryption scheme with certain properties.
arXiv Detail & Related papers (2017-08-07T14:27:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.