The Second International Conference on Availability, Reliability and Security (ARES'07) 2007
DOI: 10.1109/ares.2007.118
|View full text |Cite
|
Sign up to set email alerts
|

Protecting Private Information by Data Separation in Distributed Spatial Data Warehouse

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…They proposed a new privacy method that migrates the data containing personally identifying information into an anonymized version of the data. Another approach is to store the separate pieces of composite personal data (in other words, related parts of a relational database) in different nodes of the data warehouse [26]. Narayanan, Madria, and St. Clair [27] suggested a system that may provide either exact or approximate answers to queries, depending on the user's permissions; this approach protects privacy by disallowing access to confidential information.…”
Section: "Legitimate" Aggregation: Data Miningmentioning
confidence: 99%
“…They proposed a new privacy method that migrates the data containing personally identifying information into an anonymized version of the data. Another approach is to store the separate pieces of composite personal data (in other words, related parts of a relational database) in different nodes of the data warehouse [26]. Narayanan, Madria, and St. Clair [27] suggested a system that may provide either exact or approximate answers to queries, depending on the user's permissions; this approach protects privacy by disallowing access to confidential information.…”
Section: "Legitimate" Aggregation: Data Miningmentioning
confidence: 99%
“…Data Separation: It is crucial to logically and physically separate personal data into multiple databases and on different servers to avoid linkability and prevent identification of an individual [12]. It is important to design database schema in such a way that the risky attribute combinations are separated which could otherwise lead to identification of linkages and ultimately identifiability.…”
Section: Privacy Aware Design Strategiesmentioning
confidence: 99%
“…No solution individually can support all the needs for both privacy and data mining. In large organization data may be distributed in many databases and thus the privacy in such an environment may demand a different approach, such as relational decomposition, as prescribed by Marcin and Jakub [13]. To overcome the discovery of intrusion technique reconstructing back the private information from the randomized data tuples, for a distributed environment, Zang et al [14] have proposed an algebraic-technique-based scheme.…”
Section: Preserving Data Privacymentioning
confidence: 99%