Spreading Rumors Quietly and the Subgroup Escape Problem
Theory of Data Entanglement Protects Remotely Stored Data
1. Towards a Theory of Data Entanglement James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, and Sheng Zhong (Yale University)
2.
3.
4. Previous Work: Dagster [SW01] New Document Encrypt c randomly chosen blocks Pool of blocks Analysis: Deleting a typical document loss of O( c ) documents
5. Previous Work: Tangler [WM01] (0, New Document) 2 randomly chosen blocks Pool of n blocks Analysis: Deleting a typical document loss of O ( (log n ) / n ) documents Interpolate degree-2 poly F() (x 1 ,F(x 1 )) (x 2 ,F(x 2 ))
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20. Summary of Results all-or-nothing Private Recovery symmetric recovery all-or-nothing Public Recovery all-or-nothing all-or-nothing Standard Recovery Arbitrary Tamperer Destructive Tamperer
21.
Editor's Notes
How does the tamperer work and who gives out recovery algorithms?
Replace picture and possibly drop the formal definition
Add a picture of happy/unhappy computers
Add a picture of happy/unhappy computers
Emphasize that adversary cannot guess what the k_i are. Many-to-one map can’t be correct for most k_i. b/c of the property of polynomials. Maybe add picture (?)