WorldCat Identities

Goldreich, Oded

Overview
Works: 93 works in 292 publications in 2 languages and 5,851 library holdings
Genres: Conference proceedings 
Roles: Editor, Creator
Classifications: QA268, 652.8
Publication Timeline
Key
Publications about  Oded Goldreich Publications about Oded Goldreich
Publications by  Oded Goldreich Publications by Oded Goldreich
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,061 WorldCat member libraries worldwide
Foundations of cryptography--a primer by Oded Goldreich ( )
40 editions published between 2001 and 2006 in English and held by 1,014 WorldCat member libraries worldwide
Revolutionary developments which took place in the 1980's have transformed cryptography from a semi-scientific discipline to a respectable field in theoretical Computer Science. In particular, concepts such as computational indistinguishability, pseudorandomness and zero-knowledge 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 ( )
15 editions published in 2006 in English and held by 542 WorldCat member libraries worldwide
P, NP, and NP-completeness the basics of computational complexity by Oded Goldreich ( )
13 editions published in 2010 in English and held by 529 WorldCat member libraries worldwide
"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 hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete"--
Concurrent zero-knowledge by Alon Rosen ( )
7 editions published between 2006 and 2010 in English and held by 460 WorldCat member libraries worldwide
Protocols that remain zero-knowledge when many instances are executed concurrently are called concurrent zero-knowledge. Devoted to their study, this book presents constructions of concurrent zero-knowledge 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 )
14 editions published in 2008 in English and held by 458 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 430 WorldCat member libraries worldwide
Annotation
Modern cryptography, probabilistic proofs, and pseudorandomness by Oded Goldreich ( Book )
11 editions published between 1999 and 2011 in English and German and held by 404 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 362 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 average-case complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NP-completeness, one-way functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zero-knowledge, and non-iterative zero-knowledge. 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 149 WorldCat member libraries worldwide
A primer on pseudorandom generators by Oded Goldreich ( Book )
9 editions published in 2010 in English and held by 143 WorldCat member libraries worldwide
This primer surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators (withstanding any polynomial-time distinguisher). Additional topics include the "derandomization" of arbitrary probabilistic polynomial-time algorithms, pseudorandom generators withstanding space-bounded distinguishers, and serveral natural notions of special-purpose pseudorandom generators
Foundations of cryptography by Oded Goldreich ( Book )
11 editions published between 2001 and 2006 in English and held by 45 WorldCat member libraries worldwide
Probabilistic proof systems : a primer by Oded Goldreich ( Book )
9 editions published between 1994 and 2008 in English and held by 35 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, zero-knowledge 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 30 WorldCat member libraries worldwide
Approximating average parameters of graphs in memory of Shimon Even (1935-2004) ( )
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
Foundations of cryptology by Oded Goldreich ( Book )
4 editions published between 2001 and 2004 in English and held by 14 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
On concurrent identification protocols by Oded Goldreich ( Book )
3 editions published in 1983 in English and held by 6 WorldCat member libraries worldwide
RSA/Rabin least significant bits are 1/2 + 1 [over] poly (log N) secure by Ben-Zion Chor ( Book )
1 edition published in 1984 in English and held by 6 WorldCat member libraries worldwide
A uniform-complexity treatment of encryption and zero-knowledge by Oded Goldreich ( Book )
4 editions published between 1989 and 1991 in English and held by 6 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.61 (from 0.35 for Foundation ... to 0.92 for RSA/Rabin ...)
Alternative Names
Goldreich, O.
Goldreich, O. 1957-
Gwldrayk ʿWded 1957-....
Gwldrayyk ʿWded 1957-....
גולדרייך עודד 1957-....
גולדריך עודד 1957-....
ゴールトライヒ, O
Languages
English (197)
German (1)
Covers