Privacy Protection in Database Linking — A Logical Viewpoint

摘要: In this paper, we present a logical model for the privacy protection problem in database linking context. Assume there is large amount of data records center. Each record has some public attributes, values which are known to and confidential be protected. Users may obtain from center by submitting queries form linkage. When table released, manager must make sure that receiver will not know any particular individual released information he had before receiving data. To solve problem, propose simple epistemic logic user’s knowledge. model, concept safety rigorously defined an effective approach given test It shown generalization operations can applied original it less precise release generalized prevent violation privacy. Two kinds considered. The level-based one more restrictive. However, bottom-up search method used find maximally informative satisfying requirement. set-based one, on other hand, flexible. would require through whole space its computational complexity much higher, though graph theory help simplify procedure. As result, heuristic methods needed improve efficiency.