Total Protection of Analytic Invariant Information in Cross Tabulated Tables
| 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. An analytic invariant is a power series in terms of the suppressed cells that has a unique feasible value and a convergence radius equal to +\infty. Intuitively, the information contained in an invariant is not protected even though the values of the suppressed cells are not disclosed. This paper gives an optimal linear-time algorithm for testing whether there exist nontrivial analytic invariants in terms of the suppressed cells in a given set of suppressed cells. This paper also presents NP-completeness results and an almost linear-time algorithm for the problem of suppressing the minimum number of cells in addition to the sensitive ones so that the resulting table does not leak analytic invariant information about a given set of suppressed cells. | |
| dc.identifier | https://arxiv.org/abs/cs/0101032 | |
| dc.identifier | http://arxiv.org/abs/cs/0101032 | |
| dc.identifier | SIAM Journal on Computing, 26(1):231--242, February 1997 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30527 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2; H.2.8; H.2.0 | |
| dc.title | Total Protection of Analytic Invariant Information in Cross Tabulated Tables | |
| dc.type | text |