The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Communications of the ACM
Execution time requirements for encipherment programs
Communications of the ACM
Time Sharing Computer Systems
An experimental application of cryptography to a remotely accessed data system
ACM '72 Proceedings of the ACM annual conference - Volume 1
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Search Key Substitution in the Encipherment of B-Trees
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Privacy and security of data communications and data bases
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Design and analysis of querying encrypted data in relational databases
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Designing secure indexes for encrypted databases
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
| Hi-index | 0.00 |
The securing of information in indexed, random access files by means of privacy transformations must be considered as a problem distinct from that for sequential files. Not only must processing overhead due to encrypting be considered, but also threats to encipherment arising from updating and the file structure itself must be countered. A general encipherment scheme is proposed for files maintained in a paged structure in secondary storage. This is applied to the encipherment of indexes organized as B-trees; a B-tree is a particular type of multiway search tree. Threats to the encipherment of B-trees, especially relating to updating, are examined, and countermeasures are proposed for each. In addition, the effect of encipherment on file access and update, on paging mechanisms, and on files related to the enciphered index are discussed. Many of the concepts presented may be readily transferred to other forms of multiway index trees and to binary search trees.