International Journal of Innovative Research in Computer Science and Technology
Year: 2014, Volume: 2, Issue: 1
First page : ( 54) Last page : ( 57)
Online ISSN : 2350-0557.
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Pallavi S.Patil , Prof.K.B.Manwade, Prof.G.A.Patil
Today’s databases speak to a critical stake for numerous requisitions. There is an expanded concern for security. The accessibility of tremendous amounts of databases recording an extensive assortment of data about people makes it conceivable by essentially corresponding all the accessible databases. Likewise, delicate data about the gathering embeddings the information may be spilled from the right to gain entrance control approaches received by the anonymous database framework. A methodology could be utilized is dependent upon methods for client anonymous authentication and qualification check. So the issue of anonymous updates to confidential databases is unpredictable and requires the combo of some systems. Some protocol and systems have been proposed in the literature, which manage the anonymity, confidentiality and privacy. Still a few issues are unaddressed like n-anonymity, malicious third party and efficiency improvement of protocol. In this, three protocols that is Formation 1 protocol, Formation 2 protocol and third party protocol are proposed to deal with above issues.
1. E. Bertino and R. Sandhu, “Database Security—Concepts, Approaches and Challenges,” IEEE Trans. Dependable and Secure Computing, vol. 2, no. 1, pp. 2-19, Jan.-Mar. 2005.
2. D. Bonch The decision Diffic-Hellman problem in Proc. Of Int Algorithmic Number theory Symposium.
3. Privacy-Preserving Updates to Anonymous and Confidential Databases, Alberto Trombetta, Wei Jiang, Elisa Bertino and Lorenzo Bossi, Department of Computer Science and Communication, University of Insubria, Italy.
4. A. Trombetta and E. Bertino, “Private Updates to Anonymous Databases,” Proc. Int’l Conf. Data Eng. (ICDE), 2006.
5. N.R. Adam and J.C. Wortmann, “Security-Control Methods for Statistical Databases: A Comparative Study,” ACM Computing Surveys, vol. 21, no. 4, pp. 515-556, 1989. .
6. L. Sweeney, “k-Anonymity: A Model for Protecting Privacy,” Int’l J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.
7. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee, “Towards Privacy in Public Databases,” Proc. Theory of Cryptography Conf. (TCC), 2005.
8. U. Feige, J. Kilian, and M. Naor, “A Minimal Model for Secure Computation,” Proc. ACM Symp. Theory of Computing (STOC), 1994.
9. C. D. Pham RESAM, UniversitC Lyon 1, Claude Bernard B2t ISTIL“Comparison of Message Aggregation Strategies for Parallel Simulations on a High Performance Cluster”
Computer Department, JSPM, NTC ,Narhe, Pune, India, (e-mail: pal.patil21@gamil.com).
No. of Downloads: 9 | No. of Views: 2136
Manali Shukla, Ishika Goyal, Bhavya Gupta, Jhanvi Sharma.
July 2024 - Vol 12, Issue 4
Dipti Prajapati, Samishtarani Sabat, Sanika Bhilare, Rashmi Vishe, Prof. Suman Bhujbal.
March 2024 - Vol 12, Issue 2
Anu Sharma, Vivek Kumar.
May 2023 - Vol 11, Issue 3
