Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Cryptography and Security

arXiv:cs/0101034 (cs)
[Submitted on 27 Jan 2001]

Title:Data Security Equals Graph Connectivity

Authors:Ming-Yang Kao
View PDF
Abstract: 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.
Subjects: Cryptography and Security (cs.CR); Databases (cs.DB); Data Structures and Algorithms (cs.DS)
ACM classes: F.2.2; H.2.0; H.2.8
Cite as: arXiv:cs/0101034 [cs.CR]
  (or arXiv:cs/0101034v1 [cs.CR] for this version)
  https://doi.org/10.48550/arXiv.cs/0101034
Journal reference: SIAM Journal on Discrete Mathematics, 9:87--100, 1996

Submission history

From: Ming-Yang Kao [view email]
[v1] Sat, 27 Jan 2001 02:22:54 UTC (15 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.CR
< prev   |   next >
new | recent | 2001-01

References & Citations

DBLP - CS Bibliography

listing | bibtex
Ming-Yang Kao
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)