Related papers: Quantum Private Membership Aggregation

Quantum Private Membership Aggregation

URL: http://arxiv.org/abs/2401.16390v1
Date: Mon, 29 Jan 2024 18:32:19 GMT
Title: Quantum Private Membership Aggregation
Authors: Alptug Aytekin, Mohamed Nomeir, Sennur Ulukus
Abstract summary: We consider the problem of private set membership aggregation of $N$ parties by using an entangled quantum state. We propose an encoding algorithm that maps the classical information into distinguishable quantum states, along with a decoding algorithm that exploits the distinguishability of the mapped states.
Score: 35.16231062731263
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We consider the problem of private set membership aggregation of $N$ parties by using an entangled quantum state. In this setting, the $N$ parties, which share an entangled state, aim to \emph{privately} know the number of times each element (message) is repeated among the $N$ parties, with respect to a universal set $\mathcal{K}$. This problem has applications in private comparison, ranking, voting, etc. We propose an encoding algorithm that maps the classical information into distinguishable quantum states, along with a decoding algorithm that exploits the distinguishability of the mapped states. The proposed scheme can also be used to calculate the $N$ party private summation modulo $P$.

Related papers

Beyond Yao's Millionaires: Secure Multi-Party Computation of Non-Polynomial Functions [5.625796693054093]
We present an unconditionally secure $N$-party comparison scheme based on Shamir secret sharing. Each party holds a private number and aims to ascertain the greatest number among the $N$ available private numbers without revealing its input.
arXiv Detail & Related papers (2024-10-22T13:22:08Z)
A generalized framework for quantum state discrimination, hybrid algorithms, and the quantum change point problem [3.4683494246563606]
We present a hybrid quantum-classical algorithm based on semidefinite programming to calculate the maximum reward when the states are pure and have efficient circuits. We give now-possible algorithms for the quantum change point identification problem which asks, given a sequence of quantum states, determine the time steps when the quantum states changed.
arXiv Detail & Related papers (2023-12-07T03:42:40Z)
Private Membership Aggregation [32.97918488607827]
We consider the problem of private membership aggregation (PMA) In PMA, a user counts the number of times a certain element is stored in a system of independent parties. We propose achievable schemes for each of the four variants of the problem based on the concept of cross-subspace alignment.
arXiv Detail & Related papers (2023-09-07T17:33:27Z)
Generating $k$ EPR-pairs from an $n$-party resource state [5.617510227362658]
We show that LOCC protocols can create EPR-pairs between any $k$ disjoint pairs of parties. We also prove some lower bounds, for example showing that if $k=n/2$ then the parties must have at least $Omega(loglog n)$ qubits each.
arXiv Detail & Related papers (2022-11-11T22:18:27Z)
Scalable Differentially Private Clustering via Hierarchically Separated Trees [82.69664595378869]
We show that our method computes a solution with cost at most $O(d3/2log n)cdot OPT + O(k d2 log2 n / epsilon2)$, where $epsilon$ is the privacy guarantee. Although the worst-case guarantee is worse than that of state of the art private clustering methods, the algorithm we propose is practical.
arXiv Detail & Related papers (2022-06-17T09:24:41Z)
Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
arXiv Detail & Related papers (2022-06-07T18:00:01Z)
Communication Complexity of Private Simultaneous Quantum Messages Protocols [0.609170287691728]
We study the advantages of quantum communication and prior entanglement of the private simultaneous quantum messages model. We show that the privacy condition inevitably increases the communication cost in the two-party PSQM model. We also show an exponential gap between the communication complexity of PSQM protocols with shared entangled states and with shared random strings.
arXiv Detail & Related papers (2021-05-15T03:08:01Z)
On Distributed Differential Privacy and Counting Distinct Elements [52.701425652208734]
We study the setup where each of $n$ users holds an element from a discrete set. The goal is to count the number of distinct elements across all users.
arXiv Detail & Related papers (2020-09-21T04:13:34Z)
Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
Locally Private Hypothesis Selection [96.06118559817057]
We output a distribution from $mathcalQ$ whose total variation distance to $p$ is comparable to the best such distribution. We show that the constraint of local differential privacy incurs an exponential increase in cost. Our algorithms result in exponential improvements on the round complexity of previous methods.
arXiv Detail & Related papers (2020-02-21T18:30:48Z)

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