Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller

DOI10.1016/j.jda.2018.11.008zbMath1410.68110OpenAlexW2939458581WikidataQ115041710 ScholiaQ115041710MaRDI QIDQ1711665

Xun Yi, Leanne J. Rylands, Andrei V. Kelarev, Joseph F. Ryan, Jennifer Seberry Wallis

Publication date: 18 January 2019

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2018.11.008

zbMATH Keywords

NP-completenessprivacydata miningtime complexitycombinatorial algorithmsdatabase securitysharp upper bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Deletion correcting codes meet the Littlewood-Offord problem

Cites Work

• Security, privacy and trust in modern data management.
• A combinatorial problem in database security
• Private Information Retrieval
• Triangle randomization for social network data anonymization
• Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
• On Security of Statistical Databases
• The eigenspace of the eigenvalue -2 in generalized line graphs and a problem in security of statistical databases
• Auditing and Inference Control in Statistical Databases
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• An Optimization Problem in Statistical Databases
• Public Key Cryptography
• On Range Query Usability Of Statistical Databases
• Homomorphic Encryption and Applications
• Foundations of Information and Knowledge Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item