China
Africa
Explore chapters and articles related to this topic
Blockchain and Cryptography for Secure Information Sharing
Published in Mazin Gilbert, Artificial Intelligence for Autonomous Networks, 2018
In environments where incentives, influences, and gaming competition do not exist, or they are controlled via other means, another Proof-of-Stake implementation becomes viable. The Tendermint [11] protocol implements Byzantine Fault Tolerance (BFT) to ensure consistency of new blocks in a Blockchain. Using an algorithm of sequential rotation of peers elected as block proposers along with a time-limited series of pre-commit votes requiring a two-thirds super-majority to ratify blocks between members before an automatic default to a new proposer election. Byzantine Fault Tolerance is not unique to Blockchain implementations and has wide applications within computer science problems. Instead, the advent of Blockchain use has been a benefit to the way of implementing BFT systems—using a Blockchain to support BFT elections is a natural fit.
Blockchain Implementation Challenges for IoT
Published in Rajdeep Chakraborty, Anupam Ghosh, Valentina Emilia Bălaş, Ahmed A Elngar, Blockchain, 2023
As opined by Mingxiao et al. [18], different types of consensus algorithms are mainly used in blockchain. PoW is a popular algorithm that helps in selecting a miner regarding the next block creation. Bitcoin uses this consensus algorithm. The central notion behind this algorithm is to resolve complex mathematical riddles and provide a solution quickly. This puzzle needs high calculation power, and for that, the node that resolves the dilemma can mine the next block at once. Besides, practical Byzantine fault tolerance (PBFT) is another crucial algorithm of a distributed network that can reach consensus.
Securing Privacy and Integrity of Patient's Data in Healthcare 4.0 by Countering Attack using Blockchain
Published in Bharat Bhushan, Nitin Rakesh, Yousef Farhaoui, Parma Nand Astya, Bhuvan Unhelkar, Blockchain Technology in Healthcare Applications, 2022
Avinash Kumar, Snigdha Kashyap, Tanmayee Prakash Tilekar, Tabassum Jahan, Azedine Boulmakoul
When two communicating nodes in a network safely reach a consensus, even when few misbehaving nodes are present, such a condition is called Byzantine Fault Tolerance (BFT). Thus, PBFT is a replication algorithm in which nodes are ordered sequentially with a leader node, and other nodes act as backups. The integrity and origin of data are verified through voting. Three phases exist in PBFT: pre-prepared, prepared and commit.
Secure and Privacy in Healthcare Data Using Quaternion-based Neural Network Cryptography with the Blockchain Mechanism
Published in IETE Journal of Research, 2023
Based on blockchain technology, privacy preservation of large-scale health care data is performed. Fine-grained access control is undertaken by encrypted medical data. For key management, by leveraging user transactions the authorized doctors are effectively revoked. The communication overhead has been reduced compared with traditional methods. The major drawback indicated that if the size of transactions is minimized then blockchain storage has been reduced [20]. Another study also focused on user privacy and which the blockchain method has been used. For managing the size of the blockchain, the non-sensitive information is transferred to the other primary system, whereas the sensitive information is preserved in a distributed blockchain. Within the individual user device, the computational capacity and local database storage are restricted by these proposed synchronizing operations using the DEPLEST algorithm (Distributed partial ledger storage technique). This protocol shows better byzantine fault tolerance. Compared with traditional proof of stake and proof of work techniques the DEPLEST algorithm shows better results.
‘Un’-blocking the industry 4.0 value chain with cyber-physical social thinking
Published in Enterprise Information Systems, 2023
Subodh Mendhurwar, Rajhans Mishra
A block comprises (a) block header and (b) block body (transaction counter with transactions) (Zheng et al. 2018). The block header typically consisting of (i) block version (an indicator of applicable block validation rules), (ii) parent block hash (previous block pointer), (iii) Merkle tree root hash (of all earlier transactions), current timestamp, current hashing target (typically decided by the network) and (iv) nonce (increments for every hash computation till solution arrived or target changed). Existing blockchains typically use four major consensus mechanisms: (i) PoW (Proof of Work), e.g., Bitcoin and Ethereum, (ii) PoS (Proof of Stake), e.g., PeerCoin, ShadowCash, (iii) PBFT (Practical Byzantine Fault Tolerance), and (iv) DPoS (Delegated Proof of Stake);besides others such as PoB (Proof of Bandwidth), PoET (Proof of Elapsed Time), PoA (Proof of Authority), e.g., Ethereum (Li et al. 2020), Ripple, Tendermint, PeerConsensus, GHOST, etc. (Zheng et al. 2018), or specialised mechanisms (‘Proof of X’ – Yu et al. 2020) for niche requirements (e.g., lightweight blockchain-based, distributed trust architectures for IoT – e.g., Dorri, Kanhere, and Jurdak 2017; Dorri et al. 2019).
Blockchain-based ubiquitous manufacturing: a secure and reliable cyber-physical system
Published in International Journal of Production Research, 2020
Ali Vatankhah Barenji, Zhi Li, W. M. Wang, George Q. Huang, David A. Guerra-Zubiaga
As mentioned previously, the main aim of this research was to integrate BC into the CM and UM and highlight peer-to-peer communication in order to omit the third party. Several contributions are of significance. A new architecture for blockchain cloud-based ubiquitous manufacturing has been developed, to solve scalability and trust problems in SMEs. Advanced ICT technologies, including agent-based communications and CPS, are used in the machine-level environment to create real-time communication between physical and software platform levels. The proposed platform is able to provide a peer-to-peer network with useful information passing between the service user and service provider.In order to improve the blockchain network and adapt this technology to industrial applications, Byzantine fault tolerance is used to develop a new algorithm for supporting the consensus mechanism in the blockchain network. The proposed pBFT algorithm is compared with the PoW algorithm.A blockchain platform is developed for 3D printing and an empirical case study is explained. We considered three different experiments. The first experiment focused on evaluation of the proposed network, and pBFT was compared with PoW. The second experiment focused on the scalability of the network, considering cloud environment evaluation. Finally, we focused on security evaluation of the proposed platform with standard experiment.