{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T05:26:15Z","timestamp":1767072375202,"version":"3.48.0"},"reference-count":35,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T00:00:00Z","timestamp":1766880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62201252"],"award-info":[{"award-number":["62201252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["NS2025030"],"award-info":[{"award-number":["NS2025030"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Jiangsu Province Engineering Research Center of IntelliSense Technology and System"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Simultaneous ascending auctions find extensive applications in spectrum licensing and advertising space allocation. However, existing quantum sealed-bid auction protocols suffer from dual limitations: they cannot support multi-item simultaneous bidding scenarios, and their reliance on complex quantum resources along with requiring full quantum operational capabilities from bidders fails to accommodate practical constraints of quantum resource-limited users. To address these challenges, this paper proposes a multi-party semi-quantum simultaneous ascending auction protocol based on single-particle states. The protocol employs a trusted honest third party (HTP) responsible for quantum state generation, distribution, and security verification. Bidders determine their groups through quantum measurements and privately encode their bid vectors. Upon successful HTP authentication, each bidder obtains a unique identity code. During the bidding phase, HTP dynamically updates quantum sequences, allowing bidders to submit bids for multiple items by performing only simple unitary operations. HTP announces the highest bid for each item in real time and iteratively generates auction sequences until no new highest bid emerges, thereby achieving simultaneous ascending auctions for multiple items. It acts as a quantum-secured signaling layer, ensuring unconditional security for bid transmission and identity verification while maintaining classical auction logic. Quantum circuit simulations validate the protocol\u2019s feasibility with current technology while satisfying critical security requirements, including anonymity, verifiability, non-repudiation, and privacy preservation. It provides a scalable semi-quantum auction solution for resource-constrained scenarios.<\/jats:p>","DOI":"10.3390\/e28010039","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T06:25:51Z","timestamp":1766989551000},"page":"39","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Party Semi-Quantum Simultaneous Ascending Auction Protocol Based on Single-Particle States"],"prefix":"10.3390","volume":"28","author":[{"given":"Xiuqi","family":"Wu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China"}]},{"given":"Baichang","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7207-6456","authenticated-orcid":false,"given":"Yue","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Engineering, Nanjing Institute of Technology, Nanjing 211167, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4356-8945","authenticated-orcid":false,"given":"Yunguang","family":"Han","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1038\/s41586-022-04891-y","article-title":"A device-independent quantum key distribution system for distant users","volume":"607","author":"Zhang","year":"2022","journal-title":"Nature"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1038\/s41467-024-45876-x","article-title":"Practical high-dimensional quantum key distribution protocol over deployed multicore fiber","volume":"15","author":"Zahidy","year":"2024","journal-title":"Nat. Commun."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.scib.2021.11.002","article-title":"One-step quantum secure direct communication","volume":"67","author":"Sheng","year":"2022","journal-title":"Sci. Bull."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"125201","DOI":"10.1088\/1612-202X\/ad053f","article-title":"Measurement-device-independent quantum secure multiparty summation based on entanglement swapping","volume":"20","author":"Sun","year":"2023","journal-title":"Laser Phys. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s11128-021-03327-2","article-title":"Cluster-state-based quantum secret sharing for users with different abilities","volume":"20","author":"Li","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2300273","DOI":"10.1002\/qute.202300273","article-title":"Quantum Secret Reconstruction","volume":"7","author":"Ma","year":"2024","journal-title":"Adv. Quantum Technol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"022333","DOI":"10.1103\/PhysRevA.94.022333","article-title":"Self-tallying quantum anonymous voting","volume":"94","author":"Wang","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1109\/TNSM.2018.2882535","article-title":"In broker we trust: A double-auction approach for resource allocation in NFV markets","volume":"15","author":"Borjigin","year":"2018","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2042","DOI":"10.1109\/TIFS.2019.2955793","article-title":"SEAL: Sealed-bid auction without auctioneers","volume":"15","author":"Bag","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TCSS.2022.3151693","article-title":"Multiple-Walrasian auction mechanism for tree valuation service in NFV market","volume":"10","author":"Borjigin","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"5352","DOI":"10.1109\/TCSI.2023.3314646","article-title":"Measurement-based quantum sealed-bid auction","volume":"70","author":"Ye","year":"2023","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1098\/rsta.2003.1227","article-title":"Quantum technology: The second quantum revolution","volume":"361","author":"Dowling","year":"2003","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci."},{"key":"ref_13","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_14","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","article-title":"Quantum cryptography: Public key distribution and coin tossing","volume":"560","author":"Bennett","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3949","DOI":"10.1016\/j.physa.2008.02.071","article-title":"Quantum auctions: Facts and myths","volume":"387","author":"Piotrowski","year":"2008","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1016\/j.optcom.2009.01.026","article-title":"Secure quantum sealed-bid auction","volume":"282","author":"Naseri","year":"2009","journal-title":"Opt. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"4014","DOI":"10.1016\/j.optcom.2009.06.070","article-title":"Cryptanalysis and improvement of a secure quantum sealed-bid auction","volume":"282","author":"Qin","year":"2009","journal-title":"Opt. Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"4167","DOI":"10.1016\/j.optcom.2009.07.010","article-title":"Improved secure quantum sealed-bid auction","volume":"282","author":"Yang","year":"2009","journal-title":"Opt. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3194","DOI":"10.1016\/j.optcom.2010.04.019","article-title":"Secure quantum sealed-bid auction with post-confirmation","volume":"283","author":"Zhao","year":"2010","journal-title":"Opt. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1088\/0253-6102\/61\/6\/05","article-title":"Attacks and improvement of quantum sealed-bid auction with EPR pairs","volume":"61","author":"Liu","year":"2014","journal-title":"Commun. Theor. Phys."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1007\/s11128-015-1202-y","article-title":"Multiparty quantum sealed-bid auction using single photons as message carrier","volume":"15","author":"Liu","year":"2016","journal-title":"Quantum Inf. Process."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11128-017-1805-6","article-title":"An economic and feasible Quantum Sealed-bid Auction protocol","volume":"17","author":"Zhang","year":"2018","journal-title":"Quantum Inf. Process."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4221","DOI":"10.1109\/TCSI.2021.3103857","article-title":"Quantum sealed-bid auction without a trusted third party","volume":"68","author":"Shi","year":"2021","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"ref_26","first-page":"414","article-title":"Anonymous quantum sealed-bid auction","volume":"69","author":"Shi","year":"2021","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2100212","DOI":"10.1109\/TQE.2022.3148664","article-title":"A feasible quantum sealed-bid auction scheme without an auctioneer","volume":"3","author":"Shi","year":"2022","journal-title":"IEEE Trans. Quantum Eng."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3478","DOI":"10.1007\/s10773-021-04921-x","article-title":"Secure three-party semi-quantum summation using single photons","volume":"60","author":"Zhang","year":"2021","journal-title":"Int. J. Theor. Phys."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Yang, C.W., Tsai, C.W., Chen, C.A., and Lin, J. (2023). Robust Semi-Quantum Summation over a Collective-Dephasing Noise Channel. Mathematics, 11.","DOI":"10.3390\/math11061405"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2300347","DOI":"10.1002\/qute.202300347","article-title":"Semi-Quantum Secure Multiparty Summation and its Applications to Anonymous Auction and Ranking","volume":"7","author":"Ye","year":"2024","journal-title":"Adv. Quantum Technol."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1140\/epjqt\/s40507-024-00247-9","article-title":"Different secure semi-quantum summation models without measurement","volume":"11","author":"Tian","year":"2024","journal-title":"EPJ Quantum Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/s11128-022-03459-z","article-title":"Two-party secure semiquantum summation against the collective-dephasing noise","volume":"21","author":"Ye","year":"2022","journal-title":"Quantum Inf. Process."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/s10773-022-05158-y","article-title":"Three-party secure semiquantum summation without entanglement among quantum user and classical users","volume":"61","author":"Hu","year":"2022","journal-title":"Int. J. Theor. Phys."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1086\/262118","article-title":"Putting auction theory to work: The simultaneous ascending auction","volume":"108","author":"Milgrom","year":"2000","journal-title":"J. Political Econ."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1109\/LCOMM.2024.3354250","article-title":"Employing single photons for measurement-device-independent quantum secure direct communication with identity authentication","volume":"28","author":"Li","year":"2024","journal-title":"IEEE Commun. Lett."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/39\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T05:23:49Z","timestamp":1767072229000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,28]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["e28010039"],"URL":"https:\/\/doi.org\/10.3390\/e28010039","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,12,28]]}}}