'Poly size' presentation slideshows

Fearful Symmetry: Can We Solve Ideal Lattice Problems Efficiently?

Fearful Symmetry: Can We Solve Ideal Lattice Problems Efficiently?. Craig Gentry IBM T.J. Watson Workshop on Lattices with Symmetry. Can we efficiently break lattices with certain types of symmetry?.

913 views • 72 slides

New developments in Circuit Complexity From Circuit-SAT Algorithms to Circuit Lower Bounds

613 views • 49 slides

Circuits for Datalog Provenance

482 views • 35 slides

More on Randomized Class

More on Randomized Class. Def: A language L is in BPP c,s ( 0 ?s(n)?c(n)?1, ?n?N) if there exists a probabilistic poly-time TM M s.t. : 1. ?w?L, Pr[M accepts w] ? c(|w|) , 2. ?w?L, Pr[M(x) accepts] ? s(|w|) . Thm : (Amplification of BPP)

347 views • 28 slides

Partial Fairness in Secure Two-Party Computation

408 views • 27 slides

Partial Fairness in Secure Two-Party Computation

278 views • 27 slides

Partial Fairness in Secure Two-Party Computation

275 views • 27 slides

Universal Arguments and Their Applications

Universal Arguments and Their Applications. Boaz Barak & Oded Goldreich. Interactive Proofs for NP. [GMW] gave ZK proof w/ n 2 complexity for 3-Coloring. Corollary: ZK proof w/ t(n) 4 complexity for any Ntime(t) language L . (Since L is t(n) 2 -time reducible to 3-Coloring).

268 views • 16 slides