A Dynamic Programming Approach Privacy Preserving Collaborative Data Publishing
International Journal of Computer Science (IJCS) Published by SK Research Group of Companies (SKRGC).
Download this PDF format
A user wants to store his files in an encrypted form on a remote file server. Later the user wants to efficiently retrieve some of the encrypted files containing (or indexed by) specific keywords, keeping the keywords themselves secret and not jeopardizing the security of the remotely stored files. In this problem under well-defined security requirements and the global distribution of the attributes for the privacy preserving. Our schemes are efficient in the sense that over all efficient attribute table the sensitive attribute in any equivalence class to be distribution of the attribute in the overall records. They are also incremental, in that can submit new files which are secure against previous queries but still searchable against future queries.
1] M.A.Hall.. “Correlation-Based Feature Selection for Discrete and Numeric class Machine Learning ”, In Proceeding of 17th International Conference on Machine Learning, pp 359- 366,2000.
D.A.Bell and H.Wang ., “ Formalismfor Relevance and its Application in Feature Subset Selection, “Machine Learning,41(2), pp 175-195,2000.
Index Terms—Privacy, security, integrity, and protection, distributed databases.