Foundations of Cryptography: Volume 1, Basic Tools

Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. This book presents a rigorous and systematic treatment of the foundational issues: defining cryptographic tasks and solving new cryptographic problems using existing tools. It focuses on the basic mathematical tools: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. Rather than describing ad-hoc approaches, this book emphasizes the clarification of fundamental concepts and the demonstration of the feasibility of solving cryptographic problems. It is suitable for use in a graduate course on cryptography and as a reference book for experts.

Computers & Technology

Goldreich, Oded

Networking & Cloud Computing

Cambridge University Press

Cryptography is concerned with the conceptualization, definition, and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. Building on the basic tools presented in the first volume, this second volume of Foundations of Cryptography contains a rigorous and systematic treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols. It is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful. Also available: Volume I: Basic Tools 0-521-79172-3 Hardback $75.00 C

Foundations of Cryptography: Volume 2, Basic Applications

Programming

P, NP, and NP-Completeness: The Basics of Computational Complexity

The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P-versus-NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.

P, Np, and Np-Completeness: The Basics of Computational Complexity

Computer Science

Foundations of Cryptography Volume II Basic Applications

Software

This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.

Computational Complexity: A Conceptual Perspective

Property testing is concerned with the design of super-fast algorithms for the structural analysis of large quantities of data. The aim is to unveil global features of the data, such as determining whether the data has a particular property or estimating global parameters. Remarkably, it is possible for decisions to be made by accessing only a small portion of the data. Property testing focuses on properties and parameters that go beyond simple statistics. This book provides an extensive and authoritative introduction to property testing. It provides a wide range of algorithmic techniques for the design and analysis of tests for algebraic properties, properties of Boolean functions, graph properties, and properties of distributions.

Introduction to Property Testing

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.

Probabilistic Proof Systems: A Primer (Foundations and Trends(r) in Theoretical Computer Science)

Now Publishers

On Doubly-Efficient Interactive Proof Systems (Foundations and Trends(r) in Theoretical Computer Science)

See the best price to sell, buy, or rent books by Goldreich, Oded. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Goldreich, Oded

See the best price to sell, buy, or rent books by Goldreich, Oded. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Foundations of Cryptography: Volume 1, Basic Tools

Foundations of Cryptography: Volume 2, Basic Applications

P, Np, and Np-Completeness: The Basics of Computational Complexity

P, NP, and NP-Completeness: The Basics of Computational Complexity

Foundations of Cryptography: Volume 1, Basic Tools

Foundations of Cryptography Volume II Basic Applications

Computational Complexity: A Conceptual Perspective

Introduction to Property Testing

Probabilistic Proof Systems: A Primer (Foundations and Trends(r) in Theoretical Computer Science)

On Doubly-Efficient Interactive Proof Systems (Foundations and Trends(r) in Theoretical Computer Science)