Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/62019
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Brankovic, Ljiljana | en |
dc.contributor.author | Siran, Jozef | en |
local.source.editor | Editor(s): Oscar H. Ibarra and Louxin Zhang | en |
dc.date.accessioned | 2024-08-08T02:07:15Z | - |
dc.date.available | 2024-08-08T02:07:15Z | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | Computing and Combinatorics 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings, v.2387, p. 448-455 | en |
dc.identifier.isbn | 9783540439967 | en |
dc.identifier.isbn | 9783540456551 | en |
dc.identifier.issn | 0302-9743 | en |
dc.identifier.uri | https://hdl.handle.net/1959.11/62019 | - |
dc.description.abstract | <p>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.</p> | en |
dc.language | en | en |
dc.publisher | Springer | en |
dc.relation.ispartof | Computing and Combinatorics 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings | en |
dc.relation.ispartofseries | Lecture Notes in Computer Science | en |
dc.title | 2-Compromise Usability in 1-Dimensional Statistical Databases | en |
dc.type | Conference Publication | en |
dc.relation.conference | COCOON 2002: 8th Annual International Conference on Computing and Combinatorics (COCOON) Conference | en |
dc.identifier.doi | 10.1007/3-540-45655-4_48 | en |
local.contributor.firstname | Ljiljana | en |
local.contributor.firstname | Jozef | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | lbrankov@une.edu.au | en |
local.output.category | E1 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.date.conference | 15th to 17th of August, 2002 | en |
local.conference.place | Singapore | en |
local.publisher.place | United States of America | en |
local.format.startpage | 448 | en |
local.format.endpage | 455 | en |
local.series.number | 2387 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 2387 | en |
local.contributor.lastname | Brankovic | en |
local.contributor.lastname | Siran | en |
dc.identifier.staff | une-id:lbrankov | en |
local.profile.orcid | 0000-0002-5056-4627 | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:1959.11/62019 | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | 2-Compromise Usability in 1-Dimensional Statistical Databases | en |
local.output.categorydescription | E1 Refereed Scholarly Conference Publication | en |
local.conference.details | COCOON 2002: 8th Annual International Conference on Computing and Combinatorics (COCOON) Conference, Singapore, 15th to 17th of August, 2002 | en |
local.search.author | Brankovic, Ljiljana | en |
local.search.author | Siran, Jozef | en |
local.uneassociation | No | en |
local.atsiresearch | No | en |
local.sensitive.cultural | No | en |
local.year.published | 2002 | en |
local.subject.for2020 | 460402 Data and information privacy | en |
local.subject.for2020 | 490404 Combinatorics and discrete mathematics (excl. physical combinatorics) | en |
local.subject.seo2020 | 220499 Information systems, technologies and services not elsewhere classified | en |
local.profile.affiliationtype | External Affiliation | en |
local.profile.affiliationtype | External Affiliation | en |
Appears in Collections: | Conference Publication School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
SCOPUSTM
Citations
3
checked on Oct 12, 2024
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.