BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Japan
1 × Switzerland
14 × USA
2 × Greece
3 × Canada
Collaborated with:
D.Ron A.Wigderson S.Goldwasser R.Canetti S.P.Vadhan S.Micali M.Ben-Or M.Sudan A.Akavia D.Moshkovitz H.Krawczyk L.A.Levin M.Luby T.Gur R.D.Rothblum S.Halevi A.Sahai M.Bellare R.Ostrovsky E.Petrank U.Feige M.Naor S.Ben-David B.Chor R.L.Rivest E.Ben-Sasson P.Harsha G.Even N.Nisan B.Velickovic
Talks about:
knowledg (6) zero (5) function (4) complex (3) proxim (3) comput (3) proof (3) hard (3) way (3) one (3)

Person: Oded Goldreich

DBLP DBLP: Goldreich:Oded

Contributed to:

ICALP (1) 20152015
STOC 20142014
STOC 20102010
STOC 20092009
STOC 20062006
STOC 20042004
STOC 20022002
ICALP 20012001
ICALP 20002000
STOC 20002000
STOC 19991999
STOC 19981998
STOC 19971997
STOC 19961996
STOC 19951995
STOC 19941994
STOC 19931993
STOC 19921992
ICALP 19901990
STOC 19891989
STOC 19871987
ICALP 19851985

Wrote 28 papers:

ICALP-v1-2015-GoldreichGR #branch #context-free grammar #proving #proximity #source code
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs — (OG, TG, RDR), pp. 666–677.
STOC-2014-GoldreichW #algorithm #on the
On derandomizing algorithms that err extremely rarely (OG, AW), pp. 109–118.
STOC-2010-AkaviaGGM #np-hard
Erratum for: on basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 795–796.
STOC-2009-GoldreichR #on the #proximity #testing
On proximity oblivious testing (OG, DR), pp. 141–150.
STOC-2006-AkaviaGGM #np-hard #on the
On basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 701–710.
STOC-2004-Ben-SassonGHSV #proximity #robust
Robust pcps of proximity, shorter pcps and applications to coding (EBS, OG, PH, MS, SPV), pp. 1–10.
STOC-2002-Goldreich #concurrent #revisited
Concurrent zero-knowledge with timing, revisited (OG), pp. 332–340.
ICALP-2001-GoldreichVW #interactive #on the #proving
On Interactive Proofs with a Laconic Prover (OG, SPV, AW), pp. 334–345.
ICALP-2000-Goldreich #pseudo
Pseudorandomness (OG), pp. 687–704.
Resettable zero-knowledge (RC, OG, SG, SM), pp. 235–244.
STOC-1999-GoldreichRS #fault
Chinese Remaindering with Errors (OG, DR, MS), pp. 225–234.
STOC-1998-CanettiGH #random #revisited
The Random Oracle Methodology, Revisited (RC, OG, SH), pp. 209–218.
STOC-1998-GoldreichG #on the #problem
On the Limits of Non-Approximability of Lattice Problems (OG, SG), pp. 1–9.
STOC-1998-GoldreichR #graph #sublinear
A Sublinear Bipartiteness Tester for Bunded Degree Graphs (OG, DR), pp. 289–298.
STOC-1998-GoldreichSV #statistics
Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge (OG, AS, SPV), pp. 399–408.
STOC-1997-GoldreichR #bound #graph #testing
Property Testing in Bounded Degree Graphs (OG, DR), pp. 406–415.
STOC-1996-CanettiFGN #adaptation #multi
Adaptively Secure Multi-Party Computation (RC, UF, OG, MN), pp. 639–648.
STOC-1995-BellareGG #encryption #incremental
Incremental cryptography and application to virus protection (MB, OG, SG), pp. 45–56.
STOC-1994-GoldreichOP #complexity
Computational complexity and knowledge complexity (OG, RO, EP), pp. 534–543.
STOC-1994-GoldreichW #product line #random #trade-off
Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing (OG, AW), pp. 574–584.
Asynchronous secure computation (MBO, RC, OG), pp. 52–61.
STOC-1992-EvenGLNV #approximate #independence
Approximations of General Independent Distributions (GE, OG, ML, NN, BV), pp. 10–16.
ICALP-1990-GoldreichK #composition #on the #proving
On the Composition of Zero-Knowledge Proof Systems (OG, HK), pp. 268–282.
STOC-1989-Ben-DavidCGL #complexity #formal method #on the
On the Theory of Average Case Complexity (SBD, BC, OG, ML), pp. 204–216.
A Hard-Core Predicate for all One-Way Functions (OG, LAL), pp. 25–32.
STOC-1987-Goldreich #formal method #simulation #towards
Towards a Theory of Software Protection and Simulation by Oblivious RAMs (OG), pp. 182–194.
STOC-1987-GoldreichMW #game studies #how #protocol #theorem
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (OG, SM, AW), pp. 218–229.
ICALP-1985-Ben-OrGMR #contract #protocol
A Fair Protocol for Signing Contracts (MBO, OG, SM, RLR), pp. 43–52.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.