Data Security Equals Graph Connectivity

Details Data Security Equals Graph Connectivity Data Security Equals Graph Connectivity

2001-01-27

arxiv.org/abs/cs/0101034v1

SIAM Journal on Discrete Mathematics, 9:87--100, 1996

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Data Security Equals Graph Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Data Security Equals Graph Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data Security Equals Graph Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278196