Tree-based quantum anonymous ranking protocol

DOI10.1007/S11128-024-04476-WMaRDI QIDQ6852837zbMATH OpenFDO

Authors Justin Joseph, Syed Taqi Ali

Publication date 25 February 2026

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

Full work available at URL https://doi.org/10.1007/S11128-024-04476-W

zbMATH Keywords

quantum anonymous rankingquantum multiparty computationquantum secure ranking

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• A novel quantum anonymous ranking protocol
• A protocol for the quantum private comparison of equality with \(\chi \)-type state
• An efficient two-party quantum private comparison protocol with decoy photons and two-photon entanglement
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Multi-party quantum private comparison protocol with an almost-dishonest third party using GHZ states
• Novel two-party quantum private comparison via quantum walks on circle
• Quantum anonymous ranking and selection with verifiability
• Quantum private comparison using genuine four-particle entangled states
• Secure quantum private comparison of equality based on asymmetric \(W\) state

This page was built for publication: Tree-based quantum anonymous ranking protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852837)