1 Introduction

2 Preliminaries  
2.1 The Local Model  
2.2 The Shuffle Model  

3 Separations between Local & Shuffle Privacy  
3.1 Binary Sums  
3.2 Histograms  
3.3 Uniformity testing  
3.4 Pointer-Chasing  

4 Separations between Central & Shuffle Privacy  
4.1 Single-message Shuffle Privacy  
4.2 m-message Shuffle Privacy  
4.3 Robust Shuffle Privacy  

5 The Promise of Interactivity  
5.1 Sequential Interactivity (S.I.)  
5.2 Full Interactivity (F.I.)  

6 Open Questions