Real-World Cryptography

Real-World Cryptography
Author: David Wong
Publisher: Simon and Schuster
Total Pages: 398
Release: 2021-10-19
Genre: Computers
ISBN: 1638350841

"A staggeringly comprehensive review of the state of modern cryptography. Essential for anyone getting up to speed in information security." - Thomas Doylend, Green Rocket Security An all-practical guide to the cryptography behind common tools and protocols that will help you make excellent security choices for your systems and applications. In Real-World Cryptography, you will find: Best practices for using cryptography Diagrams and explanations of cryptographic algorithms Implementing digital signatures and zero-knowledge proofs Specialized hardware for attacks and highly adversarial environments Identifying and fixing bad practices Choosing the right cryptographic tool for any problem Real-World Cryptography reveals the cryptographic techniques that drive the security of web APIs, registering and logging in users, and even the blockchain. You’ll learn how these techniques power modern security, and how to apply them to your own projects. Alongside modern methods, the book also anticipates the future of cryptography, diving into emerging and cutting-edge advances such as cryptocurrencies, and post-quantum cryptography. All techniques are fully illustrated with diagrams and examples so you can easily see how to put them into practice. Purchase of the print book includes a free eBook in PDF, Kindle, and ePub formats from Manning Publications. About the technology Cryptography is the essential foundation of IT security. To stay ahead of the bad actors attacking your systems, you need to understand the tools, frameworks, and protocols that protect your networks and applications. This book introduces authentication, encryption, signatures, secret-keeping, and other cryptography concepts in plain language and beautiful illustrations. About the book Real-World Cryptography teaches practical techniques for day-to-day work as a developer, sysadmin, or security practitioner. There’s no complex math or jargon: Modern cryptography methods are explored through clever graphics and real-world use cases. You’ll learn building blocks like hash functions and signatures; cryptographic protocols like HTTPS and secure messaging; and cutting-edge advances like post-quantum cryptography and cryptocurrencies. This book is a joy to read—and it might just save your bacon the next time you’re targeted by an adversary after your data. What's inside Implementing digital signatures and zero-knowledge proofs Specialized hardware for attacks and highly adversarial environments Identifying and fixing bad practices Choosing the right cryptographic tool for any problem About the reader For cryptography beginners with no previous experience in the field. About the author David Wong is a cryptography engineer. He is an active contributor to internet standards including Transport Layer Security. Table of Contents PART 1 PRIMITIVES: THE INGREDIENTS OF CRYPTOGRAPHY 1 Introduction 2 Hash functions 3 Message authentication codes 4 Authenticated encryption 5 Key exchanges 6 Asymmetric encryption and hybrid encryption 7 Signatures and zero-knowledge proofs 8 Randomness and secrets PART 2 PROTOCOLS: THE RECIPES OF CRYPTOGRAPHY 9 Secure transport 10 End-to-end encryption 11 User authentication 12 Crypto as in cryptocurrency? 13 Hardware cryptography 14 Post-quantum cryptography 15 Is this it? Next-generation cryptography 16 When and where cryptography fails

Secure Multi-party Computation

Secure Multi-party Computation
Author: Manoj Prabhakaran
Publisher: IOS Press
Total Pages: 296
Release: 2013
Genre: Computers
ISBN: 1614991685

Secure Multi-Party Computation MPC is one of the most powerful tools developed by modern cryptography it facilitates collaboration among mutually distrusting parties by implementing a virtual trusted party. Despite the remarkable potential of such a tool, and decades of active research in the theoretical cryptography community, it remains a relatively inaccessible and lesser-known concept outside of this field. Only a handful of resources are available to students and researchers wishing to learn more about MPC. The editors of this book have assembled a comprehensive body of basic and advanced material on MPC, authored by

Cryptography Made Simple

Cryptography Made Simple
Author: Nigel Smart
Publisher: Springer
Total Pages: 478
Release: 2015-11-12
Genre: Computers
ISBN: 3319219367

