Limitations for private randomness repeaters

• URL: http://arxiv.org/abs/2003.07086v2
• Date: Sat, 18 Jul 2020 12:26:24 GMT
• Title: Limitations for private randomness repeaters
• Authors: Karol Horodecki, Ryszard P. Kostecki, Roberto Salazar, and Micha{\l} Studzi\'nski
• Abstract summary: 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.
• Score: 1.145412128763251
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cryptographic protocols are often based on the two main resources: private randomness and private key. In this paper, we develop a relationship between these two resources. First, we show that any state containing perfect, directly accessible, private key (a private state) is a particular case of the state containing perfect, directly accessible, private randomness (an independent state). We then demonstrate a fundamental limitation on the possibility of transferring the privacy of random bits in quantum networks with an intermediate repeater station. More precisely, we provide an upper bound on the rate of repeated randomness in this scenario, similar to the one derived for private key repeaters. This bound holds for states with positive partial transposition. We further demonstrate the power of this upper bound by showing a gap between the localisable and the repeated private randomness for separable Werner states. In the case of restricted class of operations, we provide also a bound on repeated randomness which holds for arbitrary states.

Related papers

• Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms [67.94856074923571]
  This paper introduces a novel proof technique based on a multi-player communication game.<n>We show that winning this communication game requires transmitting information proportional to the number of over-active users.<n>We show that this communication-theoretic technique generalizes to broad classes of problems, yielding lower bounds for private medians, quantiles, and max-select.
  arXiv  Detail & Related papers  (2026-02-12T17:49:07Z)
• Gluing Randomness via Entanglement: Tight Bound from Second Rényi Entropy [5.664171868626635]
  We identify entanglement as the key resource that enables local random unitaries to generate global random states by effectively gluing randomness across the system.<n>We present a novel method for generating pseudorandom states in multipartite systems from a locally entangled state via pseudorandom unitaries in each of parties.
  arXiv  Detail & Related papers  (2026-01-23T05:17:44Z)
• Differentially Private Random Feature Model [52.468511541184895]
  We produce a differentially private random feature model for privacy-preserving kernel machines. We show that our method preserves privacy and derive a generalization error bound for the method.
  arXiv  Detail & Related papers  (2024-12-06T05:31:08Z)
• Private and Robust States for Distributed Quantum Sensing [1.2499537119440245]
  Distributed quantum sensing enables the estimation of multiple parameters encoded in spatially separated probes. In such settings it is natural to not want to give away more information than is necessary. We use the concept of privacy with respect to a function, ensuring that only information about the target function is available to all the parties.
  arXiv  Detail & Related papers  (2024-07-31T15:46:50Z)
• Enhanced Privacy Bound for Shuffle Model with Personalized Privacy [32.08637708405314]
  Differential Privacy (DP) is an enhanced privacy protocol which introduces an intermediate trusted server between local users and a central data curator. It significantly amplifies the central DP guarantee by anonymizing and shuffling the local randomized data. This work focuses on deriving the central privacy bound for a more practical setting where personalized local privacy is required by each user.
  arXiv  Detail & Related papers  (2024-07-25T16:11:56Z)
• The Rate-Distortion-Perception Trade-off: The Role of Private Randomness [53.81648040452621]
  We show that private randomness is not useful if the compression rate is lower than the entropy of the source. We characterize the corresponding rate-distortion trade-off and show that private randomness is not useful if the compression rate is lower than the entropy of the source.
  arXiv  Detail & Related papers  (2024-04-01T13:36:01Z)
• Optimal Private Discrete Distribution Estimation with One-bit Communication [63.413106413939836]
  We consider a private discrete distribution estimation problem with one-bit communication constraint. We characterize the first-orders of the worst-case trade-off under the one-bit communication constraint. These results demonstrate the optimal dependence of the privacy-utility trade-off under the one-bit communication constraint.
  arXiv  Detail & Related papers  (2023-10-17T05:21:19Z)
• A privacy-preserving publicly verifiable quantum random number generator [48.7576911714538]
  We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits. limitations on computing power can restrict an end-user's ability to perform such verification.
  arXiv  Detail & Related papers  (2023-05-18T12:13:48Z)
• 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)
• Nonparametric extensions of randomized response for private confidence sets [51.75485869914048]
  This work derives methods for performing nonparametric, nonasymptotic statistical inference for population means under the constraint of local differential privacy (LDP) We present confidence intervals (CI) and time-uniform confidence sequences (CS) for $mustar$ when only given access to the privatized data.
  arXiv  Detail & Related papers  (2022-02-17T16:04:49Z)
• Improved device-independent randomness expansion rates using two sided randomness [3.4376560669160394]
  A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one. We investigate the possible improvement that could be gained using the two-sided randomness. We also consider a modified protocol in which the input randomness is recycled.
  arXiv  Detail & Related papers  (2021-03-12T19:49:17Z)
• Graph-Homomorphic Perturbations for Private Decentralized Learning [64.26238893241322]
  Local exchange of estimates allows inference of data based on private data. perturbations chosen independently at every agent, resulting in a significant performance loss. We propose an alternative scheme, which constructs perturbations according to a particular nullspace condition, allowing them to be invisible.
  arXiv  Detail & Related papers  (2020-10-23T10:35:35Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• Successive Refinement of Privacy [38.20887036580742]
  This work examines how much randomness is needed to achieve local differential privacy (LDP) A motivating scenario is providing multiple levels of privacy to multiple analysts, either for distribution or for heavy-hitter estimation. We show that we cannot reuse random keys over time while preserving privacy of each user.
  arXiv  Detail & Related papers  (2020-05-24T04:16:01Z)

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.