Verifiable Delay Function and Its Blockchain-Related Application: A Survey

Wu, Qiang; Liu, Xi; Wang, Shiren; Ji, Shan; Wang, Shenqing; Ren, Yongjun

doi:10.3390/s22197524

Cited by 8 publications

(3 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2018, Boneh et al [25] first introduced the verifiable delay function (VDF) as a cryptographic primitive, and their work presented several typical structures for designing the VDF. Since then, VDF has attracted increasing attention from scholars and has been widely investigated in decentralized applications, such as resource-efficient blockchains [26,27].…”

Section: Verifiable Delay Function (Vdf)mentioning

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

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: Verifiable Delay Function (Vdf)mentioning

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

“…There is an important distinction between the computation and the verification. After the result y = f (x) has been computed, it can be efficiently confirmed by any observer [44] without computing the sequential steps again.…”

Section: Cryptographymentioning

confidence: 99%

PureLottery: Fair Leader Election without Decentralized Random Number Generation

Ballweg,

Cai,

Goharshady

2023

2023 IEEE International Conference on Blockchain (Blockchain)

View full text Add to dashboard Cite

Leader Election (LE) is an important process in distributed systems and blockchain technology, where one of the participants is designated as the leader or coordinator. LE is a part of many distributed systems and blockchain protocols, smart contract applications, and lotteries. Traditional randomized LE methods usually involve distributed random number generation (RNG) to select the leader. These approaches can be vulnerable to manipulation, fail to ensure fairness, or require inefficient and costly procedures, e.g., verifiable delay functions (VDFs) and publicly-verifiable secret sharing (PVSS). This Bachelor's thesis in Informatics introduces a new approach to randomized LE. The key insight is that fair leader election can be achieved without relying on explicit decentralized RNG. This is based on the game-theoretic assumption that every participant prefers to be chosen as the leader and would avoid actions that decrease their chances. This game-theoretic incentive can simplify LE protocols compared to RNG. PureLottery, inspired by single-elimination knockout tournaments in sports, offers a fair, bias-resistant, and practical solution for LE in blockchain environments. The underlying principle is that only two participants play against each other in each match, making collaboration efforts to manipulate the result useless.PureLottery is also efficient with its computational resources and communication complexity, making it practical for implementation as a smart contract. The protocol provides strong game-theoretic guarantees, incentivizing honest behavior, and is robust against adversaries, ensuring that dishonest behavior does not increase their chances of election. PureLottery is designed to be highly resistant to bias, ensuring that each honest player has a minimum winning probability of at least 1/n, regardless of any potential manipulation by an adversary overseeing the remaining n − 1 participants. This means that engaging in dishonest practices does not boost an adversary's likelihood of success, even if they have influence over all participants except one.Problems similar to the leader election problem can be solved with a modified PureLottery protocol. These problems include a ranking of all participants, electing multiple leaders simultaneously, and leader aversion. The PureLottery protocol has multiple applications in different fields. It can be easily implemented in smart contract applications like lotteries. Moreover, it can be utilized in blockchain and distributed systems protocols. An open-source implementation of PureLottery is provided, dedicated to the public domain.

show abstract

“…This makes data among the most-valuable resources in the world [3,7]. The main risks associated with privacy breaches during data transformation include data leakage, data misuse, data association, and data sharing [8][9][10]. The querying of data is the most-common operation when using data [11][12][13].…”

Section: Introductionmentioning

confidence: 99%

A Review of Cuckoo Filters for Privacy Protection and Their Applications

et al. 2023

Self Cite

View full text Add to dashboard Cite

As the global digitalization process continues, information is transformed into data and widely used, while the data are also at risk of serious privacy breaches. The Cuckoo filter is a data structure based on the Cuckoo hash. It encrypts data when it is used and can achieve privacy protection to a certain extent. The Cuckoo filter is an alternative to the Bloom filter, with advantages such as support for deleting elements and efficient space utilization. Cuckoo filters are widely used and developed in the fields of network engineering, storage systems, databases, file systems, distributed systems, etc., because they are often used to solve collection element query problems. In recent years, many variants of the Cuckoo filter have emerged based on ideas such as improving the structure and introducing new technologies in order to accommodate a variety of different scenarios, as well as a huge collection. With the development of the times, the improvement of the structure and operation logic of the Cuckoo filter itself has become an important direction for the research of aggregate element query.

show abstract

Verifiable Delay Function and Its Blockchain-Related Application: A Survey

Cited by 8 publications

References 66 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

PureLottery: Fair Leader Election without Decentralized Random Number Generation

A Review of Cuckoo Filters for Privacy Protection and Their Applications

Contact Info

Product

Resources

About