communication complexity of private simultaneous messages
play

Communication Complexity of Private Simultaneous Messages, Revisited - PowerPoint PPT Presentation

Oct 24, 2022 •278 likes •1.32k views

Communication Complexity of Private Simultaneous Messages, Revisited Manoj Mishra Department of Electrical Engineering - Systems Tel Aviv University Joint work with Benny Applebaum (TAU), Thomas Holenstein (Google), Ofer Shayevitz (TAU)

  1. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 0 1 . . . . . . . . . a J b L

  2. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 0 1 . . . . . . . . . a J b L

  3. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 . . 1 0 1 . . . . . a J b L

  4. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 . . 1 0 1 . . . . . a J b L

  5. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 . . 1 Communication: log |M A | + log |M B | 0 1 . . . . . a J b L

  6. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 . . Mechanism: 1 0 1 . . . . . a J b L

  7. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 . . Mechanism: 1 • Lowerbound number of r ’s 0 1 . . . . . a J b L

  8. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 . . Mechanism: 1 • Lowerbound number of r ’s 0 1 . . • Lowerbound size of each image set . . . a J b L

  9. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 . . Mechanism: 1 • Lowerbound number of r ’s 0 1 . . • Lowerbound size of each image set . . • Upperbound size of overlap between two image sets . a J b L

  10. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Assumption 1 on f : . . 1 0 1 . . . . . a J b L

  11. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Assumption 1 on f : . . 1 • f non-degenerate: 0 1 . . . . . a J b L

  12. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Assumption 1 on f : . . 1 • f non-degenerate: 0 1 . . • x � = x ′ ⇒ f ( x , · ) � = f ( x ′ , · ) . . . a J b L

  13. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Assumption 1 on f : . . 1 • f non-degenerate: 0 1 . . • x � = x ′ ⇒ f ( x , · ) � = f ( x ′ , · ) • Simarly for y � = y ′ . . . a J b L

  14. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Assumption 1 on f : . . 1 • f non-degenerate: 0 1 . . • x � = x ′ ⇒ f ( x , · ) � = f ( x ′ , · ) • Simarly for y � = y ′ . . . a J Consequence: b L

  15. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Assumption 1 on f : . . 1 • f non-degenerate: 0 1 . . • x � = x ′ ⇒ f ( x , · ) � = f ( x ′ , · ) • Simarly for y � = y ′ . . . a J Consequence: • r is one-to-one b L

  16. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Useful Edge ( x , y ): . . 1 0 1 . . . . . a J b L

  17. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Useful Edge ( x , y ): . . 1 • f ( x , y ) = f ( x , y ) 0 1 . . . . . a J b L

  18. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Useful Edge ( x , y ): . . 1 • f ( x , y ) = f ( x , y ) 0 1 . . • x : x with last bit inverted . . . a J b L

  19. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Useful Edge ( x , y ): . . 1 • f ( x , y ) = f ( x , y ) 0 1 . . • x : x with last bit inverted . . Assumption 2 on f : . a J b L

  20. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Useful Edge ( x , y ): . . 1 • f ( x , y ) = f ( x , y ) 0 1 . . • x : x with last bit inverted . . Assumption 2 on f : • Half of the edges are useful . a J b L

  21. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 x 1 y 1 1 0 . 1 . 0 1 x 2 y 2 r 2 0 · · 1 . . 1 · · 0 1 x K y K 1 r 3 0 1 . . 0 1 Useful Edge ( x , y ): . . 1 • f ( x , y ) = f ( x , y ) 0 1 . . • x : x with last bit inverted . . Assumption 2 on f : • Half of the edges are useful . a J Consequence: b L

  22. Revisiting P.S.M. Lowerbound M A M B 0 a 1 b 1 0 Y X 1 a 2 b 2 r 1 0 y 1 x 1 1 0 1 . . 0 1 y 2 x 2 r 2 0 · · 1 1 . . · · 0 1 x K y K 1 r 3 0 . 1 . 0 1 . . Useful Edge ( x , y ): 1 • f ( x , y ) = f ( x , y ) 0 1 . . • x : x with last bit inverted . . Assumption 2 on f : • Half of the edges are useful . a J Consequence: b L • Image set has half of f ’s edges

  23. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps

  24. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps x r r y r ˜ ˜ a r b x Non-trivial Overlaps

  25. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps x r r y r ˜ ˜ a r b x Non-trivial Overlaps Y X ′ ◦ 0 Complementary Similar Rectangles X ′ ◦ 1 Truth Table of f

  26. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps x r r y r ˜ ˜ a r b x Non-trivial Overlaps Y X ′ ◦ 0 Complementary Similar Rectangles X ′ ◦ 1 Assumption 3 on f : Size ≤ 2 · 2 k Truth Table of f

  27. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps x r r y r ˜ ˜ a r b x Non-trivial Overlaps y x r r ˜ r ˜ r a b ˜ ˜ y x Unaccounted Overlaps

  28. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps x r r y r ˜ ˜ a r b x Non-trivial Overlaps y x r r ˜ r ˜ r a b ˜ ˜ y x Unaccounted Overlaps Implication:

  29. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps x r r y r ˜ ˜ a r b x Non-trivial Overlaps y x r r ˜ r ˜ r a b ˜ ˜ y x Unaccounted Overlaps Implication: • Reveal all inputs not required to be private .

  30. Revisiting P.S.M. Lowerbound r r y x r ˜ r ˜ a b Trivial Overlaps x r r y r ˜ ˜ a r b x Non-trivial Overlaps y x r r ˜ r ˜ r a b ˜ ˜ y x Unaccounted Overlaps Implication: • Reveal all inputs not required to be private . • Potentially higher communication cost

  31. Counterexample to P.S.M. Lowerbound � T 0 · x [1 : k − 1] ◦ 0 , � x [ k ] = 0 L ( x ) := , T 1 · x [1 : k − 1] ◦ 1 , x [ k ] = 1 f ( x , y ) = < L ( x ) , y > , T 0 , T 1 , T 0 + T 1 : full rank

  32. Counterexample to P.S.M. Lowerbound � T 0 · x [1 : k − 1] ◦ 0 , � x [ k ] = 0 L ( x ) := , T 1 · x [1 : k − 1] ◦ 1 , x [ k ] = 1 f ( x , y ) = < L ( x ) , y > , T 0 , T 1 , T 0 + T 1 : full rank x , R A C y , R B

  33. Counterexample to P.S.M. Lowerbound � T 0 · x [1 : k − 1] ◦ 0 , � x [ k ] = 0 L ( x ) := , T 1 · x [1 : k − 1] ◦ 1 , x [ k ] = 1 f ( x , y ) = < L ( x ) , y > , T 0 , T 1 , T 0 + T 1 : full rank x , R A L ( x ) C y , R B

  34. Counterexample to P.S.M. Lowerbound � T 0 · x [1 : k − 1] ◦ 0 , � x [ k ] = 0 L ( x ) := , T 1 · x [1 : k − 1] ◦ 1 , x [ k ] = 1 f ( x , y ) = < L ( x ) , y > , T 0 , T 1 , T 0 + T 1 : full rank • PSM for < · , · > x , R A L ( x ) C y , R B

  35. Counterexample to P.S.M. Lowerbound � T 0 · x [1 : k − 1] ◦ 0 , � x [ k ] = 0 L ( x ) := , T 1 · x [1 : k − 1] ◦ 1 , x [ k ] = 1 f ( x , y ) = < L ( x ) , y > , T 0 , T 1 , T 0 + T 1 : full rank • PSM for < · , · > x , R A M A L ( x ) < L ( x ) , y > C M B y , R B

  36. Counterexample to P.S.M. Lowerbound � T 0 · x [1 : k − 1] ◦ 0 , � x [ k ] = 0 L ( x ) := , T 1 · x [1 : k − 1] ◦ 1 , x [ k ] = 1 f ( x , y ) = < L ( x ) , y > , T 0 , T 1 , T 0 + T 1 : full rank • PSM for < · , · > x , R A M A L ( x ) < L ( x ) , y > C M B • Communication: 2k + 2 bits y , R B

  37. New Proof for a Communication Lowerbound • x ∈ X , y ∈ Y , R ∈ { 0 , 1 } ∗ • f : X × Y → Z x , R A M A f ( x , y ) C • Pefect correctness M B • Perfect privacy y , R B

  38. Key idea of the proof M A M B a 0 b 0 Y X y 0 x 0 a 1 b 1 x 1 y 1 a 2 b 2 . . . . . . . x J . y K b ˜ K a ˜ J

  39. Key idea of the proof M A M B a 0 b 0 Y X y 0 x 0 a 1 b 1 x 1 y 1 a 2 b 2 . . . . . . . x J . y K b ˜ K µ ∽ X × Y a ˜ J

  40. Key idea of the proof M A M B a 0 b 0 Y X y 0 x 0 a 1 b 1 x 1 y 1 a 2 b 2 ( X , Y ) . . . . . . . x J . y K b ˜ K µ ∽ X × Y a ˜ J

  41. Key idea of the proof M A M B R a 0 b 0 Y X y 0 x 0 a 1 b 1 x 1 y 1 a 2 b 2 ( X , Y ) . . . . . . . x J . y K b ˜ K µ ∽ X × Y a ˜ J

  42. Key idea of the proof M A M B R a 0 b 0 Y X y 0 x 0 a 1 b 1 x 1 y 1 a 2 b 2 ( X , Y ) . . . . ( X ′ , Y ′ ) . . . x J . y K b ˜ K µ ∽ X × Y a ˜ J

  43. Key idea of the proof M A M B R a 0 b 0 Y X y 0 x 0 a 1 b 1 x 1 y 1 a 2 b 2 ( X , Y ) . . . . ( X ′ , Y ′ ) . . . x J R ′ . y K b ˜ K µ ∽ X × Y a ˜ J

  44. Main Result Theorem Let f : X × Y → Z be non-degenerate and let µ be a distribution on X × Y . Then, PSM ( f ) ≥ log(1 /α ( µ )) + H ∞ ( µ ) − log(1 /β ( µ )) − 1 .

  45. Main Result Theorem Let f : X × Y → Z be non-degenerate and let µ be a distribution on X × Y . Then, PSM ( f ) ≥ log(1 /α ( µ )) + H ∞ ( µ ) − log(1 /β ( µ )) − 1 . Y R 1 α ( µ ) := Volume of disjoint, Similar Rectangles X := ( R 1 , R 2 : similar, disjoint) { min( µ ( R 1 ) , µ ( R 2 )) } max R 2 Truth Table of f

  46. Main Result Theorem Let f : X × Y → Z be non-degenerate and let µ be a distribution on X × Y . Then, PSM ( f ) ≥ log(1 /α ( µ )) + H ∞ ( µ ) − log(1 /β ( µ )) − 1 . H ∞ ( µ ) := Min. Entropy of µ

  47. Main Result Theorem Let f : X × Y → Z be non-degenerate and let µ be a distribution on X × Y . Then, PSM ( f ) ≥ log(1 /α ( µ )) + H ∞ ( µ ) − log(1 /β ( µ )) − 1 . β ( µ ) := Volume of Useful Edges := Pr[( X , Y ) � = ( X ′ , Y ′ ) | f ( X , Y ) = f ( X ′ , Y ′ )]

  48. Special cases Theorem (Boolean function) For non-degenerate f : X × Y → { 0 , 1 } , PSM ( f ) ≥ 2(log |X| + log |Y| ) − log M − 3 .

  49. Special cases Theorem (Boolean function) For non-degenerate f : X × Y → { 0 , 1 } , PSM ( f ) ≥ 2(log |X| + log |Y| ) − log M − 3 . M := ( R 1 , R 2 : similar, disjoint) | R 1 | max

  50. Special cases Theorem (Boolean function) For non-degenerate f : X × Y → { 0 , 1 } , PSM ( f ) ≥ 2(log |X| + log |Y| ) − log M − 3 . Proof. Use µ : uniform distribution. �

  51. Special cases Theorem (Boolean function) For non-degenerate f : X × Y → { 0 , 1 } , PSM ( f ) ≥ 2(log |X| + log |Y| ) − log M − 3 . Corollary (Random function) For a random, boolean f : { 0 , 1 } k × { 0 , 1 } k → { 0 , 1 } , w.h.p., PSM ( f ) ≥ 3 k − 2 log k − 1 .

  52. Special cases Theorem (Boolean function) For non-degenerate f : X × Y → { 0 , 1 } , PSM ( f ) ≥ 2(log |X| + log |Y| ) − log M − 3 . Corollary (Random function) For a random, boolean f : { 0 , 1 } k × { 0 , 1 } k → { 0 , 1 } , w.h.p., PSM ( f ) ≥ 3 k − 2 log k − 1 . Proof. W.h.p., M ≤ k 2 · 2 k . �

  53. Special cases Theorem (Boolean function) For non-degenerate f : X × Y → { 0 , 1 } , PSM ( f ) ≥ 2(log |X| + log |Y| ) − log M − 3 . Corollary (Random function) For a random, boolean f : { 0 , 1 } k × { 0 , 1 } k → { 0 , 1 } , w.h.p., PSM ( f ) ≥ 3 k − 2 log k − 1 . Theorem (Explicit functions) f k : { 0 , 1 } k × { 0 , 1 } k → { 0 , 1 } � � ∃ k for which PSM ( f k ) ≥ 3 k − O (log k )

  54. Special cases Theorem (Boolean function) For non-degenerate f : X × Y → { 0 , 1 } , PSM ( f ) ≥ 2(log |X| + log |Y| ) − log M − 3 . Corollary (Random function) For a random, boolean f : { 0 , 1 } k × { 0 , 1 } k → { 0 , 1 } , w.h.p., PSM ( f ) ≥ 3 k − 2 log k − 1 . Theorem (Explicit functions) f k : { 0 , 1 } k × { 0 , 1 } k → { 0 , 1 } � � ∃ k for which PSM ( f k ) ≥ 3 k − O (log k ) Proof. Suffices to sample f k from poly(k)-wise independent distribution. �

  55. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s A C ( x , y ) y B

  56. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s • h : X × Y → { 0 , 1 } A s iff h ( x , y ) = 1 C ( x , y ) y B

  57. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s • h : X × Y → { 0 , 1 } A s iff h ( x , y ) = 1 C ( x , y ) • Pefect correctness y B • Perfect privacy

  58. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s , R • h : X × Y → { 0 , 1 } A • R ∈ { 0 , 1 } ∗ s iff h ( x , y ) = 1 C ( x , y ) • Pefect correctness y , R B • Perfect privacy

  59. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s , R • h : X × Y → { 0 , 1 } A • R ∈ { 0 , 1 } ∗ M A s iff h ( x , y ) = 1 C ( x , y ) M B • Pefect correctness y , R B • Perfect privacy

  60. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s , R • h : X × Y → { 0 , 1 } A • R ∈ { 0 , 1 } ∗ M A s iff h ( x , y ) = 1 C ( x , y ) M B • Pefect correctness y , R B • Perfect privacy • Useful applications: unconditionally private information retrieval (P.I.R.), priced O.T., secret sharing for graph-based access structures, attribute-based encryption

  61. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s , R • h : X × Y → { 0 , 1 } A • R ∈ { 0 , 1 } ∗ M A s iff h ( x , y ) = 1 C ( x , y ) M B • Pefect correctness y , R B • Perfect privacy • Communication lowerbound : • Ω(log k ) for several explicit predicates (Gay et al., CRYPTO, 2015)

  62. Conditional Disclosure of a Secret (C.D.S.) • x ∈ X , y ∈ Y • s ∈ { 0 , 1 } x , s , R • h : X × Y → { 0 , 1 } A • R ∈ { 0 , 1 } ∗ M A s iff h ( x , y ) = 1 C ( x , y ) M B • Pefect correctness y , R B • Perfect privacy • Communication lowerbound : • Ω(log k ) for several explicit predicates (Gay et al., CRYPTO, 2015) • k − o ( k ) for some non-explicit predicate (Applebaum et al., CRYPTO, 2017)

  63. C.D.S. Lowerbound Theorem For predicate h : X × Y → { 0 , 1 } , CDS ( h ) ≥ 2 log | h − 1 (0) | − log M − log |X| − log |Y| − 1 .

  64. C.D.S. Lowerbound Theorem For predicate h : X × Y → { 0 , 1 } , CDS ( h ) ≥ 2 log | h − 1 (0) | − log M − log |X| − log |Y| − 1 . | h − 1 (0) | := Number of 0-inputs of h

  65. C.D.S. Lowerbound Theorem For predicate h : X × Y → { 0 , 1 } , CDS ( h ) ≥ 2 log | h − 1 (0) | − log M − log |X| − log |Y| − 1 . Y M := Size of largest 0-monochromatic rectangle of h X All 0’s Truth Table of h

  66. C.D.S. Lowerbound : Special Cases Corollary (CDS for Inner Product) For predicate h ( x , y ) = < x , y > , x , y ∈ { 0 , 1 } k , CDS ( h ) ≥ k − 3 − o (1) .

  67. C.D.S. Lowerbound : Special Cases Corollary (CDS for Inner Product) For predicate h ( x , y ) = < x , y > , x , y ∈ { 0 , 1 } k , CDS ( h ) ≥ k − 3 − o (1) . Remarks: • Tight bound. • Previous bound: Ω(log k ).

  68. C.D.S. Lowerbound : Special Cases Corollary (CDS for Inner Product) For predicate h ( x , y ) = < x , y > , x , y ∈ { 0 , 1 } k , CDS ( h ) ≥ k − 3 − o (1) . Remarks: • Tight bound. • Previous bound: Ω(log k ). Corollary (CDS for Random predicate) For a random predicate h : { 0 , 1 } k × { 0 , 1 } k → { 0 , 1 } , w.h.p., CDS ( h ) ≥ k − 4 − o (1) .

  69. Summary We revisited the P.S.M. lowerbound of Feige, Kilian, Naor(FKN) (STOC, 1994) and proved the following results:

  70. Summary We revisited the P.S.M. lowerbound of Feige, Kilian, Naor(FKN) (STOC, 1994) and proved the following results: • Counterexample: an f whose P.S.M. communicates only 2 k + 2 bits.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Data Streams &amp; Communication Complexity Lecture 3: Communication Complexity and Lower Bounds

