A Survey on PoW-based Consensus

Meneghetti, Alessio; Sala, Massimiliano; Taufer, Daniele

doi:10.33166/aetic.2020.01.002

Cited by 36 publications

(21 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Users send their proposals of new data to be included in the blockchain to the miners, a special subset of users that actively maintain the blockchain by reaching a consensus (e.g. [22]) on the transaction to append and by publishing the updated state.…”

Section: 21mentioning

confidence: 99%

A coercion-resistant blockchain-based E-voting protocol with receipts

Spadafora¹,

Longo²,

Sala³

2023

AMC

Self Cite

View full text Add to dashboard Cite

We propose a decentralized e-voting protocol that is coercionresistant and vote-selling resistant, while being also completely transparent and not receipt-free. We achieve decentralization using blockchain technology. Because of the properties such as transparency, decentralization, and non-repudiation, blockchain is a fundamental technology of great interest in its own right, and it also has large potential when integrated into many other areas. We prove the security of the protocol under the standard DDH assumption on the underlying prime-order cyclic group (e.g. the group of points of an elliptic curve), as well as under standard assumptions on blockchain robustness.

show abstract

Section: 21mentioning

confidence: 99%

A coercion-resistant blockchain-based E-voting protocol with receipts

Spadafora¹,

Longo²,

Sala³

2023

AMC

Self Cite

View full text Add to dashboard Cite

show abstract

“…It also has strong support to increasing numbers of nodes in the network. This type of consensus algorithm is highly effective in an environment where there is a lack of trust among the nodes (e.g., public networks of home networks) that involves multiple data collectors and communicators, where each user sends each other digital tokens [51] (ii) Proof-of-stake (PoS): this algorithm works on an incentive mechanism, where every block is validated through a betting system [53]. If a consensus is made between the majority of the blocks about adding another block, the stakes of all the blocks are raised, which is a strong support to increasing numbers of nodes in the network.…”

Section: Blockchain Standardizationsmentioning

confidence: 99%

Data Integrity Time Optimization of a Blockchain IoT Smart Home Network Using Different Consensus and Hash Algorithms

Kairaldeen

Abdullah

Abu-Samah

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Data security is a major issue for smart home networks. Yet, different existing tools and techniques have not been proven highly effective for home networks’ data security. Blockchain is a promising technology because of the distributed computing infrastructure network that makes it difficult for hackers to intrude into the systems through the use of cryptographic signatures and smart contracts. In this paper, an architecture for smart home networks that could guarantee data integrity, robust security, and the ability to protect the validity of the blockchain transactions has been investigated. The system model is tested using various sizes of realistic datasets (30, 3 k, and 30 k to represent a small, medium, and large number of transactions, respectively). Four different consensus algorithms were considered, the conventional schemes concatenated hash transactions (CHT) and Merkle hash tree (MHT), as well as the newly proposed odd and even modified MHT (O&E MHT) and modified MHT (MMHT). Moreover, 15 hash functions were also examined and compared to understand the effects of each consensus algorithms on the data integrity verification check execution time and the time optimization provided by the proposed MMHT algorithm. The results show that even though the CHT algorithm gives the lowest execution time, it is impractical for a blockchain implementation due to the requirement to copy the entire blockchain ledger in real time. Meanwhile, the O&E MHT does not give any tangible benefit in the execution time. However, the proposed MMHT offers a minimum of 30% gain in time optimization than the conventional MHT algorithm typically used in blockchains. This work shows that the proposed MMHT consensus algorithm not only can identify malicious codes but has an improved data integrity check performance in smart homes, all while ensuring network stability.

show abstract

“…Some of the most popular underlying puzzles are based on prime modulo operations [4], [8]- [10], partial hash inversions [5]- [7], [11], [12], and memory intensive computations [13]- [17]. (See [3] for a recent review of puzzle types; for a review of PoW schemes applied to blockchain technology, see [18]. )…”

Section: Introductionmentioning

confidence: 99%

Client Puzzle Protocols as Countermeasure Against Automated Threats to Web Applications

Bostanov¹

2021

IEEE Access

View full text Add to dashboard Cite

Proof-of-work (PoW) schemes implemented in client puzzle protocols (CPPs) have been proposed as a protection from Denial-of-Service (DoS) attacks against internet facing servers. A CPP designed to thwart attacks against a certain client-server protocol is layered independently on top of this protocol or is integrated into it. Such a general solution requires a great deal of standardization. On the other hand, different web applications that may also become targets of DoS attacks can be protected by different schemes, which greatly reduces standardization requirements and makes implementations substantially easier. In the the present study, we discuss the utility of CPPs as a practical layer of protection of web applications against DoS and other automated threat events. We define several requirements that must be met by such CPPs, and we propose a general concept and a particular PoW algorithm that fulfills these requirements. The general concept includes recursive definition of sub-puzzles and partial server-side solution verification. The proposed PoW algorithm is based on this concept and on hash inversion/collision tasks. We also introduce a few prototype implementations of this algorithm in JavaScript, WebAssembly, Python, and C, and we present the results of some benchmark tests comparing the performances of these implementations on different hardware. These results show that CPPs can provide an effective layer of mitigation against certain automated threats to web applications.

show abstract

A Survey on PoW-based Consensus

Cited by 36 publications

References 33 publications

A coercion-resistant blockchain-based E-voting protocol with receipts

A coercion-resistant blockchain-based E-voting protocol with receipts

Data Integrity Time Optimization of a Blockchain IoT Smart Home Network Using Different Consensus and Hash Algorithms

Client Puzzle Protocols as Countermeasure Against Automated Threats to Web Applications

Contact Info

Product

Resources

About