##plugins.themes.academic_pro.article.main##

Abstract

Increasingly, managerial data is being used for statistical purposes, for example registry based census
charming. In follow, this generally wants connecting split files containing information on the same unit,
without revealing the uniqueness of the part. If the connection has to be complete without a unique
identification number, it is necessary to compare keys which are derived from unit identifiers and which are
assumed to be similar. When dealing with large files like census data or population registries, comparing
each possible pair of keys of two files is impossible. Therefore, special algorithms (jamming methods) have to
be utilized to reduce the number of comparisons needed. If the identifiers have to be encrypted due to
confidentiality concerns, the amount of available algorithms for blocking is very limited. This proj

##plugins.themes.academic_pro.article.details##

How to Cite
S. Sridevi, P. Maylvahanan. (2016). Privacy-Preserving Proof Association and Jamming For Huge Records with Cryptographic Keys Utilizing Multibit Trees. International Journal of Emerging Trends in Science and Technology, 3(04), 3813-3817|. Retrieved from http://igmpublication.org/ijetst.in/index.php/ijetst/article/view/1055