Constrained obfuscation of relational databases

DOI10.1016/J.INS.2014.07.009MaRDI QIDQ508612zbMATH OpenOpenAlexFDO

Authors Erez Shmueli, Tomer Zrihen, Ran Yahalom, Tamir Tassa

Publication date 7 February 2017

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2014.07.009

zbMATH Keywords

constrained satisfaction problemdiversityobfuscationprivacy preserving data publishing

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Resolving the Complexity of Some Data Privacy Problems
• K-anonymization approaches for supporting multiple constraints
• Privacy-preserving data publishing: a constraint-based clustering approach
• A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
• Database Theory - ICDT 2005

Cites work

• A practical approximation algorithm for optimal \(k\)-anonymity
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Privacy preserving database generation for database application testing

Cited in

(2)

• Conditional masking to numerical data
• Analysis and prevention of averaging attacks against obfuscation protocols

Describes a project that uses

Uses Software

• UCI
• Choco
• QAGen

This page was built for publication: Constrained obfuscation of relational databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508612)