The theory of hash functions and random oracles : an approach to modern cryptography / Arno Mittelbach, Marc Fischlin.
Mittelbach, Arno, author.; Fischlin, Marc, author.
2021
QA76.9.A25
Available Online

Linked e-resources

Linked Resource Online Access
Concurrent users Unlimited
Authorized users Authorized users
Document Delivery Supplied Can lend chapters, not whole ebooks

Details

Title The theory of hash functions and random oracles : an approach to modern cryptography / Arno Mittelbach, Marc Fischlin.
Author Mittelbach, Arno, author.
ISBN 9783030632878 (electronic bk.)
3030632873 (electronic bk.)
9783030632861
DOI https://doi.org/10.1007/978-3-030-63287-8
Published Cham : Springer, [2021]
Language English
Description 1 online resource (xxiii, 788 pages) : illustrations
Other Standard Identifiers 10.1007/978-3-030-63287-8 doi
Call Number QA76.9.A25
Dewey Decimal Classification 005.8
Summary 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.
Bibliography, etc. Note Includes bibliographical references and index.
Access Note Access limited to authorized users.
Digital File Characteristics text file
PDF
Source of Description Online resource; title from PDF title page (SpringerLink, viewed March 10, 2021).
Added Author Fischlin, Marc, author.
Series Information security and cryptography. 1619-7100
Available in Other Form Print version: 9783030632861
Print version: 9783030632885
Print version: 9783030632892
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export