Quantum private comparison over noisy channels
From MaRDI portal
Publication:496932
DOI10.1007/S11128-015-1032-YzbMATH Open1327.81170arXiv1407.6323OpenAlexW1484396638MaRDI QIDQ496932FDOQ496932
Authors: Vikesh Siddhu, Arvind 
Publication date: 23 September 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: Quantum Private Comparison (QPC) allows us to protect private information during its comparison. In the past various three-party quantum protocols have been proposed that claim to work well under noisy conditions. Here we tackle the problem of QPC under noise. We analyze the EPR-based protocol under depolarizing noise, bit flip and phase flip noise. We show how noise affects the robustness of the EPR-based protocol. We then present a straightforward protocol based on CSS codes to perform QPC which is robust against noise and secure under general attacks.
Full work available at URL: https://arxiv.org/abs/1407.6323
Recommendations
- Orthogonal-state-based and semi-quantum protocols for quantum private comparison in noisy environment
- An efficient quantum private comparison of equality over collective-noise channels
- Comment on ``Efficient and feasible quantum private comparison of equality against the collective amplitude damping noise
- Fault-tolerant quantum private comparison protocol
- Quantum private comparison against decoherence noise
Cites Work
- On lattices, learning with errors, random linear codes, and cryptography
- Quantum cryptography based on Bell’s theorem
- Multiple-particle interference and quantum error correction
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum secret sharing without entanglement
- An efficient two-party quantum private comparison protocol with decoy photons and two-photon entanglement
- Quantum cryptography using any two nonorthogonal states
- Quantum cryptography without Bell’s theorem
- Proof of security of quantum key distribution with two-way classical communications
- Quantum secret sharing
- Multiparty Computation from Somewhat Homomorphic Encryption
- Simple quantum protocols for the millionaire problem with a semi-honest third party
- New quantum private comparison protocol using EPR pairs
- Arbitrated Quantum Signature Schemes: Attacks and Security
- Time-shift attack in practical quantum cryptosystems
- Universally composable two-party and multi-party secure computation
- Quantum measurement and extended Feynman path integral
Cited In (11)
- Comment on ``Efficient and feasible quantum private comparison of equality against the collective amplitude damping noise
- Quantum private comparison protocol without a third party
- Quantum private comparison against decoherence noise
- Fault-tolerate quantum private comparison based on GHZ states and ECC
- Quantum private magnitude comparison
- Efficient and feasible quantum private comparison of equality against the collective amplitude damping noise
- Quantum gate-based quantum private comparison
- Secure quantum private comparison
- Quantum private comparison without classical computation
- Quantum private comparison protocol based on the entanglement swapping between \(\chi ^+\) state and W-class state
- A robust and efficient quantum private comparison of equality based on the entangled swapping of GHZ-like state and \(\chi^+\) state
This page was built for publication: Quantum private comparison over noisy channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496932)
