In contemporary world web has created a leeway into daily lives with all information being hold on during a server of some type so spread or employed in the style required. this can be confined to multiple applications like patient medical records, balloting details, banking, social networking, email, analysis etc. however the identity has to be preserved for each the information and therefore the owner because the case is also that is more and {more} turning into a drag with additional and more identities allotted to the information particularly just in case of distributed server sharing. Existing solutions target the central server model that is computationally costly, includes a immense information measure exchange, information security is compromised and therefore not fitted to the distributed model hip currently. The proposed work focuses on the distributed side of computing wherever the IDs are anonymous employing a distributed computation with no central authority and such IDs will be used as a part of schemes for sharing or dividing communications information measure, information storage, and alternative resources anonymously and while not convict. it's doable to use secure add to permit one to opt-out of a computation beforehand on the premise of sure rules in applied mathematics revealing limitation. These model suites for the distributed computing model with Anonymous ID assignment wherever procedure overhead is low, information measure consumption is additionally less. The AIDA algorithm is applied serially and therefore is secure, however chiefly the distributed nature of the information sharing system is sustained. The protocol for privacy conserving mistreatment anonymous id assignment is no-hit.

Allam.Jyothi,A.Kusuma,Dr.S.Prem Kumar."Privacy Preserving Data Sharing With Anonymous ID Assignment Using AIDA Algorithm". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.23-29, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P4.pdf,

[1] Sarbanes–Oxley Act of 2002, Title 29, Code of Federal Regulations, Part 1980, 2003.
[2] White Paper—The Essential Guide to Web Analytics Vendor 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,‖ inProc. 19th Ann. ACM Conf.
Theory of Computing, Jan. 1987, pp. 218–229, ACM Press
[9] A. Yao, ―Protocols for secure computations,‖ in Proc. 23rd Ann. IEEE Symp. Foundations of Computer Science,
1982, pp.160–164, IEEE Computer Society.
[10] C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Y. Zhu, ―Tools for privacy preserving distributed data
mining,‖ ACM SIGKDD Expl