Quantum sealed-bid auction protocol based on quantum secret sharing

Wang, Jing-Tao; Peng, Yun; Li, Wen; Li, Zhenzhen

doi:10.1007/s11128-022-03620-8

Cited by 7 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quantum technology is developing rapidly, with an increasing number of quantum multi-party secret sharing protocols [9][10][11][12][13][14][15][16][17][18] based on QKD networks being proposed. These QSS protocols afford the secure and confidential sharing of a secret parameter among the validator nodes, which unrelated parties cannot access outside the list of validator nodes (LR).…”

Section: Quantum Secret Sharing (Qss) Protocolmentioning

confidence: 99%

“…In each consensus cycle, the leader node uses the VDF to obtain a random number R. Each candidate node, i.e., validator nodes that have not been granted the bookkeeping right in a consensus round, utilizes the unique random number and its ID to calculate the hash value for competing for the bookkeeping right. The highest hash value holder is elected as the leader node, and the leader node's identity is shared secretly among the validator nodes through a quantum multi-party secret sharing protocol [9][10][11][12][13][14][15][16][17][18]. After the election of the new leader node LN+1, LN+1 starts taking over the transaction queue from LN, LN+1 packages transactions to generate the next block.…”

Section: Figure 2 Leader Node Campaign Schemamentioning

confidence: 99%

See 1 more Smart Citation

RQPoA: A random quantum PoA Consensus Mechanism in Blockchain Based on Quantum Methods

WANG,

Li,

Liu

et al. 2024

Preprint

View full text Add to dashboard Cite

As a distributed network, the operational efficacy of a blockchain system relies heavily on the consensus mechanism it adopts. Among the mainstream consensus mechanisms in blockchain, proof-of-authority (PoA) is appealing for its post-quantum security and block generation efficiency and, therefore, has gained academic attention. Nevertheless, the traditional PoA faces three major problems: (1) Low decentralization. The allocation of bookkeeping rights has a low degree of decentralization in the blockchain network. (2) Low availability. The total exposure of the leader node makes it susceptible to centralized attacks, leading to a single point of failure (SPOF) dilemma and reducing the availability of the entire blockchain system. (3) Non-robustness (low fault tolerance). Generating a new block must be done jointly by all validator nodes, with this voting process potentially delayed due to invalid voter participation. To address these issues, this paper improves PoA and proposes a new consensus mechanism scheme, the random quantum proof of authority (RQPoA). First, RQPoA develops the leader node election algorithm with a verifiable delay function (VDF) to realize fair and impartial leader node selection, enforcing the blockchain’s decentralization level. Second, RQPoA adopts the multi-party quantum secret sharing protocol to share the leader node’s identity among validator nodes confidentially. This strategy eliminates SPOF caused by the leader node, increasing the blockchain system availability. Third, RQPoA incorporates a candidate block voting protocol based on a quantum threshold signature to complete the block proposal, which is fault-tolerant and thus enhances the blockchain system's robustness. A security analysis of RQPoA demonstrates its security, efficiency, and better fault tolerance than related quantum consensus mechanisms. In conclusion, the RQPoA makes a useful exploration for researching secure consensus mechanisms in the post-quantum era and enriches the related research.

show abstract

Section: Quantum Secret Sharing (Qss) Protocolmentioning

confidence: 99%

Section: Figure 2 Leader Node Campaign Schemamentioning

confidence: 99%

RQPoA: A random quantum PoA Consensus Mechanism in Blockchain Based on Quantum Methods

WANG,

Li,

Liu

et al. 2024

Preprint

View full text Add to dashboard Cite

show abstract

“…Moreover, due to its ability to satisfy the requirements of multi-user secret sharing, QSS can be applied to scenarios of quantum secure multiparty computation. Serving as a foundational module, QSS can facilitate the construction of secure multiparty computation protocols with various functions, such as quantum sealed-bid auction [11][12][13] and quantum summation [14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

Multi-party semi-quantum secret sharing protocol based on measure-flip and reflect operations

Li,

2024

Laser Phys. Lett.

View full text Add to dashboard Cite

Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations, offering the advantage of not requiring all users to possess intricate quantum devices. However, current SQSS protocols mainly cater to bipartite scenarios, with few protocols suitable for multi-party scenarios. Moreover, the multi-party SQSS protocols face limitations such as low qubit efficiency and inability to share deterministic secret information. To address this gap, this paper proposes a multi-party SQSS protocol based on multi-particle GHZ states. In this protocol, the quantum user can distribute the predetermined secret information to multiple classical users with limited quantum capabilities, and only through mutual cooperation among all classical users can the correct secret information be reconstructed. By utilizing measure-flip and reflect operations, the transmitted multi-particle GHZ states can all contribute keys, thereby improving the utilization of transmitted particles. Then, security analysis shows that the protocol’s resilience against prevalent external and internal threats. Additionally, employing IBM Qiskit, we conduct quantum circuit simulations to validate the protocol’s accuracy and feasibility. Finally, compared to similar studies, the proposed protocol has advantages in terms of protocol scalability, qubit efficiency, and shared message types.

show abstract

“…Many experts and scholars have been devoted to studying post-confirmation mechanisms to resist collusion attacks. Even now, the post-confirmation mechanism has been researched and modified by several academics [19][20][21][22][23][24].…”

Section: Introductionmentioning

confidence: 99%

A New Quantum Sealed-Bid Auction Protocol with a Set of Local Indistinguishable Orthogonal Product States

et al. 2023

View full text Add to dashboard Cite

Quantum sealed-bid auction (QSA) is a special form of transaction with significant applications in the economic and financial fields. Using a unique set of locally indistinguishable orthogonal product (LIOP) states, we propose a new QSA protocol in this paper. In the protocol, the bid message is encoded as a quantum sequence of LIOP states, and the different particles of LIOP states are transmitted separately. Even though an attacker obtains a portion of the particles, they cannot recover the entire bid message because of the local indistinguishability of LIOP states. Once the auctioneer announces the winner’s bid, all bidders are able to confirm the authenticity of their bid. With the help of a semi-honest third party, collusion between the auctioneer and a malicious bidder can be discovered. Finally, our protocol is capable of meeting all requirements for secure sealed-bid auctions through security and completeness analysis. Additionally, the proposed protocol does not require any entangled resources and complicated operations, so it can be easily implemented in practice.

show abstract

Quantum sealed-bid auction protocol based on quantum secret sharing

Cited by 7 publications

References 19 publications

RQPoA: A random quantum PoA Consensus Mechanism in Blockchain Based on Quantum Methods

RQPoA: A random quantum PoA Consensus Mechanism in Blockchain Based on Quantum Methods

Multi-party semi-quantum secret sharing protocol based on measure-flip and reflect operations

A New Quantum Sealed-Bid Auction Protocol with a Set of Local Indistinguishable Orthogonal Product States

Contact Info

Product

Resources

About