1 / 6

Introductions for the “Weizmann Distinguished Lectures Day”

Introductions for the “Weizmann Distinguished Lectures Day”. b y Oded Goldreich. Boaz Barak (MSR) [WIS’04]. Pioneering non-black-box proofs of security (e.g., for zero-knowledge):

ally
Download Presentation

Introductions for the “Weizmann Distinguished Lectures Day”

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introductions for the “Weizmann Distinguished Lectures Day” by OdedGoldreich

  2. Boaz Barak (MSR) [WIS’04] Pioneering non-black-box proofs of security (e.g., for zero-knowledge): Standard proofs of security are via reductions that use the hypothetical adversary as a black-box, and it was believed that limitations of such proofs represent real limitations. Work on randomness extraction (from few independent sources). Work on the Unique Game Conjecture.

  3. IritDinur (WIS) [TAU’01] PCP THM = Every NP-proof can be efficiently transformed to one that can be verified probabilistically by inspecting a constant number of bits in it. Prior proofs of the PCP theorem combined two extremely complex PCP systems. Irit’s proof starts with a trivial PCP system and obtains the final one by a long sequence of gradual amplifications of the detection probability. Focus: A proof of the PCP THM by (gradual) Gap Amplification. Along the way she resolves a problem that would have taken a decade to resolve otherwise: Obtaining PCP systems of almost linear length.

  4. Johan Hastad (KTH) [MIT’86] Pseudorandom Generators based on any One-Way Function. Tight: OWF are necessary. Leading 2nd generation of PCP constructions, culminating with (relatively tight) non-approximability results for several central optimization problems including MaxClique and MaxSAT. (relatively tight) Lower Bounds for AC0.

  5. SalilVadhan (Harvard) [MIT’99] Major player in 2nd generation of constructions of randomness extractors (from T’99 to GUV’07). Unconditional studies of ZK, culminating in SZKA based on any OWF.N.B.: Dual result to CZKIP based on OWF. The Zig-Zagproduct (see its application to UCONN in L).

  6. Richard Karp (UCB) [Harvard’59] • NP-Completeness ["Reducibility Among Combinatorial Problems", 1972] • Classical algorithms for optimization problems, including max-flow [w. Edmonds, 1971] and matching in bipartite graphs [w. Hopcroft, 1973]. • And much more… One of the founding fathers of Computer Science.

More Related