A Graduate Course in Applied Cryptography
While extremely useful, cryptography is also highly brittle. The most secure cryptographic system can be rendered completely insecure by a single specification or programming error. No amount of unit testing will uncover a security vulnerability in a cryptosystem.
Instead, to argue that a cryptosystem is secure, we rely on mathematical modeling and proofs to show that a particular system satisfies the security properties attributed to it. We often need to introduce certain plausible assumptions to push our security arguments through.
This book is about exactly that: constructing practical cryptosystems for which we can argue security under plausible assumptions. The book covers many constructions for different tasks in cryptography. For each task we define a precise security goal that we aim to achieve and then present constructions that achieve the required goal. To analyze the constructions, we develop a unified framework for doing cryptographic proofs. A reader who masters this framework will be capable of applying it to new constructions that may not be covered in the book.
Table of contents
- Secret key cryptography
- Introduction
- Encryption
- Stream ciphers
- Block ciphers
- Chosen plaintext attacks
- Message integrity
- Message integrity from universal hashing
- Message integrity from collision resistant hashing
- Authenticated encryption
- Public key cryptography
- Public key tools
- Public key encryption
- Chosen ciphertext secure public-key encryption
- Digital signatures
- Fast signatures from one-way functions
- Elliptic curve cryptography and pairings
- Post-quantum cryptography: lattices and isogenies
- Analysis of number theoretic assumptions
- Protocols
- Protocols for identification and login
- Identification and signatures from sigma protocols
- Proving properties in zero-knowledge
- Modern proof systems
- Authenticated key exchange
- Two-party and multi-party secure computation
- Basic number theory
- Basic probability theory
- Basic complexity theory
- Probabilistic algorithms
| Pages : | 900 |
| Size : | 9.5 MB |
| File type : | |
| Downloads: | 145 |
| Created: | 2022-02-01 |
| License: | Out of Copyright |
| Author(s): | by Dan Boneh, Victor Shoup |
Warning: Trying to access array offset on false in /home/tutovnfz/public_html/article.php on line 233
Others Computer science Tutorials
Others related eBooks about A Graduate Course in Applied Cryptography
Think ComplexityDownload free course Think Complexity, pdf file on 228 pages by Allen Downey....
GNU SEDDownload free course GNU SED, pdf file on 100 pages by Sundeep Agarwal....
Discovering the STM32 MicrocontrollerThis book is intended as a hands-on manual for learning how to design systems using the STM32 F1 family of micro-controllers. It was written to support a junior-level computer science course at Indiana University. ...
Principles of Computer System Design: An IntroductionThis is a unique, ambitious, and important book. It is about computer system design principles, and not the usual mechanics of how things work. These principles are typically embedded in research papers....
The Haskell School of MusicDownload free course The Haskell School of Music, pdf file on 441 pages by Paul Hudak, Donya Quick....
Open Data StructuresDownload free course Open Data Structures, pdf file on 336 pages by Pat Morin....
Made With Creative CommonsDownload free course Made With Creative Commons, pdf file on 176 pages by Paul Stacey, Sarah Hinchliff Pearson....
Reinforcement Learning: An Introduction, Second EditionReinforcement Learning (RL), one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives while interacting with a complex, uncertain environment. In Reinforcement Learning, Richard...
Programming from the Ground Up: An Introduction to Programming using Linux Assembly LanguageProgramming from the Ground Up uses Linux assembly language to teach new programmers the most important concepts in programming. It takes you a step at a time through these concepts: * How the processor views memory * How the processor operates * How programs interact with the operating system * H...
SAT/SMT by ExampleDownload free course SAT/SMT by Example, pdf file on 585 pages by Dennis Yurichev....