國立虎尾科技大學 |

The Theory of Hash Functions and Random Oracles = An Approach to Modern Cryptography /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Theory of Hash Functions and Random Oracles/ by Arno Mittelbach, Marc Fischlin.
其他題名:	An Approach to Modern Cryptography /
作者:	Mittelbach, Arno.
其他作者:	Fischlin, Marc.
面頁冊數:	XXIII, 788 p. 109 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Mobile and Network Security. -
電子資源:	https://doi.org/10.1007/978-3-030-63287-8
ISBN:	9783030632878

The Theory of Hash Functions and Random Oracles = An Approach to Modern Cryptography /
Mittelbach, Arno.

The Theory of Hash Functions and Random OraclesAn Approach to Modern Cryptography /[electronic resource] :by Arno Mittelbach, Marc Fischlin. - 1st ed. 2021. - XXIII, 788 p. 109 illus.online resource. - Information Security and Cryptography,2197-845X. - Information Security and Cryptography,.

Introduction -- Preliminaries: Cryptographic Foundations -- Part I: Foundations -- Computational Security -- Pseudorandomness and Computational Indistinguishability -- Collision Resistance -- Encryption Schemes -- Signature Schemes -- Non-cryptographic Hashing -- Part II: The Random Oracle Methodology -- The Random Oracle Model -- The Full Power of Random Oracles -- Random Oracle Schemes in Practice -- Limitations of Random Oracles -- The Random Oracle Controversy -- Part III: Hash Function Constructions -- Iterated Hash Functions -- Constructing Compression Functions -- Iterated Hash Functions in Practice -- Constructions of Keyed Hash Functions -- Constructing Random Oracles: Indifferentiability -- Constructing Random Oracles: UCEs -- Index.

Hash functions are the cryptographer’s Swiss Army knife. Even though they play an integral part in today’s cryptography, existing textbooks discuss hash functions only in passing and instead often put an emphasis on other primitives like encryption schemes. In this book the authors take a different approach and place hash functions at the center. The result is not only an introduction to the theory of hash functions and the random oracle model but a comprehensive introduction to modern cryptography. After motivating their unique approach, in the first chapter the authors introduce the concepts from computability theory, probability theory, information theory, complexity theory, and information-theoretic security that are required to understand the book content. In Part I they introduce the foundations of hash functions and modern cryptography. They cover a number of schemes, concepts, and proof techniques, including computational security, one-way functions, pseudorandomness and pseudorandom functions, game-based proofs, message authentication codes, encryption schemes, signature schemes, and collision-resistant (hash) functions. In Part II the authors explain the random oracle model, proof techniques used with random oracles, random oracle constructions, and examples of real-world random oracle schemes. They also address the limitations of random oracles and the random oracle controversy, the fact that uninstantiable schemes exist which are provably secure in the random oracle model but which become insecure with any real-world hash function. Finally in Part III the authors focus on constructions of hash functions. This includes a treatment of iterative hash functions and generic attacks against hash functions, constructions of hash functions based on block ciphers and number-theoretic assumptions, a discussion of privately keyed hash functions including a full security proof for HMAC, and a presentation of real-world hash functions. The text is supported with exercises, notes, references, and pointers to further reading, and it is a suitable textbook for undergraduate and graduate students, and researchers of cryptology and information security.

ISBN: 9783030632878

Standard No.: 10.1007/978-3-030-63287-8doiSubjects--Topical Terms:

1211619
Mobile and Network Security.

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.8

The Theory of Hash Functions and Random Oracles = An Approach to Modern Cryptography /
LDR:04405nam a22004215i 4500 001 1052128
003 DE-He213
005 20210825193512.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030632878 $9 978-3-030-63287-8
024 7 $a 10.1007/978-3-030-63287-8 $2 doi
035 $a 978-3-030-63287-8
050 4 $a QA76.9.A25
072 7 $a UR $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a UR $2 thema
072 7 $a UTN $2 thema
082 0 4 $a 005.8 $2 23
100 1 $a Mittelbach, Arno. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1356765
245 1 4 $a The Theory of Hash Functions and Random Oracles $h [electronic resource] : $b An Approach to Modern Cryptography / $c by Arno Mittelbach, Marc Fischlin.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XXIII, 788 p. 109 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Information Security and Cryptography, $x 2197-845X
505 0 $a Introduction -- Preliminaries: Cryptographic Foundations -- Part I: Foundations -- Computational Security -- Pseudorandomness and Computational Indistinguishability -- Collision Resistance -- Encryption Schemes -- Signature Schemes -- Non-cryptographic Hashing -- Part II: The Random Oracle Methodology -- The Random Oracle Model -- The Full Power of Random Oracles -- Random Oracle Schemes in Practice -- Limitations of Random Oracles -- The Random Oracle Controversy -- Part III: Hash Function Constructions -- Iterated Hash Functions -- Constructing Compression Functions -- Iterated Hash Functions in Practice -- Constructions of Keyed Hash Functions -- Constructing Random Oracles: Indifferentiability -- Constructing Random Oracles: UCEs -- Index.
520 $a Hash functions are the cryptographer’s Swiss Army knife. Even though they play an integral part in today’s cryptography, existing textbooks discuss hash functions only in passing and instead often put an emphasis on other primitives like encryption schemes. In this book the authors take a different approach and place hash functions at the center. The result is not only an introduction to the theory of hash functions and the random oracle model but a comprehensive introduction to modern cryptography. After motivating their unique approach, in the first chapter the authors introduce the concepts from computability theory, probability theory, information theory, complexity theory, and information-theoretic security that are required to understand the book content. In Part I they introduce the foundations of hash functions and modern cryptography. They cover a number of schemes, concepts, and proof techniques, including computational security, one-way functions, pseudorandomness and pseudorandom functions, game-based proofs, message authentication codes, encryption schemes, signature schemes, and collision-resistant (hash) functions. In Part II the authors explain the random oracle model, proof techniques used with random oracles, random oracle constructions, and examples of real-world random oracle schemes. They also address the limitations of random oracles and the random oracle controversy, the fact that uninstantiable schemes exist which are provably secure in the random oracle model but which become insecure with any real-world hash function. Finally in Part III the authors focus on constructions of hash functions. This includes a treatment of iterative hash functions and generic attacks against hash functions, constructions of hash functions based on block ciphers and number-theoretic assumptions, a discussion of privately keyed hash functions including a full security proof for HMAC, and a presentation of real-world hash functions. The text is supported with exercises, notes, references, and pointers to further reading, and it is a suitable textbook for undergraduate and graduate students, and researchers of cryptology and information security.
650 2 4 $a Mobile and Network Security. $3 1211619
650 2 4 $a Principles and Models of Security. $3 1225876
650 1 4 $a Systems and Data Security. $3 677062
650 0 $a Computer networks $x Security measures. $3 555385
650 0 $a Computer security. $3 557122
700 1 $a Fischlin, Marc. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 885411
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030632861
776 0 8 $i Printed edition: $z 9783030632885
776 0 8 $i Printed edition: $z 9783030632892
830 0 $a Information Security and Cryptography, $x 1619-7100 $3 1263985
856 4 0 $u https://doi.org/10.1007/978-3-030-63287-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)