Two-way Unclonable Encryption with a vulnerable sender

• URL: http://arxiv.org/abs/2010.10827v1
• Date: Wed, 21 Oct 2020 08:35:49 GMT
• Title: Two-way Unclonable Encryption with a vulnerable sender
• Authors: Daan Leermakers and Boris Skoric
• Abstract summary: Unclonable Encryption, introduced by Gottesman in 2003, is a quantum protocol that guarantees the secrecy of a successfully transferred classical message. We propose an Unclonable Encryption protocol with the additional property that the sender's key material is allowed to leak even in the case of an unsuccessful run.
• Score: 2.355458445741348
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unclonable Encryption, introduced by Gottesman in 2003, is a quantum protocol that guarantees the secrecy of a successfully transferred classical message even when all keys leak at a later time. We propose an Unclonable Encryption protocol with the additional property that the sender's key material is allowed to leak even in the case of an unsuccessful run. This extra feature makes it possible to achieve secure quantum encryption even when one of the parties is unable to protect its keys against after-protocol theft. Such an asymmetry occurs e.g. in case of server-client scenarios, where the client device is resource-constrained and/or located in a hostile environment. Our protocol makes use of a bidirectional quantum channel in a manner similar to the two-way protocol LM05. Bob sends random qubit states to Alice. Alice flips the states in a way that depends on the message and a shared key, and sends the resulting states back to Bob. Bob recovers Alice's message by measuring the flips. We prove that our protocol satisfies the definition of unclonable encryption and additionally that the message remains secure even if all of Alice's keys leak after the protocol. Furthermore, we show that some of the key material can be safely re-used. Our security proof is formulated in terms of diamond norms, which makes it composable, and allows for noisy quantum channels. We work out the details only for the asymptotics in the limit of long messages. As a side result we construct a two-way QKD scheme with a high key rate. We show that its key rate is higher than the rate of the two-way QKD scheme LM05 proven for the case of independent channel noise.

Related papers

• 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)
• 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)
• 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)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Measurement-device-independent QSDC protocol using Bell and GHZ states on quantum simulator [0.0]
  Quantum Secure Direct Communication (QSDC) protocol eliminates the necessity of key, encryption and ciphertext transmission. It is a unique quantum communication scheme where secret information is transmitted directly over a quantum communication channel. We make use of measurement-device-independent (MDI) protocol in this scheme where all the measurements of quantum states during communication are performed by a third party.
  arXiv  Detail & Related papers  (2020-07-01T07:47:59Z)
• Qubit-based Unclonable Encryption with Key Recycling [2.355458445741348]
  We re-visit Gottesman's Unclonable Encryption as introduced by Gottesman in 2003. We introduce a qubit-based prepare-and-measure Unclonable Encryption scheme with re-usable keys. We provide a security proof based on the diamond norm distance, taking noise into account.
  arXiv  Detail & Related papers  (2020-04-08T16:08:14Z)
• 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)
• Asymptotic security analysis of teleportation based quantum cryptography [0.0]
  We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun 283, 184] is secure against all types of individual and collective attacks. We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks.
  arXiv  Detail & Related papers  (2020-02-10T17:54:15Z)

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.