ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
Optimization for dynamic inverted index maintenance
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Supporting full-text information retrieval with a persistent object store
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Analysis of a very large web search engine query log
ACM SIGIR Forum
Database Systems: The Complete Book
Database Systems: The Complete Book
Strong Security for Network-Attached Storage
FAST '02 Proceedings of the Conference on File and Storage Technologies
Dynamic Data Structures on Optical Disks
Proceedings of the First International Conference on Data Engineering
On B-Tree Indices for Skewed Distributions
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Fast Incremental Indexing for Full-Text Information Retrieval
VLDB '94 Proceedings of the 20th 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 single-pass index construction for text databases
Journal of the American Society for Information Science and Technology
In-place versus re-build versus re-merge: index maintenance strategies for text retrieval systems
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Fossilized index: the linchpin of trustworthy non-alterable electronic records
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
CHRONOS: an authenticated dictionary based on skip lists for timestamping systems
Proceedings of the 2005 workshop on Secure web services
Secure deletion from inverted indexes on compliance storage
Proceedings of the second ACM workshop on Storage security and survivability
Report on the Models of Trust for the Web workshop (MTW'06)
ACM SIGMOD Record
Just in time indexing for up to the second search
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
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
Zerber: r-confidential indexing for distributed documents
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Query-based partitioning of documents and indexes for information lifecycle management
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Zerber+R: top-k retrieval from a confidential index
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Requirements of secure storage systems for healthcare records
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
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
An update-aware storage system for low-locality update-intensive workloads
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Hi-index | 0.00 |
Recent litigation and intense regulatory focus on secure retention of electronic records have spurred a rush to introduce Write-Once-Read-Many (WORM) storage devices for retaining business records such as electronic mail. However, simply storing records in WORM storage is insuffcient to ensure that the records are trustworthy, i.e., able to provide irrefutable proof and accurate details of past events. Specifically, some form of index is needed for timely access to the records, but unless the index is maintained securely, the records can in effect be hidden or altered, even if stored in WORM storage. In this paper, we systematically analyze the requirements for establishing a trustworthy inverted index to enable keyword-based search queries. We propose a novel scheme for effcient creation of such an index and demonstrate, through extensive simulations and experiments with an enterprise keyword search engine, that the scheme can achieve online update speeds while maintaining good query performance. In addition, we present a secure index structure for multi-keyword queries that supports insert, lookup and range queries in time logarithmic in the number of documents.