Blockchains: A Handbook on Fundamentals, Platforms and Applications 2024th Edition Sushmita Ruj download
Blockchains: A Handbook on Fundamentals, Platforms and Applications 2024th Edition Sushmita Ruj download
https://textbookfull.com/product/blockchains-a-handbook-on-
fundamentals-platforms-and-applications-2024th-edition-sushmita-
ruj/
https://textbookfull.com/product/biota-grow-2c-gather-2c-cook-
loucas/
https://textbookfull.com/product/handbook-on-3d3c-platforms-
applications-and-tools-for-three-dimensional-systems-for-
community-creation-and-commerce-1st-edition-yesha-sivan-eds/
https://textbookfull.com/product/mcevoys-handbook-of-
photovoltaics-third-edition-fundamentals-and-applications-
soteris-kalogirou/
https://textbookfull.com/product/security-strategies-in-windows-
platforms-and-applications-fourth-edition-shimonski/
Security Strategies In Linux Platforms And Applications
Michael Jang
https://textbookfull.com/product/security-strategies-in-linux-
platforms-and-applications-michael-jang/
https://textbookfull.com/product/whole-body-cryostimulation-
clinical-applications-2024th-edition-paolo-capodaglio/
https://textbookfull.com/product/beginning-postgresql-on-the-
cloud-simplifying-database-as-a-service-on-cloud-platforms-baji-
shaik/
https://textbookfull.com/product/fundamentals-of-surface-
thermodynamics-phase-behavior-and-its-related-properties-2024th-
edition-ronaldo-goncalves-dos-santos/
https://textbookfull.com/product/handbook-of-self-cleaning-
surfaces-and-materials-from-fundamentals-to-applications-1st-
edition-akira-fujishima-edt/
Advances in Information Security 105
Sushmita Ruj
Salil S. Kanhere
Mauro Conti Editors
Blockchains
A Handbook on Fundamentals,
Platforms and Applications
Advances in Information Security
Volume 105
Series Editors
Sushil Jajodia, George Mason University, Fairfax, VA, USA
Pierangela Samarati, Milano, Italy
Javier Lopez, Malaga, Spain
Jaideep Vaidya, East Brunswick, NJ, USA
The purpose of the Advances in Information Security book series is to establish
the state of the art and set the course for future research in information security.
The scope of this series includes not only all aspects of computer, network security,
and cryptography, but related areas, such as fault tolerance and software assurance.
The series serves as a central source of reference for information security research
and developments. The series aims to publish thorough and cohesive overviews on
specific topics in Information Security, as well as works that are larger in scope
than survey articles and that will contain more detailed background information.
The series also provides a single point of coverage of advanced and timely topics
and a forum for topics that may not have reached a level of maturity to warrant a
comprehensive textbook.
Sushmita Ruj • Salil S. Kanhere • Mauro Conti
Editors
Blockchains
A Handbook on Fundamentals,
Platforms and Applications
Editors
Sushmita Ruj Salil S. Kanhere
School of Computer Science and School of Computer Science and
Engineering Engineering
University of New South Wales University of New South Wales
Sydney Kensington, NSW, Australia Sydney Kensington, NSW, Australia
Mauro Conti
Department of Mathematics
University of Padova
Padova, Italy
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland
AG 2024
This work is subject to copyright. All rights are solely and exclusively licensed by the Publisher, whether
the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse
of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and
transmission or information storage and retrieval, electronic adaptation, computer software, or by similar
or dissimilar methodology now known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors, and the editors are safe to assume that the advice and information in this book
are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or
the editors give a warranty, expressed or implied, with respect to the material contained herein or for any
errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional
claims in published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
v
vi Contents
Part IV Applications
Supply Chain Management Using Blockchain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 365
Christopher Klinkmueller, H. M. N. Dilum Bandara, Xiwei Xu,
and Qinghua Lu
Blockchain Technology for E-Governance Applications . . . . . . . . . . . . . . . . . . . . . 399
Ras Dwivedi, Nilesh Vasita, Mukul Verma, Tanmay Yadav,
and Sandeep Shukla
When Blockchain meets Smart Cities: Opportunities, Security
and Future Research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423
Roben C. Lunardi, Regio A. Michelin, Maher Alharby, Volkan Dedeoglu,
Henry C. Nunes, Eduardo Arruda, Avelino F. Zorzo, and Aad van Moorsel
Decentralized Identity Management and Blockchains: Design
Patterns and Architectures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465
Hye-young Paik, Yue Liu, Qinghua Lu, and Salil S. Kanhere
From Centralized to Decentralized Remote Electronic Voting . . . . . . . . . . . . . 493
Christian Killer, Bruno Rodrigues, Eder John Scheid,
Muriel Figueredo Franco, and Burkhard Stiller
Blockchain Technology Accelerating Industry 4.0 . . . . . . . . . . . . . . . . . . . . . . . . . . . 531
Jan Pennekamp, Lennart Bader, Eric Wagner, Jens Hiller, Roman Matzutt,
and Klaus Wehrle
Blockchain for Health Data Management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 565
Dinh C. Nguyen, Pubudu N. Pathirana, Ming Ding, and Aruna Seneviratne
Supporting Secure Trusted Manufacturing via Blockchain . . . . . . . . . . . . . . . . . 587
Ali Dorri, Sabah Suhail, Zahra Jadidi, Rasheed Hussain, Colin Fidge,
and Raja Jurdak
Blockchain for Data Sharing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 601
Gowri Sankar Ramachandran and Bhaskar Krishnamachari
About the Editors
vii
viii About the Editors
Editor in Chief of the Ad Hoc Networks journal and as an Associate Editor of IEEE
Transactions on Network and Service Management, Computer Communications and
Pervasive and Mobile Computing. He regularly serves on the organising committee
of IEEE/ACM international conferences. Salil co-authored a book titled Blockchain
for Cyberphysical Systems published by Artech House in 2020.
1 Introduction
D. Hyland · G. Voron
University of Sydney, Camperdown, NSW, Australia
e-mail: [email protected]; [email protected]
J. Sousa · A. Bessani
Faculdade de Ciências, Universidade de Lisboa, Lisboa, Portugal
e-mail: [email protected]; [email protected]
V. Gramoli (O)
University of Sydney, Camperdown, NSW, Australia
EPFL, Lausanne, Switzerland
e-mail: [email protected]
easily find scenarios in which these protocols fail [6, 19, 33, 60]. As blockchains are
becoming important components to guarantee the security of critical applications,
these myths can have devastating effects, whose latest example is probably the
vulnerability of some of the mostly deployed blockchain software (e.g., parity
and geth) [31], used to handle high-value digital assets. Other examples include
the recent efforts devoted to develop quantum-resilient cryptographic software on
top of blockchain systems that are already vulnerable to the misbehavior of a single
participant [20]. While cryptography and fault tolerance address problems that may
seem orthogonal, a blockchain cannot provide the security level required by such
applications without both cryptography and fault tolerance (cf. Myth #7).
As blockchains are now being offered as a service by most cloud providers and
have become the cornerstone of various applications, it is crucial to clarify some of
the misconceptions that will have, sooner or later, dramatic consequences. Some of
these misconceptions could be attributed to the lack of knowledge of the distributed
computing and database literatures. First, there are various failure models in which
an algorithm can solve consensus. In fact, a consensus algorithm typically allows n
nodes (or processes) reach an agreement despite f of them failing. These failures are
generally classified in two types: crash, where a node simply stops, and Byzantine,
where a node behaves arbitrarily, misbehaving either accidentally or with malicious
intent. This is why we distinguish crash fault-tolerant (CFT) from Byzantine
(or arbitrary) fault-tolerant (BFT) protocols (cf. Myths #6 and #8). Second, the
three properties of the classic consensus problem [44] are often misinterpreted:
(i) validity requires that the value decided by a non-faulty (or correct) node has to
be valid, (ii) agreement requires that two non-faulty nodes cannot decide differently,
and (iii) termination requires that eventually the non-faulty nodes decide. Also,
the factors affecting the performance of a blockchain are often misunderstood
(Myths #4 and #5) as they typically embed, in addition to the consensus protocol,
other components like cryptography (Myth #11). This may distract engineers
from other challenging problems (Myths #9 and #10). One of the most common
misinterpretations is illustrated by the large family [49] of so-called proof-of-∗
consensus (sic) that cannot ensure agreement upon a unique block and may lead
the blockchain to counterintuitively fork into multiple branches (cf. Myth #3).
The aim of this chapter is to bust ten myths about blockchain consensus,
summarized in Table 1. These myths correspond typically to misinformation that
professionals and students commonly learn by reading posts and blogs online before
attending a blockchain course. We proceed by listing each myth and explaining
why it is incorrect by offering a counterexample, sometimes using a blockchain
(Hyperledger Fabric, Red Belly Blockchain, or R3 Corda) or a consensus algorithm
(BFT-SMaRt, DBFT, or HotStuff). Our aim is not to survey existing approaches
for blockchain consensus, as there is an extensive literature on the subject (e.g.,
[19, 49]), neither to provide a formal treatment of these myths but rather to state
them in a pedagogical language to reach the blockchain community at large. As
some of these clarifications already helped improving the scalability of blockchains
(Myth #12), we hope that they will help build secure and efficient blockchain
applications in the future.
Ten Myths About Blockchain Consensus 5
Before listing each myth, we present various interpretation of the term “consensus”
in the blockchain context. A blockchain is easily understood as a chain of blocks
abstraction where new blocks get regularly appended; however, the system that
replicates this abstraction on multiple machines or nodes of the network does not
always maintain the sequence structure of the chained blocks.
Instead a more precise description of this abstraction is a directed acyclic graph
or—to put it simply—a tree structure whose nodes are blocks and whose edges are
directed upward in the tree, from children blocks to their parent block [35]. Each
of these edges is implemented as a hash of the content of the parent block stored as
a field of the child block. A parent block has multiple children in the tree as soon
as the blockchain forks, which means that two nodes disagree about the block that
should be inserted at the next available index of the chain. The consensus abstraction
is employed to guarantee that there is no such disagreement among all nodes about
the unique block to be appended next.
The consensus problem was defined more than half a century ago [52] and
requires to guarantee that if replicas propose their block, then no two replicas
should decide differently (agreement), the block that is decided is one of the
proposed block (validity), and the non-faulty replicas should eventually decide
(termination). While this definition presents some inherent limitations for scalability
that will be discussed in Myth #11, it paved the way for research on consensus
6 D. Hyland et al.
Fig. 1 Proof-of-∗ mechanisms do not solve the consensus problem. Instead, they select a subset,
say, .{b1, b3}, of proposed blocks, say, .{b1, b2, b3}, as legitimate based on some attribute (com-
putational power, coins owned, etc.) of the nodes that generated them, but a separate consensus
algorithm is necessary to guarantee that the block, like b3, decided for a given index of the chain
is unique
In fact, the proof-of-∗ mechanism cannot solve consensus but is instead a mech-
anism to enforce some of the consensus prerequisites so that a proper consensus
algorithm can be executed. Typically, a proof-of-∗ mechanism selects a small subset
of nodes to participate in the consensus by proposing a block for the same index of
the chain as depicted in Fig. 1, where .{b1, b3} are proposed. As this mechanism
cannot guarantee that a unique block is proposed, it is insufficient to decide a single
block and does not solve the consensus problem. Recently, researchers have tried to
clarify the terminology to address this confusion [36], but it remains well spread on
the Internet.
Bitcoin [48] uses proof-of-work to limit the number of nodes that can create a
new block for a given index of the chain. Once these blocks are created, Bitcoin
solves consensus by deciding among multiple candidate blocks (that all contain a
valid proof-of-work) the unique block that is part of the longest branch. This is
the reason why Bitcoin [48] uses an extra mechanism, Nakamoto’s consensus, to
try to solve the problem: it selects the blocks of the longest branch by assuming
that the delay to create and propagate every block to all miners in the network is
upper-bounded such that every miner can safely choose the candidate block at index
i once they have waited long enough [34]. The proof-of-work mechanism helps
limit the block creation speed by requiring that a node first solves a computationally
hard crypto-puzzle before propagating a new block. This proof-of-work mechanism
alone does not ensure the uniqueness of the block at each index—this is precisely
why a separate consensus protocol based on identifying the block of the longest
branch is required in Bitcoin.
8 D. Hyland et al.
3 https://www.nec.com/en/global/insights/article/2020022520/index.html.
Another Random Scribd Document
with Unrelated Content
The Project Gutenberg eBook of Henry the
Fifth
This ebook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this ebook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.
Language: English
London
MACMILLAN AND CO.
AND NEW YORK
1889
CHAPTER II
Prince Henry and Prince Hal 7
CHAPTER III
CHAPTER IV
The Charges against Prince Henry 30
CHAPTER V
CHAPTER VII
CHAPTER VIII
CHAPTER IX
Agincourt 76
CHAPTER X
After Agincourt 88
CHAPTER XI
Henry and the Lollards 97
CHAPTER XII
CHAPTER XIV
CHAPTER XV
CHAPTER XVI
CHAPTER XVII
Here then we find Henry, who was now about half-way through
his sixteenth year, appointed to the civil and military command of
the most disturbed part of the King’s dominions. About six weeks
later the men of Shropshire write to the Council complaining of the
ravages of the Welsh rebels, and praying that some men-at-arms
and archers should be sent to protect them till the Prince himself
should come.
The King had now to meet a more formidable combination of
enemies than he had yet encountered. Henry Percy, eldest son of
the Earl of Northumberland, the Harry Hotspur of Shakespeare, had
been a trusted lieutenant of Henry. He had served in Wales against
Glendower, and had been employed both in negotiations with the
Scotch and in military action against them. He conceived himself to
have been unjustly treated, for reasons which do not concern our
present purpose, and to avenge his wrongs he formed an alliance
with Owen Glendower and with the Earl of Douglas on behalf of the
King of Scotland. Glendower was to invade Gloucestershire. To meet
this danger the King issued briefs, under date of June 16th, to the
Lieutenants of Gloucestershire, Shropshire, Worcestershire, and
Herefordshire, directing that all persons liable to serve should put
themselves at the command of his son, Henry, Prince of Wales. At
the same time an attack on the northern borders was threatened
from Scotland, and the Percies, whose disaffection was not yet
known at Court, were commissioned to repel it. The King himself
marched northwards to assist them, and seems to have been
ignorant as late as July 10th of their real intentions. These, however,
became known to him a day or so after, for he issued briefs to the
Lieutenants of the counties, dated from Burton-on-Trent on July
16th, Lichfield on the 17th, and Westminster on the 18th, requiring
military assistance to repel the invasion of Henry Percy with the
Welsh rebels and “certain enemies of ours from Scotland” in his
company.
Six days later than the date of the Westminster brief the battle
of Shrewsbury was fought. Prince Henry was on the field and bore
himself bravely, though we must not credit him with the great
achievement which Shakespeare attributes to him, of having slain
Henry Percy in single combat. A lad, still wanting some months of
sixteen, could hardly have vanquished a man of thirty, one of the
bravest and most expert soldiers of his time. Hotspur seems to have
been killed by a chance arrow as he was charging with characteristic
impetuosity the royal forces. The young Prince was himself wounded
in the forehead by an arrow.
His father’s confidence in him was continued. Two days after the
battle he expresses his trust in the loyalty and prudent caution of his
son, Henry, Prince of Wales, and gives him full power to amnesty at
his discretion such persons concerned in the late rebellion as he
might think fit, in the county of Chester and in other places named.
Owen Glendower, who had not shared the defeat of the Percies
at Shrewsbury, still held out. In 1404 he assumed the title of Prince
of Wales. In the June of that year the Sheriff of Hereford, with
various gentlemen of the county, represented to the King that they
were suffering greatly from the ravages of the Welsh rebels. The
Prince was directed to go to their help, and on the 20th of the
month wrote to his father from Worcester, to which city he had
removed his headquarters. He thanks him for his kind letter written
from Pontefract five days before, and rejoices in the news it brought
of his health and prosperity, which are, he says, the greatest
pleasure that can come to him in the world. He had been taking
measures for the defence of the county of Hereford, which the
Welsh rebels had been ravaging with fire and sword, and he would
do all he could to resist them and to save England from their
attacks. Another letter to the same effect was addressed by him to
the Council, and a second four days afterwards.
On August 30th the Council granted him three thousand marks
for the expenses of holding the castle of Denbigh and other
strongholds in North Wales, and suggested that he should remain for
a certain time on the borders of Herefordshire, and afterwards
invade Wales. In a document apparently belonging to the same time
there is a list of castles in North Wales which the Prince had kept at
his own cost since the commencement of the rebellion.
In March 1405 the Prince wrote to the King relating a victory
which he had won over the Welsh:
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com