Upper bounds on the leakage of private data and operational approach to markovianity

• URL: http://arxiv.org/abs/2107.10737v2
• Date: Sun, 15 May 2022 09:07:20 GMT
• Title: Upper bounds on the leakage of private data and operational approach to markovianity
• Authors: Karol Horodecki, Micha{\l} Studzi\'nski, Ryszard P. Kostecki, Omer Sakarya, Dong Yang
• Abstract summary: We quantify the consequences of a private key leakage and private randomness generated during quantum key distribution. We focus on irreducible private states, showing that their two-way distillable key is non-lockable. We show that an invertible map is non-CP-divisible if and only if there exists a state whose the key witnessed by a particular privacy witness increases in time.
• Score: 3.123265021642315
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We quantify the consequences of a private key leakage and private randomness generated during quantum key distribution. We provide simple lower bounds on the one-way distillable key after the leakage has been detected. We also show that the distributed private randomness does not drop by more than twice the number of qubits of the traced-out system. We further focus on irreducible private states, showing that their two-way distillable key is non-lockable. We then strengthen this result by referring to the idea of recovery maps. We further consider the action of special case of side-channels on some of the private states. Finally, we connect the topic of (non)markovian dynamics with that of hacking. In particular, we show that an invertible map is non-CP-divisible if and only if there exists a state whose the key witnessed by a particular privacy witness increases in time. This complements the recent result of J. Kolody\'nski et al. [Phys. Rev. A 101, 020303(R) (2020)] where the log-negativity was connected with the (non)markovianity of the dynamics.

Related papers

• No-go theorem for probabilistic one-way secret-key distillation [4.079147243688764]
  Probability one-way distillable secret key is equal to the largest expected rate at which perfect secret key bits can be probabilistically distilled from a bipartite state. We prove that an arbitrary state in this set cannot be used for probabilistic one-way secret-key distillation.
  arXiv  Detail & Related papers  (2024-04-01T18:01:15Z)
• Cost of quantum secret key [4.3012765978447565]
  We study the properties of a quantum state and device through the lens of a quantity that we call the key of formation. The main result of our paper is that the regularized key of formation is an upper bound on the key cost of a quantum state. We show that the key cost is bounded from below by the regularized relative entropy of entanglement.
  arXiv  Detail & Related papers  (2024-02-26T20:22:06Z)
• Towards Unclonable Cryptography in the Plain Model [0.6827423171182154]
  Two most notable examples of unclonable cryptography are copy-protection (CP) and unclonable encryption (UE) A core ingredient of these protocols is the so-called monogamy-of-entanglement (MoE) property. We present two conjectures that would allow first to show that CP of point functions exists in the plain model, with different challenge distributions, and then that UE with unclonable indistinguishability security exists in the plain model.
  arXiv  Detail & Related papers  (2023-11-28T10:25:22Z)
• Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks [72.51255282371805]
  We prove a privacy bound for the KL divergence between model distributions on worst-case neighboring datasets. We find that this KL privacy bound is largely determined by the expected squared gradient norm relative to model parameters during training.
  arXiv  Detail & Related papers  (2023-10-31T16:13:22Z)
• Adaptive Privacy Composition for Accuracy-first Mechanisms [55.53725113597539]
  Noise reduction mechanisms produce increasingly accurate answers. Analysts only pay the privacy cost of the least noisy or most accurate answer released. There has yet to be any study on how ex-post private mechanisms compose. We develop privacy filters that allow an analyst to adaptively switch between differentially private and ex-post private mechanisms.
  arXiv  Detail & Related papers  (2023-06-24T00:33:34Z)
• 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)
• Relaxed bound on performance of quantum key repeaters and secure content of generic private and independent bits [3.0367864044156088]
  We place a novel bound on quantum key repeater rate. We show that the repeated key of the so called key-correlated states can exceed twice the one-way distillable entanglement.
  arXiv  Detail & Related papers  (2022-06-02T11:30:01Z)
• 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)
• Smoothed Differential Privacy [55.415581832037084]
  Differential privacy (DP) is a widely-accepted and widely-applied notion of privacy based on worst-case analysis. In this paper, we propose a natural extension of DP following the worst average-case idea behind the celebrated smoothed analysis. We prove that any discrete mechanism with sampling procedures is more private than what DP predicts, while many continuous mechanisms with sampling procedures are still non-private under smoothed DP.
  arXiv  Detail & Related papers  (2021-07-04T06:55:45Z)
• Towards practical differentially private causal graph discovery [74.7791110594082]
  Causal graph discovery refers to the process of discovering causal relation graphs from purely observational data. We present a differentially private causal graph discovery algorithm, Priv-PC, which improves both utility and running time compared to the state-of-the-art.
  arXiv  Detail & Related papers  (2020-06-15T18:30:41Z)
• Limitations for private randomness repeaters [1.145412128763251]
  We show that any state containing perfect, directly accessible, private key (a private state) is an independent state. We provide an upper bound on the rate of repeated randomness in this scenario, similar to the one derived for private key repeaters. In the case of restricted class of operations, we provide also a bound on repeated randomness which holds for arbitrary states.
  arXiv  Detail & Related papers  (2020-03-16T09:51: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.