L-diversity

From CS Wiki

L-diversity is a concept designed to overcome the limitations of K-anonymity. It ensures diversity of sensitive information within groups of identical attribute values, requiring each group to have at least L distinct values of sensitive information.

Example

Applying L-diversity within groups with the same attributes like gender or age means each group should have at least L different values of sensitive information.

See Also[edit | edit source]