Stream privacy amplification for quantum cryptography
- URL: http://arxiv.org/abs/2111.14108v2
- Date: Sun, 3 Jul 2022 08:33:06 GMT
- Title: Stream privacy amplification for quantum cryptography
- Authors: Yizhi Huang, Xingjian Zhang, Xiongfeng Ma
- Abstract summary: Existing security proofs require accumulating a large number of raw key bits for privacy amplification.
By modifying the security proof based on quantum error correction, we develop a stream privacy amplification scheme.
This scheme can output the final key in a stream way, prevent error from spreading, and hence can put privacy amplification before information reconciliation.
- Score: 1.3535770763481902
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Privacy amplification is the key step to guarantee the security of quantum
communication. The existing security proofs require accumulating a large number
of raw key bits for privacy amplification. This is similar to block ciphers in
classical cryptography that would delay the final key generation since an
entire block must be accumulated before privacy amplification. Moreover, any
leftover errors after information reconciliation would corrupt the entire
block. By modifying the security proof based on quantum error correction, we
develop a stream privacy amplification scheme, which resembles the classical
stream cipher. This scheme can output the final key in a stream way, prevent
error from spreading, and hence can put privacy amplification before
information reconciliation. The stream scheme can also help to enhance the
security of trusted-relay quantum networks. Inspired by the connection between
stream ciphers and quantum error correction in our security analysis, we
further develop a generic information-theoretic tool to study the security of
classical encryption algorithms.
Related papers
- Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC)
We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
arXiv Detail & Related papers (2024-02-13T12:12:39Z) - 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) - Privacy and correctness trade-offs for information-theoretically secure
quantum homomorphic encryption [19.014535120129345]
Quantum homomorphic encryption allows computation by a server directly on encrypted data.
For such constructions to be possible, quantum homomorphic encryption must satisfy two privacy properties.
Our work unravels fundamental trade-offs between circuit privacy, data privacy and correctness for a broad family of quantum homomorphic encryption protocols.
arXiv Detail & Related papers (2022-05-24T15:02:34Z) - Semantic Security with Infinite Dimensional Quantum Eavesdropping
Channel [19.275181096881454]
We propose a new proof method for direct coding theorems for wiretap channels.
The method yields errors that decay exponentially with increasing block lengths.
It provides a guarantee of a quantum version of semantic security.
arXiv Detail & Related papers (2022-05-16T13:25:56Z) - 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) - An Evolutionary Pathway for the Quantum Internet Relying on Secure
Classical Repeaters [64.48099252278821]
We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle.
In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes.
We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
arXiv Detail & Related papers (2022-02-08T03:24:06Z) - Privacy amplification scheme based on composite coding [2.9848983009488936]
We propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes.
The information-theoretic bound for the extraction of the key is obvious in composite coding.
arXiv Detail & Related papers (2021-09-15T07:58:09Z) - A practical quantum encryption protocol with varying encryption
configurations [0.0]
We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states.
The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
arXiv Detail & Related papers (2021-01-22T20:09:03Z) - 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) - Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies.
We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived.
This is the first quantum protocol that can be used against the most general adversaries.
arXiv Detail & Related papers (2020-03-20T17:56:14Z)
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.