Data Streams &amp; Communication Complexity Lecture 3: Communication Complexity and Lower Bounds

Data Streams &amp; Communication Complexity Lecture 3: Communication Complexity and Lower Bounds Andrew McGregor, UMass Amherst 1/23 Basic Communication Complexity Three friends Alice, Bob, and Charlie each have some information x , y , z

1.11k views • 98 slides
Communication Complexity BASICS Summer School 2015 Communication

Communication Complexity BASICS Summer School 2015 Communication

Communication Complexity BASICS Summer School 2015 Communication Complexity of Relations Direct Sum Lower Bounds for Disjointness Asymmetric Communication Complexity and Data Structures d H ( x, y ) 0

1.7k views • 154 slides
A Stable Marriage Requires Communication Complexity Communication Complexity Proofs Yannai A.

A Stable Marriage Requires Communication Complexity Communication Complexity Proofs Yannai A.

Background Query A Stable Marriage Requires Communication Complexity Communication Complexity Proofs Yannai A. Gonczarowski Open Problems The Hebrew University of Jerusalem and Microsoft Research January 5, 2015 Joint work with: Noam

1.48k views • 121 slides
The communication complexity of the private value single item bisection auction Elena Grigorieva

The communication complexity of the private value single item bisection auction Elena Grigorieva

