Before revision:  This is problematic for off-the-shelf implementations of the shuffler. Here, we propose a protocol whose message complexity is two when there are sufficiently many users.
After revision:  The message complexity is an informative predictor of a shuffle protocol's resource consumption. We present a protocol whose message complexity is two when there are sufficiently many users.