文章基本信息

标题：Securely Data Sharing with Indeterminate ID Allocation
本地全文：下载
作者：V. Lasya ; M. Prasanthi ; Abdul Vahed 等
期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2014
卷号：18
期号：4
页码：132-136
出版社：Seventh Sense Research Group
摘要：We are introducing a novel algorithm for anonymous data sharing of private data from different persons. By using this mechanism we are assigning nodes ID number from 1 to N. This assignment is anonymous in that the individuality receives the information without knowing identity of this to other member of in the group. Prevent to collision from other members in the theoretic sense whenever they are using private communication channel. This serial numbers assignment allows the user to share most complex data and contains the applications of other problems in the data mining, Remove collision when they are communicating and circulated database access. Here the necessary computation is distributed instead of central authority. The current and new approaches for allocating anonymous IDs are examine with respect to tradeoffs between communication and computational necessity. The new algorithms are design secure mining algorithms using sturm’s and newton’s theory. Markov chain representation is used to statics on number of iterations needs, and the computer algebra gives the complete closed form results on completion rates.
关键词：Anonymous assignment; private communication channel; trade-offs; privacy protection