Goldreich, Oded
Overview
Works:  112 works in 377 publications in 3 languages and 6,606 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Creator 
Classifications:  QA267.7, 652.8 
Publication Timeline
.
Most widely held works by
Oded Goldreich
Foundations of cryptography by
Oded Goldreich(
Book
)
30 editions published between 2001 and 2006 in English and held by 508 WorldCat member libraries worldwide
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. 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 (oneway functions), pseudorandomness and zeroknowledge proofs. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving cryptographic problems, rather than on describing adhoc approaches. The book 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
30 editions published between 2001 and 2006 in English and held by 508 WorldCat member libraries worldwide
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. 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 (oneway functions), pseudorandomness and zeroknowledge proofs. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving cryptographic problems, rather than on describing adhoc approaches. The book 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
Modern cryptography, probabilistic proofs, and pseudorandomness by
Oded Goldreich(
Book
)
16 editions published between 1999 and 2011 in 3 languages and held by 406 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
16 editions published between 1999 and 2011 in 3 languages and held by 406 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
Computational complexity : a conceptual perspective by
Oded Goldreich(
Book
)
15 editions published in 2008 in English and held by 388 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
15 editions published in 2008 in English and held by 388 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
Theoretical computer science : essays in memory of Shimon Even by
Oded Goldreich(
Book
)
14 editions published in 2006 in English and held by 248 WorldCat member libraries worldwide
14 editions published in 2006 in English and held by 248 WorldCat member libraries worldwide
P, NP, and NPcompleteness : the basics of computational complexity by
Oded Goldreich(
Book
)
13 editions published between 2010 and 2012 in English and held by 201 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"
13 editions published between 2010 and 2012 in English and held by 201 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"
A primer on pseudorandom generators by
Oded Goldreich(
Book
)
10 editions published in 2010 in English and held by 158 WorldCat member libraries worldwide
A fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomialtime algorithms, has been applied with respect to a variety of natural classes of distinguishing procedures. The resulting theory of pseudorandomness is relevant to science at large and is closely related to central areas of computer science, such as algorithmic design, complexity theory, and cryptography
10 editions published in 2010 in English and held by 158 WorldCat member libraries worldwide
A fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomialtime algorithms, has been applied with respect to a variety of natural classes of distinguishing procedures. The resulting theory of pseudorandomness is relevant to science at large and is closely related to central areas of computer science, such as algorithmic design, complexity theory, and cryptography
Foundations of cryptography II : basic applications by
Oded Goldreich(
Book
)
29 editions published between 2004 and 2011 in English and held by 126 WorldCat member libraries worldwide
Annotation
29 editions published between 2004 and 2011 in English and held by 126 WorldCat member libraries worldwide
Annotation
Concurrent zeroknowledge by
Alon Rosen(
Book
)
7 editions published between 2006 and 2010 in English and held by 120 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
7 editions published between 2006 and 2010 in English and held by 120 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
Property testing : current research and surveys by
Oded Goldreich(
)
15 editions published between 2010 and 2011 in English and held by 84 WorldCat member libraries worldwide
Property Testing is the study of superfast (randomized) algorithms for approximate decision making. These algorithms are given direct access to items of a huge data set, and determine, whether this data set has some predetermined (global) property or is far from having this property. Remarkably, this approximate decision is made by accessing a small portion of the data set. This stateoftheart survey presents a collection of extended abstracts and surveys of leading researchers in property testing and related areas; it reflects the program of a miniworkshop on property testing that took place in January 2010 at the Institute for Computer Science (ITCS), Tsinghua University, Beijing, China. The volume contains two editor's introductions, 10 survey papers and 18 extended abstracts
15 editions published between 2010 and 2011 in English and held by 84 WorldCat member libraries worldwide
Property Testing is the study of superfast (randomized) algorithms for approximate decision making. These algorithms are given direct access to items of a huge data set, and determine, whether this data set has some predetermined (global) property or is far from having this property. Remarkably, this approximate decision is made by accessing a small portion of the data set. This stateoftheart survey presents a collection of extended abstracts and surveys of leading researchers in property testing and related areas; it reflects the program of a miniworkshop on property testing that took place in January 2010 at the Institute for Computer Science (ITCS), Tsinghua University, Beijing, China. The volume contains two editor's introductions, 10 survey papers and 18 extended abstracts
Foundations of cryptography by
Oded Goldreich(
Book
)
18 editions published between 2001 and 2007 in English and Undetermined and held by 55 WorldCat member libraries worldwide
18 editions published between 2001 and 2007 in English and Undetermined and held by 55 WorldCat member libraries worldwide
Studies in complexity and cryptography miscellanea on the interplay between randomness and computation by
Oded Goldreich(
)
14 editions published in 2011 in English and held by 51 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
14 editions published in 2011 in English and held by 51 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 cryptography : a primer by
Oded Goldreich(
Book
)
6 editions published in 2005 in English and held by 39 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)
6 editions published in 2005 in English and held by 39 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)
Probabilistic proof systems : a primer by
Oded Goldreich(
Book
)
7 editions published between 2007 and 2008 in English and held by 19 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
7 editions published between 2007 and 2008 in English and held by 19 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
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
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
A uniformcomplexity treatment of encryption and zeroknowledge by
Oded Goldreich(
Book
)
8 editions published between 1989 and 1991 in English and held by 10 WorldCat member libraries worldwide
8 editions published between 1989 and 1991 in English and held by 10 WorldCat member libraries worldwide
Proofs that yield nothing but their validity or all languages in NP have zeroknowledge proof systems 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
Foundations of cryptology by
Oded Goldreich(
Book
)
2 editions published in 2001 in English and held by 7 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
2 editions published in 2001 in English and held by 7 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
Theo retical Computer Science (vol. # 3895) Essays in Memory of Shimon Even by
Oded Goldreich(
)
7 editions published in 2006 in English and held by 4 WorldCat member libraries worldwide
7 editions published in 2006 in English and held by 4 WorldCat member libraries worldwide
Foundations of cryptology by
Oded Goldreich(
Book
)
3 editions published between 2001 and 2003 in English and held by 1 WorldCat member library worldwide
3 editions published between 2001 and 2003 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Rosenberg, Arnold L. 1941
 Selman, Alan L.
 Even, Shimon Honoree Author
 Rosen, Alon Author
 Avigad, Lidor
 Ron, Dana
 Micali, S.
 Bellare, Mihir Author
 Wigderson, A.
 Even, S. Author
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 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 Even, Shimon Information theory Mathematics Polynomials Proof theory Random number generators Turing machines Zeroknowledge proofs
Alternative Names
Goldreich, O.
Goldreich, O. 1957
Gwldrayk ʿWded 1957....
Gwldrayyk ʿWded 1957....
Oded Goldreich
Oded Goldreich cryptograaf uit Israël
Oded Goldreich Israeli cryptographer
Oded Goldreich israelischer Mathematiker
גולדרייך עודד 1957....
גולדריך עודד 1957....
ゴールトライヒ, O
Languages
Covers