The communication complexity of the private value single item bisection auction Elena Grigorieva P.Jean-Jacques Herings uller Rudolf M Dries Vermeulen June 21, 2004 Abstract In this paper we present a new auction, the bisection

458 views • 13 slides
Privacy index metrics in digital communication Showing Caliopen's users how public their private

Privacy index metrics in digital communication Showing Caliopen's users how public their private

Privacy index metrics in digital communication Showing Caliopen's users how public their private messages are. Laurent Chemla, project owner Stanislas SABATIER, backend developer Caliopen handles all of your private exchanges Private

933 views • 9 slides
Communication Complexity Lecture 23 Computing with remote inputs 1 Communication Complexity

Communication Complexity Lecture 23 Computing with remote inputs 1 Communication Complexity

Communication Complexity Lecture 23 Computing with remote inputs 1 Communication Complexity 2 Communication Complexity Setting 2 Communication Complexity Setting Alice wants to compute f(x,y) 2 Communication Complexity Setting

1.58k views • 105 slides
Communication Complexity in Locally Private Distribution Estimation and Heavy Hitters ICML 2019,

Communication Complexity in Locally Private Distribution Estimation and Heavy Hitters ICML 2019,

Communication Complexity in Locally Private Distribution Estimation and Heavy Hitters ICML 2019, Long Beach June 11th, 2019 Jayadev Acharya, Cornell University Ziteng Sun, Cornell University Distribution Learning [ k ] = { 0 , 1 , 2 , ...,

359 views • 23 slides
Its not all digital Communication Support Needs Human communication is the effective exchange

Its not all digital Communication Support Needs Human communication is the effective exchange

Its not all digital Communication Support Needs Human communication is the effective exchange of information between two or more people Communication involves two processes: getting messages in: understanding getting messages out:

373 views • 19 slides
On the communication complexity of sparse set disjointness and exists-equal problems Mert

On the communication complexity of sparse set disjointness and exists-equal problems Mert

On the communication complexity of sparse set disjointness and exists-equal problems Mert Saglam University of Washington Joint work with Gbor Tardos Communication complexity f(X,Y)=? X Y Alice Bob R: Shared random source R

1.94k views • 136 slides
Simultaneous Private Learning of Mul4ple Concepts January 16,

Simultaneous Private Learning of Mul4ple Concepts January 16,

Simultaneous Private Learning of Mul4ple Concepts January 16, 2016 No obfusca4on! Mark Bun Kobbi Nissim

659 views • 37 slides
On Characterizing the Relationship between Lower Bound Methods in Communication Complexity

On Characterizing the Relationship between Lower Bound Methods in Communication Complexity

On Characterizing the Relationship between Lower Bound Methods in Communication Complexity Jiahui Liu, Prayaag Venkat Columbia University, University of Maryland College Park Thursday, August 10 Introduction: Communication Complexity

480 views • 29 slides
Low Complexity Real-Time Simultaneous Localization and Mapping Using Velodyne LiDAR Sensor Dr.

Low Complexity Real-Time Simultaneous Localization and Mapping Using Velodyne LiDAR Sensor Dr.

Low Complexity Real-Time Simultaneous Localization and Mapping Using Velodyne LiDAR Sensor Dr. Kiran Gunnam/Algorithms Group www.velodynelidar.com Director of Algorithms, Velodyne LiDAR, Inc. CONFIDENTIAL GTC-2018, March 29 th , 2018. Outline

461 views • 23 slides
Communication Complexity with Small Advantage Thomas Watson University of Memphis

Communication Complexity with Small Advantage Thomas Watson University of Memphis

Communication Complexity with Small Advantage Thomas Watson University of Memphis Communication complexity F : { 0 , 1 } n { 0 , 1 } n { 0 , 1 } Communication complexity F : { 0 , 1 } n { 0 , 1 } n { 0 , 1 } (Alice: x ) (Bob: y )

910 views • 66 slides
Simultaneous Multiparty Communication Protocols for Composed Functions Yassine Hamoudi IRIF ,

Simultaneous Multiparty Communication Protocols for Composed Functions Yassine Hamoudi IRIF ,

Simultaneous Multiparty Communication Protocols for Composed Functions Yassine Hamoudi IRIF , Universit Paris Diderot, CNRS MFCS 2018 Number-On-Forehead model [Chandra, Furst, Lipton83] 2 F : X 1 X k {0,1} Player 1 Player

772 views • 33 slides
Communication Complexity of Learning Discrete Distributions Krzysztof Onak IBM T.J. Watson

Communication Complexity of Learning Discrete Distributions Krzysztof Onak IBM T.J. Watson

Communication Complexity of Learning Discrete Distributions Krzysztof Onak IBM T.J. Watson Research Center Joint work with Ilias Diakonikolas , Elena Grigorescu , and Abhiram Natarajan . Krzysztof Onak (IBM Research) Communication Complexity of

634 views • 50 slides
Verification of Communication Protocols with Messages Carrying Values Tristan Le Gall joint work

Verification of Communication Protocols with Messages Carrying Values Tristan Le Gall joint work

ASYNCHRON 2006 Verification of Communication Protocols with Messages Carrying Values Tristan Le Gall joint work with Bertrand Jeannet and Thierry J eron Vertecs team IRISA/INRIA Rennes page 1 Comunication protocols Communication

563 views • 39 slides
Automatic Inference of Structural Changes for Matching Across Program Versions Miryung Kim,

Automatic Inference of Structural Changes for Matching Across Program Versions Miryung Kim,

Automatic Inference of Structural Changes for Matching Across Program Versions Miryung Kim, David Notkin, Dan Grossman Computer Science &amp; Engineering University of Washington Foo.mA(float) Foo.mA() Foo.mB(float) Foo.mB() Foo.mC()

730 views • 52 slides
Bringing Python to Godot 01/02/2020 Emmanuel Leblond - https://github.com/touilleMan/godot-python

Bringing Python to Godot 01/02/2020 Emmanuel Leblond - https://github.com/touilleMan/godot-python

Bringing Python to Godot 01/02/2020 Emmanuel Leblond - https://github.com/touilleMan/godot-python Godot ? Open source (MIT) Full featured Linux support Demo time ! Godot: dynamic from the ground class Node2D : public Node {

539 views • 29 slides
Protection Board Susan Tsui Grundmann , Chairman Anne M. Wagner , Vice Chairman Mary M. Rose ,

Protection Board Susan Tsui Grundmann , Chairman Anne M. Wagner , Vice Chairman Mary M. Rose ,

U.S. Merit Systems Protection Board Susan Tsui Grundmann , Chairman Anne M. Wagner , Vice Chairman Mary M. Rose , Member MSPB e-filing Elect e-filing online at e-appeal.mspb.gov Select the e-Filing Status option Or Do as part of initial

883 views • 67 slides
Exploiting Private Local Exploiting Private Local Memories to Reduce the Memories to Reduce the

Exploiting Private Local Exploiting Private Local Memories to Reduce the Memories to Reduce the

Exploiting Private Local Exploiting Private Local Memories to Reduce the Memories to Reduce the Opportunity Cost of Opportunity Cost of Accelerator Integration Accelerator Integration Emilio G. Cota Emilio G. Cota Paolo Mantovani Paolo

534 views • 30 slides
Manylogs Improving CMR/SMR Disk Bandwidth &amp; Latency Tiratat Patana-anake , Vincentius

Manylogs Improving CMR/SMR Disk Bandwidth &amp; Latency Tiratat Patana-anake , Vincentius

Manylogs Improving CMR/SMR Disk Bandwidth &amp; Latency Tiratat Patana-anake , Vincentius Martin, Nora Sandler, Cheng Wu, and Haryadi S. Gunawi 2 Manylogs @ MSST 16 Got 100% of the read bandwidth User 1 Big Read 3 Many Got 50%

941 views • 53 slides
GStreamer for Tiny Devices Olivier Crte Open First Who am I ? GStreamer at Collabora since

GStreamer for Tiny Devices Olivier Crte Open First Who am I ? GStreamer at Collabora since

GStreamer for Tiny Devices Olivier Crte Open First Who am I ? GStreamer at Collabora since 2007 Started with VVoIP: Telepathy &amp; Farstream Helps our customers use GStreamer Many embedded projects 2 A Tiny Device? Flash

586 views • 32 slides
Bits and Bytes At the smallest scale in the computer, information is stored as bits and bytes. In

Bits and Bytes At the smallest scale in the computer, information is stored as bits and bytes. In

Bits and Bytes At the smallest scale in the computer, information is stored as bits and bytes. In this section, we'll look at how that works. Bit Bit, like an atom, the smallest unit of storage A bit stores just a 0 or 1 &quot;In the

302 views • 9 slides
MOCHA: Federated Multi-Task Learning NIPS 17 Virginia Smith Stanford / CMU Chao-Kai

MOCHA: Federated Multi-Task Learning NIPS 17 Virginia Smith Stanford / CMU Chao-Kai

MOCHA: Federated Multi-Task Learning NIPS 17 Virginia Smith Stanford / CMU Chao-Kai Chiang USC Maziar Sanjabi USC Ameet Talwalkar CMU MACHINE LEARNING WORKFLOW data &amp; problem machine learning model n optimization

1.71k views • 35 slides

More recommend