Multiplication triples from entangled quantum resources

• URL: http://arxiv.org/abs/2505.10385v1
• Date: Thu, 15 May 2025 15:06:32 GMT
• Title: Multiplication triples from entangled quantum resources
• Authors: Maxwell Gold, Eric Chitambar,
• Abstract summary: An efficient paradigm for multi-party computation (MPC) are protocols structured around access to shared pre-processed computational resources.<n>We present a novel approach for generating these correlations from entangled quantum graph states.<n>We prove perfect privacy for our protocol, assuming access to an ideal copy of the resource state.
• Score: 3.2074558838636262
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: An efficient paradigm for multi-party computation (MPC) are protocols structured around access to shared pre-processed computational resources. In this model, certain forms of correlated randomness are distributed to the participants prior to their computation. The shared randomness is then consumed in a computation phase that involves public communication with efficient round complexity, and the computation is secure in this second phase provided the initial correlations were distributed securely. Usually the latter requires some strong setup assumptions, such as a trusted dealer and private channels. We present a novel approach for generating these correlations from entangled quantum graph states and yield information-theoretic privacy guarantees that hold against a malicious adversary, with limited assumptions. Our primary contribution is a tripartite resource state and measurement-based protocol for extracting a binary multiplication triple, a special form of shared randomness that enables the private multiplication of a bit conjunction. Here, we employ a third party as a Referee and demand only an honest pair among the three parties. The role of this Referee is weaker than that of a Dealer, as the Referee learns nothing about the underlying shared randomness that is disseminated. We prove perfect privacy for our protocol, assuming access to an ideal copy of the resource state, an assumption that is based on the existence of graph state verification protocols. Finally, we demonstrate its application as a primitive for more complex Boolean functionalities such as 1-out-of-2 oblivious transfer (OT) and MPC for an arbitrary $N$-party Boolean function, assuming access to the proper broadcasting channel.

Related papers

• Augmented Shuffle Protocols for Accurate and Robust Frequency Estimation under Differential Privacy [4.527947047128005]
  We propose three concrete protocols providing DP and robustness against the two attacks.<n>Our first protocol generates the number of dummy values for each item from a binomial distribution.<n>Our second protocol significantly improves the utility of our first protocol by introducing a novel dummy-count distribution.
  arXiv  Detail & Related papers  (2025-04-10T01:06:05Z)
• Collaborative Prediction: Tractable Information Aggregation via Agreement [15.230281170730303]
  Two parties, who observe different features about the same instances, can interact to arrive at predictions that are more accurate than either could have obtained on their own.<n>Our protocols are efficient reductions to the problem of learning on each party's feature space alone.<n>We generalize our protocols to a decision theoretic setting with high dimensional outcome spaces.
  arXiv  Detail & Related papers  (2025-04-08T14:12:42Z)
• Experimental Secure Multiparty Computation from Quantum Oblivious Transfer with Bit Commitment [13.244842672008811]
  Secure multiparty computation can be realized using oblivious transfer as a primitive function. We present an experimental implementation of a quantum-secure quantum oblivious transfer protocol. In our experiments, two banks can identify common suspicious accounts without disclosing any other data.
  arXiv  Detail & Related papers  (2024-11-07T09:29:12Z)
• Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval [139.21955930418815]
  Cross-modal Retrieval methods build similarity relations between vision and language modalities by jointly learning a common representation space. However, the predictions are often unreliable due to the Aleatoric uncertainty, which is induced by low-quality data, e.g., corrupt images, fast-paced videos, and non-detailed texts. We propose a novel Prototype-based Aleatoric Uncertainty Quantification (PAU) framework to provide trustworthy predictions by quantifying the uncertainty arisen from the inherent data ambiguity.
  arXiv  Detail & Related papers  (2023-09-29T09:41:19Z)
• Learning versus Refutation in Noninteractive Local Differential Privacy [133.80204506727526]
  We study two basic statistical tasks in non-interactive local differential privacy (LDP): learning and refutation. Our main result is a complete characterization of the sample complexity of PAC learning for non-interactive LDP protocols.
  arXiv  Detail & Related papers  (2022-10-26T03:19:24Z)
• 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)
• Link Prediction on N-ary Relational Data Based on Relatedness Evaluation [61.61555159755858]
  We propose a method called NaLP to conduct link prediction on n-ary relational data. We represent each n-ary relational fact as a set of its role and role-value pairs. Experimental results validate the effectiveness and merits of the proposed methods.
  arXiv  Detail & Related papers  (2021-04-21T09:06:54Z)
• 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)
• 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)
• An Accurate, Scalable and Verifiable Protocol for Federated Differentially Private Averaging [0.0]
  We tackle challenges regarding the privacy guarantees provided to participants and the correctness of the computation in the presence of malicious parties. Our first contribution is a scalable protocol in which participants exchange correlated Gaussian noise along the edges of a network graph. Our second contribution enables users to prove the correctness of their computations without compromising the efficiency and privacy guarantees of the protocol.
  arXiv  Detail & Related papers  (2020-06-12T14:21:10Z)
• Client-Server Identification Protocols with Quantum PUF [1.4174475093445233]
  We propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs) The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice-versa. Unlike existing identification protocols based on Quantum Read-out PUFs which rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties.
  arXiv  Detail & Related papers  (2020-06-08T12:35:09Z)

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.