International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 121 | Views: 276

Research Paper | Computer Science & Engineering | India | Volume 3 Issue 9, September 2014 | Popularity: 6.4 / 10


     

Efficient and Secure Data Sharing By Applying AES Algorithm with Anonymous Id Assignment

Barla Rakesh, Veladanda RamaKrishna


Abstract: Security is a basic requirement of an organization in the world to keep their information secure from their competitors. Various techniques and algorithms were developed by research in order to achieve secure data sharing. We propose a technique for anonymous sharing of private data between N parties is developed. This technique is used to allocate these node ID numbers ranging from 1 to N and also apply encryption on private data. These assignments are anonymous in that the identities received are unknown to the other members of the group. Animosity between other members is verified in an information theoretic sense when private communication channels are used. This type of serial numbers assignment allows more complex data to be shared and has applications to other problems in privacy preserving data mining, animosity avoidance in communications and distributed database access. The prescribed computations are distributed without using a trusted third party central authority. Existing and new techniques for assigning anonymous IDs are examined with respect to trade-offs between communication and computational requirements. The proposed technique also finds distributed environment with minimal communication among parties and ensures higher degree of privacy with Advanced Encryption Standard (AES). It generates more secured item sets among multiple parties without affecting mining performance and optimal communication among parties with high privacy and zero percentage of data leakage. The new techniques are built on top of a secure sum data mining operation using Newtons identities and Sturms theorem.


Keywords: Anonymization and deanonymization, multiparty computation, privacy preserving data mining, secure sum algorithm, Advanced Encryption Standard AES


Edition: Volume 3 Issue 9, September 2014


Pages: 445 - 450



Make Sure to Disable the Pop-Up Blocker of Web Browser




Text copied to Clipboard!
Barla Rakesh, Veladanda RamaKrishna, "Efficient and Secure Data Sharing By Applying AES Algorithm with Anonymous Id Assignment", International Journal of Science and Research (IJSR), Volume 3 Issue 9, September 2014, pp. 445-450, https://www.ijsr.net/getabstract.php?paperid=SEP14195, DOI: https://www.doi.org/10.21275/SEP14195



Similar Articles

Downloads: 106

Survey Paper, Computer Science & Engineering, India, Volume 3 Issue 11, November 2014

Pages: 651 - 653

Watermark Detection for Security of Multimedia Data through MPC Privacy of Multimedia Data on the Cloud

Ujwala Pawar, Dhara Kurian

Share this Article

Downloads: 119

Research Paper, Computer Science & Engineering, India, Volume 4 Issue 7, July 2015

Pages: 1608 - 1611

Secure Mining of Association Rules from Homogeneous Database

Mahale Mohini V., Shaikh I.R.

Share this Article

Downloads: 121

Review Papers, Computer Science & Engineering, India, Volume 4 Issue 1, January 2015

Pages: 735 - 739

Comparative Analysis of Privacy Preserving Techniques in Distributed Database

Sapana Anant Patil, Dr. Abhijit Banubakode

Share this Article
Top