[Resource Topic] 2000/010: The Security of Chaffing and Winnowing

Welcome to the resource topic for 2000/010

The Security of Chaffing and Winnowing

Authors: Mihir Bellare, Alexandra Boldyreva


This paper takes a closer look at Rivest’s
chaffing-and-winnowing paradigm for data privacy. We begin with a
\textit{definition} which enables one to determine clearly whether a
given scheme qualifies as ``chaffing-and-winnowing.‘’ We then analyze
Rivest’s schemes to see what quality of data privacy they provide. His
simplest scheme is easily proven secure but is ineffient. The security
of his more efficient scheme —based on all-or-nothing transforms
(AONTs)— is however more problematic. It can be attacked under
Rivest’s definition of security of an AONT, and even under stronger
notions does not appear provable. We show however that by using a OAEP
as the AONT one can prove security. We also present a different scheme,
still using AONTs, that is equally efficient and easily proven secure
even under the original weak notion of security of AONTs.

ePrint: https://eprint.iacr.org/2000/010

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .