Goldreich, Oded
Overview
Works:  107 works in 352 publications in 3 languages and 6,020 library holdings 

Genres:  Conference proceedings 
Roles:  Author, Editor, Creator 
Classifications:  QA268, 652.8 
Publication Timeline
.
Most widely held works by
Oded Goldreich
Foundations of cryptology
by
Oded Goldreich(
)
3 editions published between 2001 and 2003 in English and held by 1,077 WorldCat member libraries worldwide
3 editions published between 2001 and 2003 in English and held by 1,077 WorldCat member libraries worldwide
Foundations of cryptographya primer
by
Oded Goldreich(
)
37 editions published between 2001 and 2006 in English and held by 1,023 WorldCat member libraries worldwide
Revolutionary developments which took place in the 1980's have transformed cryptography from a semiscientific discipline to a respectable field in theoretical Computer Science. In particular, concepts such as computational indistinguishability, pseudorandomness and zeroknowledge interactive proofs were introduced and classical notions as secure encryption and unforgeable signatures were placed on sound grounds. The resulting field of cryptography, reviewed in this survey, is strongly linked to complexity theory (in contrast to 'classical' cryptography which is strongly related to information theory)
37 editions published between 2001 and 2006 in English and held by 1,023 WorldCat member libraries worldwide
Revolutionary developments which took place in the 1980's have transformed cryptography from a semiscientific discipline to a respectable field in theoretical Computer Science. In particular, concepts such as computational indistinguishability, pseudorandomness and zeroknowledge interactive proofs were introduced and classical notions as secure encryption and unforgeable signatures were placed on sound grounds. The resulting field of cryptography, reviewed in this survey, is strongly linked to complexity theory (in contrast to 'classical' cryptography which is strongly related to information theory)
Theoretical computer science essays in memory of Shimon Even
by
Oded Goldreich(
)
16 editions published in 2006 in English and held by 557 WorldCat member libraries worldwide
16 editions published in 2006 in English and held by 557 WorldCat member libraries worldwide
P, NP, and NPcompleteness the basics of computational complexity
by
Oded Goldreich(
)
12 editions published in 2010 in English and held by 549 WorldCat member libraries worldwide
"The focus of this book is the PversusNP Question and the theory of NPcompleteness. It also provides adequate preliminaries regarding computational problems and computational models. The PversusNP 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 PversusNP Question remains unresolved, the theory of NPcompleteness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NPcomplete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NPcomplete"Provided by publisher
12 editions published in 2010 in English and held by 549 WorldCat member libraries worldwide
"The focus of this book is the PversusNP Question and the theory of NPcompleteness. It also provides adequate preliminaries regarding computational problems and computational models. The PversusNP 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 PversusNP Question remains unresolved, the theory of NPcompleteness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NPcomplete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NPcomplete"Provided by publisher
Concurrent zeroknowledge
by
Alon Rosen(
)
6 editions published between 2006 and 2010 in English and held by 459 WorldCat member libraries worldwide
Protocols that remain zeroknowledge when many instances are executed concurrently are called concurrent zeroknowledge. Devoted to their study, this book presents constructions of concurrent zeroknowledge protocols, along with proofs. It also shows why "traditional" proof techniques are not suitable for establishing the protocol's property
6 editions published between 2006 and 2010 in English and held by 459 WorldCat member libraries worldwide
Protocols that remain zeroknowledge when many instances are executed concurrently are called concurrent zeroknowledge. Devoted to their study, this book presents constructions of concurrent zeroknowledge protocols, along with proofs. It also shows why "traditional" proof techniques are not suitable for establishing the protocol's property
Computational complexity : a conceptual perspective
by
Oded Goldreich(
Book
)
13 editions published in 2008 in English and held by 456 WorldCat member libraries worldwide
Complexity theory is a central field of the theoretical foundations of computer science, concerned with the general study of the intrinsic complexity of computational tasks. This book offers a conceptual perspective on complexity theory intended to serve as an introduction for advanced undergraduates and graduates
13 editions published in 2008 in English and held by 456 WorldCat member libraries worldwide
Complexity theory is a central field of the theoretical foundations of computer science, concerned with the general study of the intrinsic complexity of computational tasks. This book offers a conceptual perspective on complexity theory intended to serve as an introduction for advanced undergraduates and graduates
Property testing current research and surveys
by
Oded Goldreich(
)
16 editions published between 2010 and 2011 in English and held by 442 WorldCat member libraries worldwide
Annotation
16 editions published between 2010 and 2011 in English and held by 442 WorldCat member libraries worldwide
Annotation
Modern cryptography, probabilistic proofs, and pseudorandomness
by
Oded Goldreich(
Book
)
13 editions published between 1999 and 2011 in 3 languages and held by 413 WorldCat member libraries worldwide
The book focuses on three related areas in the theory of computation. The areas are modern cryptography, the study of probabilistic proof systems, and the theory of computational pseudorandomness. The common theme is the interplay between randomness and computation. The book offers an introduction and extensive survey to each of these areas, presenting both the basic notions and the most important (sometimes advanced) results. The presentation is focused on the essentials and does not elaborate on details. In some cases it offers a novel and illuminating perspective. The reader may obtain from the book 1. A clear view of what each of these areas is all above. 2. Knowledge of the basic important notions and results in each area. 3. New insights into each of these areas. It is believed that the book may thus be useful both to a beginner (who has only some background in the theory of computing), and an expert in any of these areas
13 editions published between 1999 and 2011 in 3 languages and held by 413 WorldCat member libraries worldwide
The book focuses on three related areas in the theory of computation. The areas are modern cryptography, the study of probabilistic proof systems, and the theory of computational pseudorandomness. The common theme is the interplay between randomness and computation. The book offers an introduction and extensive survey to each of these areas, presenting both the basic notions and the most important (sometimes advanced) results. The presentation is focused on the essentials and does not elaborate on details. In some cases it offers a novel and illuminating perspective. The reader may obtain from the book 1. A clear view of what each of these areas is all above. 2. Knowledge of the basic important notions and results in each area. 3. New insights into each of these areas. It is believed that the book may thus be useful both to a beginner (who has only some background in the theory of computing), and an expert in any of these areas
Studies in complexity and cryptography miscellanea on the interplay between randomness and computation
by
Oded Goldreich(
)
12 editions published in 2011 in English and held by 372 WorldCat member libraries worldwide
This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists. The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include averagecase complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NPcompleteness, oneway functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zeroknowledge, and noniterative zeroknowledge. All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and views of one of its outstanding representatives
12 editions published in 2011 in English and held by 372 WorldCat member libraries worldwide
This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists. The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include averagecase complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NPcompleteness, oneway functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zeroknowledge, and noniterative zeroknowledge. All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and views of one of its outstanding representatives
Foundations of crypotgraphy
by
Oded Goldreich(
Book
)
20 editions published between 2004 and 2009 in English and held by 153 WorldCat member libraries worldwide
20 editions published between 2004 and 2009 in English and held by 153 WorldCat member libraries worldwide
A primer on pseudorandom generators
by
Oded Goldreich(
Book
)
9 editions published in 2010 in English and held by 148 WorldCat member libraries worldwide
The primer assumes basic familiarity with the notion of efficient algorithms and with elementary probability theory, but provides a basic introduction to all notions that are actually used. as a result, the primer is essentially selfcontained, although the interested reader is at times referred to other sources for more detail. Book Jacket
9 editions published in 2010 in English and held by 148 WorldCat member libraries worldwide
The primer assumes basic familiarity with the notion of efficient algorithms and with elementary probability theory, but provides a basic introduction to all notions that are actually used. as a result, the primer is essentially selfcontained, although the interested reader is at times referred to other sources for more detail. Book Jacket
Foundations of cryptography
by
Oded Goldreich(
Book
)
11 editions published between 2001 and 2006 in English and held by 48 WorldCat member libraries worldwide
11 editions published between 2001 and 2006 in English and held by 48 WorldCat member libraries worldwide
Probabilistic proof systems a primer
by
Oded Goldreich(
Book
)
11 editions published between 1994 and 2008 in English and held by 41 WorldCat member libraries worldwide
Various types of probabilistic proof systems have played a central rolein 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, zeroknowledge proofs, and Probabilistically Checkable Proofs (PCP). Surveying the basic results regarding these proof systems, we stress the essential role of randomness in each of them
11 editions published between 1994 and 2008 in English and held by 41 WorldCat member libraries worldwide
Various types of probabilistic proof systems have played a central rolein 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, zeroknowledge proofs, and Probabilistically Checkable Proofs (PCP). Surveying the basic results regarding these proof systems, we stress the essential role of randomness in each of them
Theoretical Computer Science (vol. # 3895) Essays in Memory of Shimon Even
by
Oded Goldreich(
)
4 editions published in 2006 in English and held by 31 WorldCat member libraries worldwide
4 editions published in 2006 in English and held by 31 WorldCat member libraries worldwide
Foundations of cryptology
by
Oded Goldreich(
Book
)
4 editions published between 2001 and 2004 in English and held by 16 WorldCat member libraries worldwide
Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. This text presents a systematic treatment of the foundational issues
4 editions published between 2001 and 2004 in English and held by 16 WorldCat member libraries worldwide
Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. This text presents a systematic treatment of the foundational issues
Contemplations on testing graph properties
(
)
1 edition published in 2006 in English and held by 16 WorldCat member libraries worldwide
1 edition published in 2006 in English and held by 16 WorldCat member libraries worldwide
Approximating average parameters of graphs in memory of Shimon Even (19352004)
(
)
1 edition published in 2006 in English and held by 16 WorldCat member libraries worldwide
1 edition published in 2006 in English and held by 16 WorldCat member libraries worldwide
Proofs that yield nothing but their validity or all languages in NP have zeroknowledge proofs : Revised version of TR 498
by
Oded Goldreich(
Book
)
9 editions published between 1988 and 1990 in English and Undetermined and held by 9 WorldCat member libraries worldwide
9 editions published between 1988 and 1990 in English and Undetermined and held by 9 WorldCat member libraries worldwide
A uniformcomplexity treatment of encryption and zeroknowledge
by
Oded Goldreich(
Book
)
7 editions published between 1989 and 1991 in English and held by 9 WorldCat member libraries worldwide
7 editions published between 1989 and 1991 in English and held by 9 WorldCat member libraries worldwide
On concurrent identification protocols
by
Oded Goldreich(
Book
)
4 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide
4 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Rosenberg, Arnold L. 1941 Editor
 Selman, Alan L. Editor
 Even, Shimon Honoree Author
 Rosen, Alon Author
 Ron, Dana Creator
 Avigad, Lidor
 Goldwasser, S. (Shafi) 1958
 Even, S. Author
 Wigderson, A.
 Micali, S.
Useful Links
Associated Subjects
Algorithms Approximation algorithms Approximation theory Artificial intelligence Automatic theorem proving Coding theory Combinatorial analysis Computational complexity Computer algorithms Computer graphics Computer network protocols Computer science Computer scienceMathematics Computer security Computer software Cryptography CryptographyMathematics Data encryption (Computer science) Data structures (Computer science) Decision makingData processing Distribution (Probability theory) Electronic data processing Information theory Mathematics NPcomplete problems Polynomials Proof theory Random number generators Turing machines Zeroknowledge proofs