Data security equals graph connectivity

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 1, 1996, Pages 87-100

  Kao, Ming Yang ^a,b  

^a Duke University   (United States)

^b Yale University   (United States)

Author keywords

Bipartite completeness; Bipartite (k + 1) connectivity; Graph theory; Linear algebra; Mixed graphs; Statistical tables; Strong connectivity

Indexed keywords

ALGORITHM COMPLEXITY; GRAPH CONNECTIVITY; INFORMATION PROTECTION; STATISTICAL TABLE;

GRAPH THEORY; LINEAR ALGEBRA;

SECURITY OF DATA;

EID: 0030353658     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193243274     Document Type: Article

References (23)

1. G. J. BRACKSTONE, L. CHAPMAN, AND G. SANDE, Protecting the confidentiality of individual statistical records in Canada, in Proc. of the Conference of the European Statisticians 31st Plenary Session, Geneva, 1983.
2. J. CHERIYAN, M. Y. KAO, AND R. THURIMELLA, Scan-first search and sparse certificates: An improved parallel algorithm for k-vertex connectivity, SIAM J. Comput., 22 (1993), pp. 157-174.
3. T. H. CORMEN, C. L. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1991.
4. L. H. COX, Disclosure analysis and cell suppression, in Proc. of the American Statistical Association, Social Statistics Section, 1975, pp. 380-382.
5. _, Suppression methodology in statistics disclosure, in Proc. of the American Statistical Association, Social Statistics Section, 1977, pp. 750-755.
6. _, Automated statistical disclosure control, in Proc. of the American Statistical Association, Survey Research Method Section, 1978, pp. 177-182.
7. _, Suppression methodology and statistical disclosure control, J. Amer. Statist. Assoc., Theory and Method Section, 75 (1980), pp. 377-385.
8. L. H. COX AND G. SANDE, Techniques for preserving statistical confidentiality, in Proc. of the 42nd Session of the International Statistical Institute, the International Association of Survey Statisticians, 1979.
9. D. DENNING, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1982.
10. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, NY, 1979.
11. D. GUSFIELD, Optimal mixed graph augmentation, SIAM J. Comput., 16 (1987), pp. 599-612.
12. _, A graph theoretic approach to statistical data security, SIAM J. Comput., 17 (1988), pp. 552-571.
13. T. S. HSU AND M. Y. KAO, Optimal augmentation for componentwise bipartite biconnectivity in linear time, 1994, manuscript.
14. M. Y. KAO, Efficient detection and protection of information in cross tabulated tables II: Minimal linear invariants, in Proc. of the 1995 Asian Computing Science Conference, Pathumthani, Thailand, December 11-13, 1995.
15. _, Linear-time optimal augmentation for componentwise bipartite-completeness of graphs, Inform. Process. Lett., (1995), pp. 59-63.
16. M. Y. KAO AND D. GUSFIELD, Efficient detection and protection of information in cross tabulated tables I: Linear invariant test, SIAM J. Discrete Math., 6 (1993), pp. 460-476.
17. H. NAGAMOCHI AND T. IBARAKI, A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, (1992), pp. 583-596.
18. n, in Combinatorial Mathematics and its Applications, R. C. Bose and T. A. Dowling, eds., University of North Carolina Press, Chapel Hill, NC, 1969.
19. _, Network Flows and Monotropic Optimization, Wiley, New York, NY, 1984.
20. G. SANDE, Towards automated disclosure analysis for establishment based statistics, Tech. report, Statistics Canada, 1977.
21. _, A theorem concerning elementary aggregations in simple tables, Tech. report, Statistics Canada, 1978.
22. _, Automated cell suppression to preserve confidentiality of business statistics, Statist. J. United Nations, 2 (1984), pp. 33-41.
23. _, Confidentiality and polyhedra, an analysis of suppressed entries on cross tabulations, Tech. report, Statistics Canada, unknown date.