Privacy protection of binary confidential data against deterministic, stochastic, and insider threat

Robert Garfinkel, Ram Gopal, Paulo B Goes

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

A practical model and an associated method are developed for providing consistent, deterministically correct responses to ad-hoc queries to a database containing a field of binary confidential data. COUNT queries, i.e., the number of selected subjects whose confidential datum is positive, are to be answered. Exact answers may allow users to determine an individual's confidential information. Instead, the proposed technique gives responses in the form of a number plus a guarantee so that the user can determine an interval that is sure to contain the exact answer. At the same time, the method is also able to provide both deterministic and stochastic protection of the confidential data to the subjects of the database. Insider threat is defined precisely and a simple option for defense against it is given. Computational results on a simulated database are very encouraging in that most queries are answered with tight intervals, and that the quality of the responses improves with the number of subjects identified by the query. Thus the results are very appropriate for the very large databases prevalent in business and governmental organizations. The technique is very efficient in terms of both time and storage requirements, and is readily scalable and implementable.

Original languageEnglish (US)
Pages (from-to)749-764
Number of pages16
JournalManagement Science
Volume48
Issue number6
StatePublished - Jun 2002
Externally publishedYes

Fingerprint

Query
Data base
Insider
Privacy
Threat
Industry
Guarantee
Ad hoc

Keywords

  • Categorical Data
  • Confidentiality Protection
  • Database Security
  • Inference Disclosure

ASJC Scopus subject areas

  • Management of Technology and Innovation
  • Strategy and Management
  • Management Science and Operations Research

Cite this

Privacy protection of binary confidential data against deterministic, stochastic, and insider threat. / Garfinkel, Robert; Gopal, Ram; Goes, Paulo B.

In: Management Science, Vol. 48, No. 6, 06.2002, p. 749-764.

Research output: Contribution to journalArticle

@article{4c3709591aef4b1bb3bdf418950dc4a0,
title = "Privacy protection of binary confidential data against deterministic, stochastic, and insider threat",
abstract = "A practical model and an associated method are developed for providing consistent, deterministically correct responses to ad-hoc queries to a database containing a field of binary confidential data. COUNT queries, i.e., the number of selected subjects whose confidential datum is positive, are to be answered. Exact answers may allow users to determine an individual's confidential information. Instead, the proposed technique gives responses in the form of a number plus a guarantee so that the user can determine an interval that is sure to contain the exact answer. At the same time, the method is also able to provide both deterministic and stochastic protection of the confidential data to the subjects of the database. Insider threat is defined precisely and a simple option for defense against it is given. Computational results on a simulated database are very encouraging in that most queries are answered with tight intervals, and that the quality of the responses improves with the number of subjects identified by the query. Thus the results are very appropriate for the very large databases prevalent in business and governmental organizations. The technique is very efficient in terms of both time and storage requirements, and is readily scalable and implementable.",
keywords = "Categorical Data, Confidentiality Protection, Database Security, Inference Disclosure",
author = "Robert Garfinkel and Ram Gopal and Goes, {Paulo B}",
year = "2002",
month = "6",
language = "English (US)",
volume = "48",
pages = "749--764",
journal = "Management Science",
issn = "0025-1909",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "6",

}

TY - JOUR

T1 - Privacy protection of binary confidential data against deterministic, stochastic, and insider threat

AU - Garfinkel, Robert

AU - Gopal, Ram

AU - Goes, Paulo B

PY - 2002/6

Y1 - 2002/6

N2 - A practical model and an associated method are developed for providing consistent, deterministically correct responses to ad-hoc queries to a database containing a field of binary confidential data. COUNT queries, i.e., the number of selected subjects whose confidential datum is positive, are to be answered. Exact answers may allow users to determine an individual's confidential information. Instead, the proposed technique gives responses in the form of a number plus a guarantee so that the user can determine an interval that is sure to contain the exact answer. At the same time, the method is also able to provide both deterministic and stochastic protection of the confidential data to the subjects of the database. Insider threat is defined precisely and a simple option for defense against it is given. Computational results on a simulated database are very encouraging in that most queries are answered with tight intervals, and that the quality of the responses improves with the number of subjects identified by the query. Thus the results are very appropriate for the very large databases prevalent in business and governmental organizations. The technique is very efficient in terms of both time and storage requirements, and is readily scalable and implementable.

AB - A practical model and an associated method are developed for providing consistent, deterministically correct responses to ad-hoc queries to a database containing a field of binary confidential data. COUNT queries, i.e., the number of selected subjects whose confidential datum is positive, are to be answered. Exact answers may allow users to determine an individual's confidential information. Instead, the proposed technique gives responses in the form of a number plus a guarantee so that the user can determine an interval that is sure to contain the exact answer. At the same time, the method is also able to provide both deterministic and stochastic protection of the confidential data to the subjects of the database. Insider threat is defined precisely and a simple option for defense against it is given. Computational results on a simulated database are very encouraging in that most queries are answered with tight intervals, and that the quality of the responses improves with the number of subjects identified by the query. Thus the results are very appropriate for the very large databases prevalent in business and governmental organizations. The technique is very efficient in terms of both time and storage requirements, and is readily scalable and implementable.

KW - Categorical Data

KW - Confidentiality Protection

KW - Database Security

KW - Inference Disclosure

UR - http://www.scopus.com/inward/record.url?scp=0036602405&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036602405&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0036602405

VL - 48

SP - 749

EP - 764

JO - Management Science

JF - Management Science

SN - 0025-1909

IS - 6

ER -