Blockchain technology for secure and smart applications across industry verticals

The Blockchain Technology for Secure and Smart Applications across Industry Verticals, Volume 121, presents the latest information on a type of distributed ledger used for maintaining a permanent and tamper-proof record of transactional data. The book presents a novel compendium of existing and budd...

Descripción completa

Detalles Bibliográficos
Otros Autores: Aggarwal, Shubhani, editor (editor), Kumar, Neeraj, editor, Raj, Pethuru, editor
Formato: Libro electrónico
Idioma:Inglés
Publicado: Cambridge : Academic Press 2021.
Colección:Advances in computers ; v. 121.
Materias:
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009835426906719
Tabla de Contenidos:
  • Intro
  • The Blockchain Technology for Secure and Smart Applications across Industry Verticals
  • Copyright
  • Contents
  • Contributors
  • Preface
  • Chapter One: Demystifying the blockchain technology
  • 1. Introduction
  • 2. The key motivations for the blockchain technology
  • 3. Delineating the blockchain technology
  • 4. Briefing of the blockchain system elements
  • 5. Blockchain consensus algorithms
  • 6. Power of work
  • 6.1. Advantages of PoW
  • 6.2. Disadvantages of PoW
  • 6.3. Where POW used?
  • 7. Proof of stake
  • 8. Delegated proof of stake
  • 9. Proof of burn
  • 10. Practical Byzantine fault tolerance
  • 11. Blockchain types
  • 12. About the bitcoin application of the blockchain technology
  • 13. Enterprise blockchain use cases
  • 14. The blockchain technology benefits
  • 15. The blockchain challenges and concerns
  • 16. How blocks and their chains nullify security attacks on blockchain networks
  • 17. An efficient cross-organizational information transfer method through blockchain
  • 18. The marriage between blockchain, AI, and the IoT
  • 19. Conclusion
  • Appendix
  • A.1. The blockchain frameworks
  • Chapter Two: Data structures
  • 1. Primitive data structure
  • 1.1. Integers
  • 1.2. Float
  • 1.3. Characters
  • 1.4. Pointers
  • 2. Nonprimitive data structure
  • 2.1. Arrays
  • 2.1.1. Creating an array
  • 2.1.2. Adding elements to an array
  • 2.1.3. Accessing elements from the array
  • 2.1.4. Removing elements from the array
  • 2.1.5. Searching element in an array
  • 2.1.6. Updating elements in an array
  • 2.2. Linked list
  • 2.2.1. Linked list insertion
  • 2.2.2. Deletion of an element in a linked list
  • 2.3. Queue
  • 2.3.1. Implement queues using linked list
  • 2.3.2. Implement queues using arrays
  • 2.4. Stack
  • 2.4.1. Stack implementation using list
  • 2.4.2. Stack implementation using queue module
  • 2.5. Graphs
  • 2.5.1. Creating a graph
  • 2.5.2. Display vertices of graph
  • 2.5.3. Display edges of graph
  • 2.5.4. Adding a vertex to the graph
  • 2.5.5. Adding an edge to the graph
  • 2.6. Trees
  • 2.6.1. Creating a root
  • 2.6.2. Inserting a node into tree
  • 2.7. Heaps
  • 2.7.1. Creating a heap
  • 2.7.2. Inserting into heap
  • 2.7.3. Removing from heap
  • 2.7.4. Replacing in a heap
  • 3. Merkle root
  • 3.1. Hash function
  • 3.2. Applications of Merkle tree
  • 4. InterPlanetary file system
  • 4.1. History of IPFS
  • 4.2. Nodes of IPFS
  • 4.3. Advantages of IPFS
  • 4.4. Disadvantages of IPFS
  • References
  • Chapter Three: Hashes
  • 1. SHA-256 or SHA-2
  • 2. Ethash
  • 3. Scrypt
  • 4. X11
  • 5. Equihash
  • 5.1. Properties of Equihash
  • 6. RIPEMD-160
  • References
  • Chapter Four: Digital signatures
  • 1. Digital signatures
  • 2. Digital signature algorithm
  • 3. Elliptic curve digital signature algorithm
  • 4. Edward curve digital signature algorithm
  • 5. Difference between EdDSA and ECDSA
  • References
  • Chapter Five: Signature primitives
  • 1. Ring signatures