保密多方量子排序问题的研究

摘要

Secure multi-party ranking problem is used to rank n private integers without leaking further information. It is an extended problem of secure two-party comparing problem. A secure multi-party quantum ranking protocol in semi-honest model is presented based on the a quantum implicit module n ＋ 1 addition. The security for multi-parties of the protocol is analyzed.%保密多方排序问题用于多方在不泄漏自己保密数值的前提下安全计算出自己保密数值在这n个数值中的排名情况，该问题是保密两方比较问题的扩展问题．本文设计了一个半诚实模型下的基于量子隐式模n＋1加法保密多方量子排序协议，并且详细地分析了该协议对于多方的安全性．