Suppression Methodology and Statistical Disclosure Control

Cox, Lawrence H.

doi:10.1080/01621459.1980.10477481

Cited by 160 publications

(65 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In technical terms disclosure limitation involves manipulating or masking a data matrix. Following important work by Cox (1980), Dalenius and Reiss (1982), Roberts (1986), Dalenius (1986), and Duncan and Lambert (1986), Duncan and Pearson (1991) provide a clear and accessible description of the methods available for the reduction of disclosure risk. More recent monographic treatments by de Waal (1996, 2001) and Doyle et al (2001) update the framework to emphasize disclosure risk assessment and administrative alternatives to statistical solutions.…”

Section: Disclosure Limitation Basicsmentioning

confidence: 99%

Providing Spatial Data for Secondary Analysis: Issues and Current Practices Relating to Confidentiality

Gutmann

Witkowski

Colyer

et al. 2008

Popul Res Policy Rev

View full text Add to dashboard Cite

Spatially explicit data pose a series of opportunities and challenges for all the actors involved in providing data for long-term preservation and secondary analysis --the data producer, the data archive, and the data user. We report on opportunities and challenges for each of the three players, and then turn to a summary of current thinking about how best to prepare, archive, disseminate, and make use of social science data that have spatially explicit identification. The core issue that runs through the paper is the risk of the disclosure of the identity of respondents. If we know where they live, where they work, or where they own property, it is possible to find out who they are. Those involved in collecting, archiving, and using data need to be aware of the risks of disclosure and become familiar with best practices to avoid disclosures that will be harmful to respondents.

show abstract

Section: Disclosure Limitation Basicsmentioning

confidence: 99%

Providing Spatial Data for Secondary Analysis: Issues and Current Practices Relating to Confidentiality

Gutmann

Witkowski

Colyer

et al. 2008

Popul Res Policy Rev

View full text Add to dashboard Cite

show abstract

“…Ernst (1989) demonstrated some general problems with network formulations when N Ն 3. (See also Cox 1980, 1987, Cox et al 1986, Gusfield 1988, Sullivan and Zayatz 1991, Rowe 1991.) Cox (1992) identifies the case of N Ն 3 as an important research problem.…”

Section: Two-dimensional Views: Network and Matricesmentioning

confidence: 99%

“…Mathematical optimization methods are used to assess upper and lower possible values in confidential two-way tables by Cox (1987) and Sande (1984). The upper and lower bounds for a sensitive cell are called the ambiguity width by Robertson (1994) and feasibility interval by Willenborg and de Waal (1996, p. 101).…”

Section: Linear Programming Formulationmentioning

confidence: 99%

“…Previous works have addressed the case of disclosure detection and protection in two-dimensional tables (Cox 1980, Carvalho et al 1994, Muralidhar et al 1995. We focus on multidimensional categorical databases, which are N-dimensional tables with each dimension categorical.…”

Section: Introductionmentioning

confidence: 99%

“…Beyond showing the inadequacies of a structural approach, this technique provides a systematic method that the database administrator can use for disclosure detection. Linear programming methods have been used in various aspects of confidentiality research, for instance by Kelly et al (1990), Sande (1984), Cox (1987), andZayatz (1992).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Disclosure Detection in Multivariate Categorical Databases: Auditing Confidentiality Protection Through Two New Matrix Operators

Chowdhury¹,

Duncan

Krishnan

et al. 1999

Management Science

View full text Add to dashboard Cite

A s databases grow more prevalent and comprehensive, database administrators seek to limit disclosure of confidential information while still providing access to data. Practical databases accommodate users with heterogeneous needs for access. Each class of data user is accorded access to only certain views. Other views are considered confidential, and hence to be protected. Using illustrations from health care and education, this article addresses inferential disclosure of confidential views in multidimensional categorical databases. It demonstrates that any structural, so data-value-independent method for detecting disclosure can fail. Consistent with previous work for two-way tables, it presents a data-value-dependent method to obtain tight lower and upper bounds for confidential data values. For two-dimensional projections of categorical databases, it exploits the network structure of a linear programming (LP) formulation to develop two transportation flow algorithms that are both computationally efficient and insightful. These algorithms can be easily implemented through two new matrix operators, cellmaxima and cell-minima. Collectively, this method is called matrix comparative assignment (MCA). Finally, it extends both the LP and MCA approaches to inferential disclosure when accessible views have been masked.

show abstract

Statistical Disclosure Limitation

Cox¹

2004

Encyclopedia of Statistical Sciences

View full text Add to dashboard Cite

Suppression Methodology and Statistical Disclosure Control

Cited by 160 publications

References 3 publications

Providing Spatial Data for Secondary Analysis: Issues and Current Practices Relating to Confidentiality

Providing Spatial Data for Secondary Analysis: Issues and Current Practices Relating to Confidentiality

Disclosure Detection in Multivariate Categorical Databases: Auditing Confidentiality Protection Through Two New Matrix Operators

Statistical Disclosure Limitation

Contact Info

Product

Resources

About