Related papers: Privacy amplification scheme based on composite coding

Privacy amplification scheme based on composite coding

URL: http://arxiv.org/abs/2109.07139v1
Date: Wed, 15 Sep 2021 07:58:09 GMT
Title: Privacy amplification scheme based on composite coding
Authors: Wei Li and Shengmei Zhao
Abstract summary: 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.
Score: 2.9848983009488936
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding.

Related papers

Unified Mechanism-Specific Amplification by Subsampling and Group Privacy Amplification [54.1447806347273]
Amplification by subsampling is one of the main primitives in machine learning with differential privacy. We propose the first general framework for deriving mechanism-specific guarantees. We analyze how subsampling affects the privacy of groups of multiple users.
arXiv Detail & Related papers (2024-03-07T19:36:05Z)
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)
Randomized Key Encapsulation/Consolidation [3.8366697175402225]
This article bridges the gap between two topics used in sharing an encryption key: Key Consolidation and Quantum-safe Key Encapsulation. The proposed scheme adds to the complexity Eve faces in extracting useful data from leaked information. It can even encapsulate a Quantum-safe encryption key in the extreme case that no common randomness is available.
arXiv Detail & Related papers (2024-01-30T13:24:44Z)
Quantum-safe Encryption: A New Method to Reduce Complexity and/or Improve Security Level [3.8366697175402225]
This work presents some novel techniques to enhance an encryption scheme motivated by classical McEliece cryptosystem. Proposed techniques allow generating significantly larger keys, at the same time, with a much lower complexity, as compared to known post-quantum key generation techniques relying on randomization.
arXiv Detail & Related papers (2024-01-29T17:03: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)
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)
Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
arXiv Detail & Related papers (2022-07-19T05:47:30Z)
Stream privacy amplification for quantum cryptography [1.3535770763481902]
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.
arXiv Detail & Related papers (2021-11-28T11:19:09Z)
Absolutely Secure Distributed Superdense Coding: Entanglement Requirement for Optimality [0.0]
A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob. We construct a distributed dense coding method, which completely depicts absolutely secure one way quantum communication between many to one party.
arXiv Detail & Related papers (2021-11-01T16:29:04Z)
Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z)

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