The l-Diversity problem: Tractability and approximability

Publishing personal data without giving up privacy is becoming an increasingly important problem in different fields. In the last years, different interesting approaches have been proposed, i.e. k-Anonymity and l-Diversity. Given an input table, these approaches partition its rows so that the comput...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 511; s. 159 - 171
Hlavní autori:	Dondi, Riccardo, Mauri, Giancarlo, Zoppis, Italo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 04.11.2013
Predmet:	[formula omitted]-Anonymity [formula omitted]-Diversity Approximation complexity Parameterized complexity Approximation complexity l-Diversity k-Anonymity Parameterized complexity
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!