Diophantine Inference on a Statistical Database
Loading...
Authors
Rowe, Neil C.
Subjects
Advisors
Date of Issue
2008
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
Abstract
A statistical database is said to be compromisable if individual data items can be inferred from queryable values of statistical aggregates (mean, maximum, count, etc.)
((Denning82), ch. 6). We discuss here some methods, which while only leading to compromise of individual records on occasion, do lead to powerful inferences of other
statistical characteristics of a database which may also be sensitive information. These methods use a new technique that has not apparently heretofore been explored, solution
of simultaneous Diophantine (integer-solution) equations.
Type
Conference Paper
Description
This paper appeared in Information Processing Letters, 18 (1984), 25-31. The equations were redrawn in 2008 and some corrections made.
Series/Report No
Department
Computer Science (CS)
Organization
Identifiers
NPS Report Number
Sponsors
This work is part of the Knowledge Base Management Systems Project at Stanford University, under contract #N00039-82-G-0250 from the Defense Advanced Research Projects Agency of the United States Department of Defense
Funder
Format
Citation
Information Processing Letters, 18 (1984), 25-31.
Distribution Statement
Approved for public release; distribution is unlimited.