Planar point location using persistent search trees
Communications of the ACM
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compression of inverted indexes For fast query evaluation
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Dynamic Data Structures on Optical Disks
Proceedings of the First International Conference on Data Engineering
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient applicative data types
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Secure deletion of data from magnetic and solid-state memory
SSYM'96 Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6
Forensic analysis of database tampering
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Trustworthy keyword search for regulatory-compliant records retention
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Secure deletion myths, issues, and solutions
Proceedings of the second ACM workshop on Storage security and survivability
Secure deletion from inverted indexes on compliance storage
Proceedings of the second ACM workshop on Storage security and survivability
Technical forum: worm storage is not enough
IBM Systems Journal
Deleting index entries from compliance storage
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Towards tamper-evident storage on patterned media
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Forensic analysis of database tampering
ACM Transactions on Database Systems (TODS)
Restricted queries over an encrypted index with applications to regulatory compliance
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Efficient data structures for tamper-evident logging
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
Protecting the WSN zones of a critical infrastructure via enhanced SIEM technology
SAFECOMP'12 Proceedings of the 2012 international conference on Computer Safety, Reliability, and Security
Hi-index | 0.00 |
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly managed to preserve their trustworthiness, i.e., their ability to provide irrefutable proof and accurate details of events that have occurred. The need for proper record keeping is further underscored by the recent corporate misconduct and ensuing attempts to destroy incriminating records. Currently, the industry practice and regulatory requirements (e.g., SEC Rule 17a-4) rely on storing records in WORM storage to immutably preserve the records. In this paper, we contend that simply storing records in WORM storage is increasingly inadequate to ensure that they are trustworthy. Specifically, with the large volume of records that are typical today, meeting the ever more stringent query response time requires the use of direct access mechanisms such as indexes. Relying on indexes for accessing records could, however, provide a means for effectively altering or deleting records, even those stored in WORM storage.In this paper, we establish the key requirements for a fossilized index that protects the records from such logical modification. We also analyze current indexing methods to determine how they fall short of these requirements. Based on our insights, we propose the Generalized Hash Tree (GHT). Using both theoretical analysis and simulations with real system data, we demonstrate that the GHT can satisfy the requirements of a fossilized index with performance and cost that are comparable to regular indexing techniques such as the B-tree. We further note that as records are indexed on multiple fields to facilitate search and retrieval, the records can be reconstructed from the corresponding index entries even after the records expire and are disposed of, Therefore, we also present a novel method to eliminate this disclosure risk by allowing an index entry to be effectively disposed of when its record expires.