research-article

Privacy-preserving deletion to generalization-based anonymous database

Authors:

Rajesh IngleAuthors Info & Claims

CUBE '12: Proceedings of the CUBE International Information Technology Conference

Pages 459 - 463

https://doi.org/10.1145/2381716.2381803

Published: 03 September 2012 Publication History

Abstract

While creating an anonymous database it is assumed that all data is available at the time of creation. Once record is added to database, it is not deleted or if a user wants to delete person's record from database, it will be removed from it in its next release. Recently there is strong demand for immediate and up-to-date information for anonymous database. Also as anonymous database is derived from original database (nonanonymized), whatever changes made to the original database should be reflected in anonymous database. Bob's tuple should be deleted from Alice's database only if database remains k-anonymous after deletion. Also if tuple deleted from Charles' database it should be removes from Alice database. While performing these operations privacy of data provider (Bob), owner of anonymous database (Alice), and owner of original database (Charles) should be preserved. That is Alice should not know the content of Charles' database and Bob's tuple to be deleted, and Bob and Charles should not have access to Alice database. The existing protocol for updating database does not handle issues of deleting tuple from database. We propose a protocol to address these issues on generalization-based k-anonymous and confidential database by extending the existing protocol for privacy preserving updates to anonymous and confidential database.

References

[1]

A. Trombetta and E. Bertino, "Private Updates to Anonymous Databases," Proc. Int'l Conf. Data Eng. (ICDE), 2006.

Digital Library

[2]

A. Trombetta, W. Jiang, E. Bertino, and L. Bossi, "Privacy-Preserving Updates to Anonymous and Confidential Databases," IEEE Trans. On Dependable and Secure Computing, Vol. 8, No. 4, Jul/Aug 2011.

Digital Library

[3]

B.C.M. Fung, K. Wang, A. W. C. Fu, and J. Pei, "Anonymity for Continuous Data Publishing," Proc. Extending Database Technology Conf. (EDBT), 2008.

Digital Library

[4]

D. Boneh, "The Decision Diffie-Hellman Problem," Proc. Int'l Algorithmic Number Theory Symp., pp. 48--63, 1998.

Digital Library

[5]

D. Boneh, G. di Crescenzo, R. Ostrowsky, and G. Persiano, "Public Key Encryption with Keyword Search," Proc. Eurocrypt Conf., 2004.

[6]

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.

Digital Library

[7]

G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu, "Anonymizing Tables," Proc. Int'l Conf. Database Theory (ICDT), 2005.

Digital Library

[8]

J.W. Byun, T. Li, E. Bertino, N. Li, and Y. Sohn, "Privacy-Preserving Incremental Data Dissemination," J. Computer Security, vol. 17, no. 1, pp. 43--68, 2009.

Digital Library

[9]

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.

Digital Library

[10]

M.J. Freedman, M. Naor, and B. Pinkas, "Efficient Private Matching and Set Intersection," Proc. Eurocrypt Conf., 2004.

[11]

M.K. Reiter and A. Rubin, "Crowds: Anonymity with Web Transactions," ACM Trans. Information and System Security (TISSEC), vol. 1, no. 1, pp. 66--92, 1998.

Digital Library

[12]

M. Reed, P. Syverson, and D. Goldschlag, "Anonymous Connections and Onion Routing," IEEE J. Selected Areas in Comm., vol. 16, no. 4, pp. 482--494, May 1998.

Digital Library

[13]

R. Agrawal, A. Evfimievski, and R. Srikant, "Information Sharing across Private Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2003.

Digital Library

[14]

S. Zhong, Z. Yang, and R. N. Wright, "Privacy-Enhancing k-Anonymization of Customer Data," Proc. ACM Symp. Principles of Database Systems (PODS), 2005.

Digital Library

[15]

U. Maurer, "The Role of Cryptography in Database Security," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2004.

Digital Library

Cited By

Zhu HWang STang P(2015)Verifiably anonymous data collection on webProceedings of the 2015 International Telecommunication Networks and Applications Conference (ITNAC)10.1109/ATNAC.2015.7366786(38-43)Online publication date: 18-Nov-2015
https://dl.acm.org/doi/10.1109/ATNAC.2015.7366786

Index Terms

Privacy-preserving deletion to generalization-based anonymous database

Recommendations

Security and privacy for database systems
ADC '12: Proceedings of the Twenty-Third Australasian Database Conference - Volume 124

Database security is a discipline that seeks methods to protect data stored at DBMSs from intrusions, improper modifications, theft, and unauthorized disclosure of private information. This is realized through a set of security services, which meet the ...
Privacy-Preserving Updates to Anonymous and Confidential Databases

Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also, suppose that access to the database is strictly controlled, because for example data are used for ...
Privacy-preserving data sharing in cloud computing

Storing and sharing databases in the cloud of computers raise serious concern of individual privacy. We consider two kinds of privacy risk: presence leakage, by which the attackers can explicitly identify individuals in (or not in) the database, and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences

CUBE '12: Proceedings of the CUBE International Information Technology Conference

September 2012

879 pages

ISBN:9781450311854

DOI:10.1145/2381716

General Chair:
Vidyasagar Potdar
Curtin University, Australia
,
Program Chair:
Debajyoti Mukhopadhyay
Maharashtra Institute of Technology, India

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

CUOT: Curtin University of Technology

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 September 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CUBE '12

Sponsor:

CUOT

CUBE '12: CUBE International IT Conference & Exhibition

September 3 - 5, 2012

Pune, India

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
107
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhu HWang STang P(2015)Verifiably anonymous data collection on webProceedings of the 2015 International Telecommunication Networks and Applications Conference (ITNAC)10.1109/ATNAC.2015.7366786(38-43)Online publication date: 18-Nov-2015
https://dl.acm.org/doi/10.1109/ATNAC.2015.7366786

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents