It presents an efficient solution to the Dining cryptographers problem.

Despite the word dining, the dining cryptographers problem is unrelated to the dining philosophers problem.

A similar idea, though in a non-public-key context, can be traced back to David Chaum's original solution to the Dining cryptographers problem.

In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-OR function.