Quantum secure two-party Euclidean distance computation based on mutually unbiased bases

DOI10.1007/S11128-022-03611-9OpenAlexW4288081528WikidataQ114223646 ScholiaQ114223646MaRDI QIDQ2101544

Yin-Hong Cao

Publication date: 6 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-022-03611-9

zbMATH Keywords

mutually unbiased bases\(d\)-level quantum systemquantum secure multi-party geometry computationquantum secure two-party Euclidean distance computation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Quantum privacy-preserving two-party circle intersection protocol based on phase-encoded query

Cites Work

• Quantum cryptography: public key distribution and coin tossing
• Approximate joins for XML at label level
• A novel quantum scheme for secure two-party distance computation
• Comment on quantum private comparison protocols with a semi-honest third party
• A novel quantum solution to secure two-party distance computation
• ON MUTUALLY UNBIASED BASES
• An efficient two-party quantum private comparison protocol with decoy photons and two-photon entanglement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum secure two-party Euclidean distance computation based on mutually unbiased bases