Data Security Equals Graph Connectivity
| dc.creator | Kao, Ming-Yang | |
| dc.date | 2001-01-27 | |
| dc.date.accessioned | 2026-07-07T03:16:54Z | |
| dc.date.available | 2026-07-07T03:16:54Z | |
| dc.description | To protect sensitive information in a cross tabulated table, it is a common practice to suppress some of the cells in the table. This paper investigates four levels of data security of a two-dimensional table concerning the effectiveness of this practice. These four levels of data security protect the information contained in, respectively, individual cells, individual rows and columns, several rows or columns as a whole, and a table as a whole. The paper presents efficient algorithms and NP-completeness results for testing and achieving these four levels of data security. All these complexity results are obtained by means of fundamental equivalences between the four levels of data security of a table and four types of connectivity of a graph constructed from that table. | |
| dc.identifier | https://arxiv.org/abs/cs/0101034 | |
| dc.identifier | http://arxiv.org/abs/cs/0101034 | |
| dc.identifier | SIAM Journal on Discrete Mathematics, 9:87--100, 1996 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30529 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Databases | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2; H.2.0; H.2.8 | |
| dc.title | Data Security Equals Graph Connectivity | |
| dc.type | text |