Quantum Encryption with Certified Deletion, Revisited: Public Key,
Attribute-Based, and Classical Communication
- URL: http://arxiv.org/abs/2105.05393v1
- Date: Wed, 12 May 2021 01:41:46 GMT
- Title: Quantum Encryption with Certified Deletion, Revisited: Public Key,
Attribute-Based, and Classical Communication
- Authors: Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
- Abstract summary: Broadbent and Islam proposed a quantum cryptographic primitive called quantum encryption with certified deletion.
In this primitive, a receiver in possession of a quantum ciphertext can generate a classical certificate that the encrypted message is deleted.
Although deletion certificates are privately verifiable, which means a verification key for a certificate has to be kept secret, in the definition by Broadbent and Islam, we can also consider public verifiability.
- Score: 10.973034520723957
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive
called quantum encryption with certified deletion. In this primitive, a
receiver in possession of a quantum ciphertext can generate a classical
certificate that the encrypted message is deleted. Although their construction
is information-theoretically secure, it is limited to the setting of one-time
symmetric key encryption (SKE), where a sender and receiver have to share a
common key in advance and the key can be used only once. Moreover, the sender
has to generate a quantum state and send it to the receiver over a quantum
channel in their construction. Although deletion certificates are privately
verifiable, which means a verification key for a certificate has to be kept
secret, in the definition by Broadbent and Islam, we can also consider public
verifiability.
In this work, we present various constructions of encryption with certified
deletion.
- Quantum communication case: We achieve (reusable-key) public key encryption
(PKE) and attribute-based encryption (ABE) with certified deletion. Our PKE
scheme with certified deletion is constructed assuming the existence of IND-CPA
secure PKE, and our ABE scheme with certified deletion is constructed assuming
the existence of indistinguishability obfuscation and one-way function. These
two schemes are privately verifiable.
- Classical communication case: We also achieve PKE with certified deletion
that uses only classical communication. We give two schemes, a privately
verifiable one and a publicly verifiable one. The former is constructed
assuming the LWE assumption in the quantum random oracle model. The latter is
constructed assuming the existence of one-shot signatures and extractable
witness encryption.
Related papers
- Revocable Quantum Digital Signatures [57.25067425963082]
We define and construct digital signatures with revocable signing keys from the LWE assumption.
In this primitive, the signing key is a quantum state which enables a user to sign many messages.
Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
arXiv Detail & Related papers (2023-12-21T04:10:07Z) - Quantum Key Leasing for PKE and FHE with a Classical Lessor [19.148581164364387]
We consider the problem of secure key leasing, also known as revocable cryptography.
This problem aims to leverage unclonable nature of quantum information.
We construct a secure key leasing scheme to lease a decryption key of a (classical) public-key, homomorphic encryption scheme.
arXiv Detail & Related papers (2023-10-22T15:25:29Z) - Robust Quantum Public-Key Encryption with Applications to Quantum Key
Distribution [16.06159998475861]
Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel.
It has two main advantages: (i) The key is unconditionally hidden to the eyes of any attacker, and (ii) its security assumes only the existence of authenticated classical channels.
We propose a two-message QKD protocol that satisfies everlasting security, assuming only the existence of quantum-secure one-way functions.
arXiv Detail & Related papers (2023-04-06T11:14:55Z) - 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) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18: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) - Certified Everlasting Functional Encryption [10.973034520723957]
Computational security in cryptography has a risk that computational assumptions underlying the security are broken in the future.
A nice compromise (intrinsic to quantum) is certified everlasting security, which roughly means the following.
Although several cryptographic primitives, such as commitments and zero-knowledge, have been made certified everlasting secure, there are many other important primitives that are not known to be certified everlasting secure.
arXiv Detail & Related papers (2022-07-28T04:15:26Z) - 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) - Single-Shot Secure Quantum Network Coding for General Multiple Unicast
Network with Free One-Way Public Communication [56.678354403278206]
We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network.
Our code correctly transmits quantum states when there is no attack.
It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
arXiv Detail & Related papers (2020-03-30T09:25:13Z) - 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.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.