Securely Data Sharing with Indeterminate ID Allocation
 |
International Journal of Computer Trends and Technology (IJCTT) |  |
| © 2014 by IJCTT Journal | ||
| Volume-18 Number-4 |
||
| Year of Publication : 2014 | ||
| Authors : V. Lasya , M. Prasanthi , Abdul Vahed |
V. Lasya , M. Prasanthi , Abdul Vahed "Securely Data Sharing with Indeterminate ID Allocation". International Journal of Computer Trends and Technology (IJCTT) V18(4):132-136, Dec 2014. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract -
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 trade-offs 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.
References
[1] Sarbanes–Oxley Act of 2002, Title 29, Code of Federal Regulations, Part 1980, 2003.
[2] White Paper—The EssentialGuide toWeb AnalyticsVendor Selection, IBM [Online]. Available: http://measure.coremetrics.com/corem/getform/ reg/wp-evaluation-guide
[3] A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp. 612–613, 1979.
[4] A. Friedman, R. Wolff, and A. Schuster, “Providing k-anonymity in data mining,” VLDB Journal, vol. 17, no. 4, pp. 789–804, Jul. 2008.
[5] F. Baiardi, A. Falleni, R. Granchi, F. Martinelli, M. Petrocchi, and A. Vaccarelli, “Seas, a secure e-voting protocol: Design and implementation,” Comput. Security, vol. 24, no. 8, pp. 642–652, Nov. 2005.
[6] D. Chaum, “Untraceable electronic mail, return address and digital pseudonyms,” Commun. ACM, vol. 24, no. 2, pp. 84–88, Feb. 1981.
[7] Q. Xie and U. Hengartner, “Privacy-preserving matchmaking for mobile social networking secure against malicious users,” in Proc. 9th Ann. IEEE Conf. Privacy, Security and Trust, Jul. 2011, pp. 252–259.
[8] O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” in Proc. 19th Ann. ACM Conf. Theory of Computing, Jan. 1987, pp. 218–229, ACM Press.
Keywords
Anonymous assignment, private communication channel, trade-offs, privacy protection