東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The theory of hash functions and ran...

Mittelbach, Arno.

FindBook

Google Book

Amazon

博客來

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.
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xxiii, 788 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science) -
電子資源:	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. - Cham :Springer International Publishing :2021. - xxiii, 788 p. :ill., digital ;24 cm. - Information security and cryptography,1619-7100. - 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:

579162
Data encryption (Computer science)

LC Class. No.: QA76.9.A25 / M57 2021

Dewey Class. No.: 005.8

The theory of hash functions and random oracles = an approach to modern cryptography /
LDR:04054nmm a2200349 a 4500 001 2237327
003 DE-He213
005 20210119180521.0
006 m d
007 cr nn 008maaau
008 211111s2021 sz s 0 eng d
020 $a 9783030632878 $q (electronic bk.)
020 $a 9783030632861 $q (paper)
024 7 $a 10.1007/978-3-030-63287-8 $2 doi
035 $a 978-3-030-63287-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25 $b M57 2021
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
090 $a QA76.9.A25 $b M685 2021
100 1 $a Mittelbach, Arno. $3 3489403
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.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xxiii, 788 p. : $b ill., digital ; $c 24 cm.
490 1 $a Information security and cryptography, $x 1619-7100
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 0 $a Data encryption (Computer science) $3 579162
650 0 $a Cryptography $x Mathematics. $3 550199
650 0 $a Computer security. $3 540555
650 0 $a Computer networks $x Security measures. $3 579161
650 1 4 $a Systems and Data Security. $3 898223
650 2 4 $a Principles and Models of Security. $3 3382356
650 2 4 $a Mobile and Network Security. $3 3382377
700 1 $a Fischlin, Marc. $3 1005554
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Information security and cryptography. $3 1620909
856 4 0 $u https://doi.org/10.1007/978-3-030-63287-8
950 $a Computer Science (SpringerNature-11645)