Reexamination of the realtime protection for user privacy in practical quantum private query

• URL: http://arxiv.org/abs/2407.19147v1
• Date: Sat, 27 Jul 2024 02:19:35 GMT
• Title: Reexamination of the realtime protection for user privacy in practical quantum private query
• Authors: Chun-Yan Wei, Xiao-Qiu Cai, Tian-Yin Wang,
• Abstract summary: Quantum private query (QPQ) is the quantum version for symmetrically private retrieval. The user privacy in QPQ is generally guarded in the non-realtime and cheat sensitive way. We show that honesty checking of inner participant should be dealt more carefully in for example the choosing of checking qubits.
• Score: 0.24578723416255746
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Quantum private query (QPQ) is the quantum version for symmetrically private retrieval. However, the user privacy in QPQ is generally guarded in the non-realtime and cheat sensitive way. That is, the dishonest database holder's cheating to elicit user privacy can only be discovered after the protocol is finished (when the user finds some errors in the retrieved database item). Such delayed detection may cause very unpleasant results for the user in real-life applications. Current efforts to protect user privacy in realtime in existing QPQ protocols mainly use two techniques, i.e., adding an honesty checking on the database or allowing the user to reorder the qubits. We reexamine these two kinds of QPQ protocols and find neither of them can work well. We give concrete cheating strategies for both participants and show that honesty checking of inner participant should be dealt more carefully in for example the choosing of checking qubits. We hope such discussion can supply new concerns when detection of dishonest participant is considered in quantum multi-party secure computations.

Related papers

• Impossibility of Quantum Private Queries [0.0]
  Symmetric private information retrieval is a cryptographic task allowing a user to query a database and obtain exactly one entry without revealing to the owner of the database which element was accessed. We give an explicit attack against any cheat-sensitive symmetric private information retrieval protocol, showing that any protocol that is secure for the user cannot have non-trivial security guarantees for the owner of the database.
  arXiv  Detail & Related papers  (2025-01-22T12:42:28Z)
• Experimental Implementation of A Quantum Zero-Knowledge Proof for User Authentication [0.39845810840390733]
  A new interactive quantum zero-knowledge protocol for identity authentication is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate.
  arXiv  Detail & Related papers  (2024-01-17T19:00:00Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• A Feasible Semi-quantum Private Comparison Based on Entanglement Swapping of Bell States [5.548873288570182]
  We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states. Security analysis shows that our protocol is resilient to both external and internal attacks. Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
  arXiv  Detail & Related papers  (2023-05-12T13:28:44Z)
• A Randomized Approach for Tight Privacy Accounting [63.67296945525791]
  We propose a new differential privacy paradigm called estimate-verify-release (EVR) EVR paradigm first estimates the privacy parameter of a mechanism, then verifies whether it meets this guarantee, and finally releases the query output. Our empirical evaluation shows the newly proposed EVR paradigm improves the utility-privacy tradeoff for privacy-preserving machine learning.
  arXiv  Detail & Related papers  (2023-04-17T00:38:01Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Semiquantum private comparison based on Bell states without quantum measurements from the classical user [4.4053348026380235]
  We propose a novel semiquantum private comparison protocol based on Bell states. TP is assumed to be semi-honest in the sense that she may take all possible attacks to steal users' private inputs except conspiring with anyone. Our protocol can take advantage over previous SQPC protocols based on Bell states in qubit efficiency.
  arXiv  Detail & Related papers  (2022-05-10T14:32:53Z)
• 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)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Provably-secure symmetric private information retrieval with quantum cryptography [0.0]
  We propose using quantum key distribution (QKD) instead for a practical implementation, which can realise both the secure communication and shared randomness requirements. We prove that QKD maintains the security of the SPIR protocol and that it is also secure against any external eavesdropper.
  arXiv  Detail & Related papers  (2020-04-29T02:08:10Z)

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.