Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62019
Title: 2-Compromise Usability in 1-Dimensional Statistical Databases
Contributor(s): Brankovic, Ljiljana  (author)orcid ; Siran, Jozef (author)
Publication Date: 2002
DOI: 10.1007/3-540-45655-4_48
Handle Link: https://hdl.handle.net/1959.11/62019
Abstract: 

Many believe that data mining poses the biggest privacy challenge in the next decade. In this paper we concentrate on threats to privacy arising from the possibility of combining aggregate data to deduce the confidential individual values. We determine the maximum number of sum totals that can be disclosed without leading to a 2-compromise in a 1-dimensional database for range queries.

Publication Type: Conference Publication
Conference Details: COCOON 2002: 8th Annual International Conference on Computing and Combinatorics (COCOON) Conference, Singapore, 15th to 17th of August, 2002
Source of Publication: Computing and Combinatorics 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings, v.2387, p. 448-455
Publisher: Springer
Place of Publication: United States of America
ISSN: 0302-9743
Fields of Research (FoR) 2020: 460402 Data and information privacy
490404 Combinatorics and discrete mathematics (excl. physical combinatorics)
Socio-Economic Objective (SEO) 2020: 220499 Information systems, technologies and services not elsewhere classified
Peer Reviewed: Yes
HERDC Category Description: E1 Refereed Scholarly Conference Publication
Series Name: Lecture Notes in Computer Science
Series Number : 2387
Appears in Collections:Conference Publication
School of Science and Technology

Files in This Item:
1 files
File SizeFormat 
Show full item record
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.