In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout. The author balances a largely non-rigorous style — many proofs are sketched only — with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading. This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus.

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Author: Oded Goldreich
Publisher: Springer Science & Business Media
Total Pages: 192
Release: 2013-03-09
Genre: Mathematics
ISBN: 3662125218

Cryptography is one of the most active areas in current mathematics research and applications. This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.

Algorithms, Probability, Networks, and Games

Algorithms, Probability, Networks, and Games
Author: Christos Zaroliagis
Publisher: Springer
Total Pages: 418
Release: 2015-09-07
Genre: Computers
ISBN: 3319240242

This Festschrift volume is published in honor of Professor Paul G. Spirakis on the occasion of his 60th birthday. It celebrates his significant contributions to computer science as an eminent, talented, and influential researcher and most visionary thought leader, with a great talent in inspiring and guiding young researchers. The book is a reflection of his main research activities in the fields of algorithms, probability, networks, and games, and contains a biographical sketch as well as essays and research contributions from close collaborators and former PhD students.

Introduction to Algorithms, third edition

Introduction to Algorithms, third edition
Author: Thomas H. Cormen
Publisher: MIT Press
Total Pages: 1313
Release: 2009-07-31
Genre: Computers
ISBN: 0262258102

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

Applied Cryptography

Applied Cryptography
Author: Bruce Schneier
Publisher: John Wiley & Sons
Total Pages: 926
Release: 2017-05-25
Genre: Computers
ISBN: 1119439027

From the world's most renowned security technologist, Bruce Schneier, this 20th Anniversary Edition is the most definitive reference on cryptography ever published and is the seminal work on cryptography. Cryptographic techniques have applications far beyond the obvious uses of encoding and decoding information. For developers who need to know about capabilities, such as digital signatures, that depend on cryptographic techniques, there's no better overview than Applied Cryptography, the definitive book on the subject. Bruce Schneier covers general classes of cryptographic protocols and then specific techniques, detailing the inner workings of real-world cryptographic algorithms including the Data Encryption Standard and RSA public-key cryptosystems. The book includes source-code listings and extensive advice on the practical aspects of cryptography implementation, such as the importance of generating truly random numbers and of keeping keys secure. ". . .the best introduction to cryptography I've ever seen. . . .The book the National Security Agency wanted never to be published. . . ." -Wired Magazine ". . .monumental . . . fascinating . . . comprehensive . . . the definitive work on cryptography for computer programmers . . ." -Dr. Dobb's Journal ". . .easily ranks as one of the most authoritative in its field." -PC Magazine The book details how programmers and electronic communications professionals can use cryptography-the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. The book shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. With a new Introduction by the author, this premium edition will be a keepsake for all those committed to computer and cyber security.

Probabilistic Proof Systems

Probabilistic Proof Systems
Author: Oded Goldreich
Publisher: Now Publishers Inc
Total Pages: 108
Release: 2008
Genre: Computers
ISBN: 160198152X

Various types of probabilistic proof systems have played a central role in the development of computer science in the last couple of decades. These proof systems deviate from the traditional concept of a proof by introducing randomization and interaction into the verification process. Probabilistic proof systems carry an error probability (which is explicitly bounded and can be decreased by repetitions), but they offer various advantages over deterministic proof systems. This primer concentrates on three types of probabilistic proof systems: interactive proofs, zero-knowledge proofs, and probabilistically checkable proofs (PCP). Surveying the basic results regarding these proof systems, the primer stresses the essential role of randomness in each of them.

Concurrent Zero-Knowledge

Concurrent Zero-Knowledge
Author: Alon Rosen
Publisher: Springer Science & Business Media
Total Pages: 191
Release: 2007-05-16
Genre: Computers
ISBN: 3540329390

Protocols that remain zero-knowledge when many instances are executed concurrently are called concurrent zero-knowledge, and this book is devoted to their study. The book presents constructions of concurrent zero-knowledge protocols, along with proofs of security. It also shows why "traditional" proof techniques (i.e., black-box simulation) are not suitable for establishing the concurrent zero-knowledge property of "message-efficient" protocols.