A Semi-Quantum Protocol for Multi-Party Simultaneous Ascending Auctions

This paper proposes a semi-quantum protocol for multi-item simultaneous ascending auctions, addressing limitations of existing quantum auctions that require complex resources and full quantum capabilities from bidders. Utilizing single-particle states and a trusted third party (HTP) for state management, our protocol allows resource-constrained bidders to participate using only simple operations. The HTP dynamically updates quantum sequences and announces leading bids iteratively until convergence. Simulations confirm practical feasibility with current technology and demonstrate security guarantees including anonymity, verifiability, and non-repudiation, providing a scalable solution for real-world auction environments.

• Publication year

  2025

• Venue

  2025 2nd International Symposium on AI and Cybersecurity (ISAICS)

• Publication date

  2025-10-24

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1109/ISAICS66888.2025.11350211
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Semi‐Quantum Secure Multiparty Summation and its Applications to Anonymous Auction and Ranking

  2024cited by this paper
• Practical high-dimensional quantum key distribution protocol over deployed multicore fiber

  2024cited by this paper
• Different secure semi-quantum summation models without measurement

  2024cited by this paper
• Employing Single Photons for Measurement-Device-Independent Quantum Secure Direct Communication With Identity Authentication

  2024cited by this paper
• Measurement-Based Quantum Sealed-Bid Auction

  2023cited by this paper
• Measurement-device-independent quantum secure multiparty summation based on entanglement swapping

  2023cited by this paper
• Quantum Secret Reconstruction

  2023cited by this paper
• Robust Semi-Quantum Summation over a Collective-Dephasing Noise Channel

  2023cited by this paper
• Multiple-Walrasian Auction Mechanism for Tree Valuation Service in NFV Market

  2023cited by this paper
• Three-Party Secure Semiquantum Summation without Entanglement Among Quantum User and Classical Users

  2022cited by this paper
• Anonymous Quantum Sealed-Bid Auction

  2022cited by this paper
• A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

  2022cited by this paper
• Two-party secure semiquantum summation against the collective-dephasing noise

  2022cited by this paper
• One-step quantum secure direct communication.

  2021cited by this paper
• Quantum Sealed-Bid Auction Without a Trusted Third Party

  2021cited by this paper
• Secure Three-Party Semi-quantum Summation Using Single Photons

  2021cited by this paper
• Cluster-state-based quantum secret sharing for users with different abilities

  2021cited by this paper
• A device-independent quantum key distribution system for distant users

  2021cited by this paper
• SEAL: Sealed-Bid Auction Without Auctioneers

  2020cited by this paper
• In Broker We Trust: A Double-Auction Approach for Resource Allocation in NFV Markets

  2018cited by this paper
• Self-tallying quantum anonymous voting

  2016cited by this paper
• Multiparty quantum sealed-bid auction using single photons as message carrier

  2015cited by this paper
• Attacks and Improvement of Quantum Sealed-Bid Auction with EPR Pairs

  2014cited by this paper
• Quantum cryptography: Public key distribution and coin tossing

  2014cited by this paper
• Secure quantum sealed-bid auction with post-confirmation

  2010cited by this paper
• Cryptanalysis and improvement of a secure quantum sealed-bid auction

  2009cited by this paper
• Improved secure quantum sealed-bid auction

  2009cited by this paper
• Secure quantum sealed-bid auction

  2009cited by this paper
• Quantum Auctions: Facts and Myths ⋆

  2007cited by this paper
• Putting Auction Theory to Work: The Simultaneous Ascending Auction

  1999cited by this paper
• A fast quantum mechanical algorithm for database search

  1996cited by this paper
• Algorithms for quantum computation: discrete logarithms and factoring

  1994cited by this paper

• No citing papers are available for this paper.