Tree-based quantum anonymous ranking protocol

We propose an improved quantum anonymous multiparty multidata ranking (QAMMR) protocol based on the binary search tree. In a QAMMR protocol, multiple participants get the ranking of their data without disclosing their identity. It is done with the help of a semi-honest third party (TP), who may try to access others' data without deviating from the protocol. In existing algorithms, each participant will get to know the count of all data possessed by all participants by the end of the protocol. They are used to calculate the rank of each data each participant possesses. Our protocol achieves the same goal of finding rank with better security and fewer quantum particles. Our protocol determines the rank of a data by disclosing various ranges of data. We use substantially fewer quantum particles to make the protocol more efficient and practically feasible, especially when the range of the data is much higher than the total number of data. Further, we analyze the protocol and prove it is secure against internal and external attacks.