Cryptography plays a fundamental role in blockchain systems, ensuring security and integrity at multiple levels. Blocks are linked through cryptographic hash functions, and consensus mechanisms, such as proof-of-work, rely on these functions for validation. Transactions require authorization via digital signatures, while newer blockchain models incorporate advanced cryptographic tools, such as verifiable random functions for proof-of-stake and zero-knowledge proofs for private yet verifiable transactions. This chapter explores the cryptographic schemes essential to modern blockchain systems, discussing their role and security foundations. It follows the standard approach of defining security through asymptotic complexity and probabilistic polynomial time (PPT) adversaries. Most cryptographic schemes depend on hard mathematical problems, including RSA factorization and the discrete logarithm problem, which form the basis for many encryption and authentication protocols.
Cryptographic Tools for Blockchains / Tackmann, Bjoern; Visconti, Ivan. - (2021), pp. 1-25. - SYNTHESIS LECTURES ON COMPUTER SCIENCE. [10.1007/978-3-031-01807-7_1].
Cryptographic Tools for Blockchains
Ivan Visconti
2021
Abstract
Cryptography plays a fundamental role in blockchain systems, ensuring security and integrity at multiple levels. Blocks are linked through cryptographic hash functions, and consensus mechanisms, such as proof-of-work, rely on these functions for validation. Transactions require authorization via digital signatures, while newer blockchain models incorporate advanced cryptographic tools, such as verifiable random functions for proof-of-stake and zero-knowledge proofs for private yet verifiable transactions. This chapter explores the cryptographic schemes essential to modern blockchain systems, discussing their role and security foundations. It follows the standard approach of defining security through asymptotic complexity and probabilistic polynomial time (PPT) adversaries. Most cryptographic schemes depend on hard mathematical problems, including RSA factorization and the discrete logarithm problem, which form the basis for many encryption and authentication protocols.File | Dimensione | Formato | |
---|---|---|---|
Tackamann_Cryptographic_2021.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
6.11 MB
Formato
Adobe PDF
|
6.11 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.