{"title":"基于树的量子匿名排序协议","authors":"Justin Joseph, Syed Taqi Ali","doi":"10.1007/s11128-024-04476-w","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tree-based quantum anonymous ranking protocol\",\"authors\":\"Justin Joseph, Syed Taqi Ali\",\"doi\":\"10.1007/s11128-024-04476-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>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.</p></div>\",\"PeriodicalId\":746,\"journal\":{\"name\":\"Quantum Information Processing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Information Processing\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11128-024-04476-w\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MATHEMATICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04476-w","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
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.
期刊介绍:
Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.