ACM Home Page
Please provide us with feedback. Feedback
Deleting index entries from compliance storage
Full text PdfPdf (389 KB)
Source ACM International Conference Proceeding Series; Vol. 261 archive
Proceedings of the 11th international conference on Extending database technology: Advances in database technology table of contents
Nantes, France
SESSION: Research sessions: Consistency table of contents
Pages 109-120  
Year of Publication: 2008
ISBN:978-1-59593-926-5
Authors
Soumyadeb Mitra  University of Illinois at Urbana-Champaign
Marianne Winslett  University of Illinois at Urbana-Champaign
Nikita Borisov  University of Illinois at Urbana-Champaign
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 46,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1353343.1353361
What is a DOI?

ABSTRACT

In response to regulatory focus on secure retention of electronic records, businesses are using magnetic disks configured as write-once read-many (WORM) compliance storage devices to store business documents such as electronic mail for their mandated retention periods. A document committed to a compliance storage device cannot be altered or deleted even by a superuser until its retention period is over, and hence is secure from attacks originating from company insiders. Secure retention, however, is only a part of a document's lifecycle: it is often crucial to properly delete documents once their retention period ends. It is relatively simple to delete a document, but much harder to remove its index entries from WORM. Yet if these entries are not obliterated, the contents of the deleted document can often be reconstructed.

In this paper, we formally define secure deletion of document entries from an inverted index on compliance storage. We show that previously proposed deletion schemes for compliance storage index entries do not meet the objectives of secure deletion. On the other hand, the naive approach to secure deletion results in very poor query performance. To provide secure deletion of index entries without compromising lookup efficiency, we propose a novel indexing technique that employs noise terms, merged posting lists, and deletion epochs. Experiments with real-life data show that lookups in our scheme are 5 times faster than the naive approach.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Congress of the United States of America. Sarbanes-Oxley Act, 2002. Available at http://thomas.loc.gov.
 
2
EMC Corp. EMC Centera Content Addressed Storage System, 2003. Available at http://www.emc.com/products/systems/centera.ce.jsp.
 
3
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270--299, 1984.
 
4
IBM Corp. IBM TotalStorage DR550, 2006. http://www-03.ibm.com/systems/storage/index.html.
 
5
6
 
7
Network Appliance, Inc. SnapLock#8482; Compliance and SnapLock Enterprise Software, 2003. Available at http://www.netapp.com/products/filer/snaplock.html.
 
8
Securities and Exchange Commission. Guidance to Broker-Dealers on the Use of Electronic Storage Media under the National Commerce Act of 2000 with Respect to Rule 17a-4(f), 2001. Available at http://www.sec.gov/rules/interp/34-44238.htm.
 
9
The Enterprise Storage Group, Inc. Compliance: The effect on information management and the storage industry, May 2003. Available at www.enterprisestoragegroup.com.
 
10
11

Collaborative Colleagues:
Soumyadeb Mitra: colleagues
Marianne Winslett: colleagues
Nikita Borisov: colleagues