File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: SECURITY PROBLEMS ON INFERENCE CONTROL FOR SUM, MAX, AND MIN QUERIES.

TitleSECURITY PROBLEMS ON INFERENCE CONTROL FOR SUM, MAX, AND MIN QUERIES.
Authors
Issue Date1986
PublisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/jacm
Citation
Journal Of The Acm, 1986, v. 33 n. 3, p. 451-464 How to Cite?
AbstractThe basic inference problem is defined as follows: For a finite set X equals left brace x//1,. . . ,x//n right brace , we wish to infer properties of elements of X on the basis of sets of 'queries' regarding subsets of X. By restricting these queries to statistical queries, the statistical database (SDB) security problem is obtained. The security problem for the SDB is to limit the use of the SDB so that only statistical information is available and no sequence of queries is sufficient to infer protected information about any individual. When such information is obtained the SDB is said to be compromised. In this paper, two applications concerning the security of the SDB are considered: (1) On-line application. The queries are answered one by one in sequence and it is necessary to determine whether the SDB is compromised if a new query is answered. (2) Off-line application. All queries are available at the same time and it is necessary to determine the maximum subset of queries to be answered without compromising the SDB.
Persistent Identifierhttp://hdl.handle.net/10722/152220
ISSN
2015 Impact Factor: 1.803
2015 SCImago Journal Rankings: 2.509
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChin, Francisen_US
dc.date.accessioned2012-06-26T06:36:36Z-
dc.date.available2012-06-26T06:36:36Z-
dc.date.issued1986en_US
dc.identifier.citationJournal Of The Acm, 1986, v. 33 n. 3, p. 451-464en_US
dc.identifier.issn0004-5411en_US
dc.identifier.urihttp://hdl.handle.net/10722/152220-
dc.description.abstractThe basic inference problem is defined as follows: For a finite set X equals left brace x//1,. . . ,x//n right brace , we wish to infer properties of elements of X on the basis of sets of 'queries' regarding subsets of X. By restricting these queries to statistical queries, the statistical database (SDB) security problem is obtained. The security problem for the SDB is to limit the use of the SDB so that only statistical information is available and no sequence of queries is sufficient to infer protected information about any individual. When such information is obtained the SDB is said to be compromised. In this paper, two applications concerning the security of the SDB are considered: (1) On-line application. The queries are answered one by one in sequence and it is necessary to determine whether the SDB is compromised if a new query is answered. (2) Off-line application. All queries are available at the same time and it is necessary to determine the maximum subset of queries to be answered without compromising the SDB.en_US
dc.languageengen_US
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/jacmen_US
dc.relation.ispartofJournal of the ACMen_US
dc.titleSECURITY PROBLEMS ON INFERENCE CONTROL FOR SUM, MAX, AND MIN QUERIES.en_US
dc.typeArticleen_US
dc.identifier.emailChin, Francis:chin@cs.hku.hken_US
dc.identifier.authorityChin, Francis=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1145/5925.5928en_US
dc.identifier.scopuseid_2-s2.0-0022754707en_US
dc.identifier.volume33en_US
dc.identifier.issue3en_US
dc.identifier.spage451en_US
dc.identifier.epage464en_US
dc.identifier.isiWOS:A1986D198500003-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChin, Francis=7005101915en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats