Paper Info
Title
The Security of Chaffing and Winnowing
Abstract
This paper takes a closer look at Rivest's chaffing-and-winnowing paradigm for data privacy.We begin with a definition which enables one to clearly determine 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 bit-by-bit scheme is easily proven secure but is inefficient. His more efficient scheme --based on all-or-nothing transforms (AONTs)-- can be attacked under Rivest's definition of security of an AONT, and even under stronger notions does not appear provable. However we show that by using OAEP as the AONT one can prove security, and also present a different scheme, still using AONTs, that is equally efficient and easily proven secure even under a relatively weak notion of security of AONTs.
Year
DOI
Venue
2000
10.1007/3-540-44448-3_40
IACR Cryptology ePrint Archive
Keywords
DocType
Volume
closer look,weak notion,different scheme,stronger notion,efficient scheme,data privacy,chaffing-and-winnowing paradigm,bit-by-bit scheme
Conference
2000
ISSN
ISBN
Citations 
0302-9743
3-540-41404-5
14
PageRank 
References 
Authors
1.18
11
2
Name
Order
Citations
PageRank
Mihir Bellare1164371481.16
Alexandra Boldyreva22297114.80