Security deciding in publishing views based on entropy

Authors:
Zhang Kun;Pan De-fen
Affiliations:
Hebei University of Science and Technology, Shijiazhuang, Hebei, China;Hebei University of Science and Technology, Shijiazhuang, Hebei, China
Venue:
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Year:
2008

Citing 5
Cited 0

Security-control methods for statistical databases: a comparative study

ACM Computing Surveys (CSUR)
k-anonymity: a model for protecting privacy

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Watermarking relational data: framework, algorithms and analysis

The VLDB Journal — The International Journal on Very Large Data Bases
Fingerprinting Relational Databases: Schemes and Specialties

IEEE Transactions on Dependable and Secure Computing
Auditing disclosure by relevance ranking

Proceedings of the 2007 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Publishing views have been a convenient tool for data exchange. But as the increasing of data exchange technology, the security in publishing views has been paid more attention to. Inspired by the knowledge of probabilistic database, this paper erects a probability model of security deciding in publishing views, and it gives the formularized definition of publishing views, private information, prior knowledge and so on. Then a new deciding theorem based on entropy is provided, and introduce techniques for measuring the magnitude of information disclosures in publishing view. At last it is proved by the experiment.