sxKV: A Novel Secured and Bidirectional Key-Value Data Structure
Ripon Patgiri · 2020
Key-value data structure is well-known data structure which is used, ranging from the small applications to the extremely large systems. A plenty of key-value data structures are available. Moreover, implementation of bidirectional keyvalues are also available. The key-value data structure is easy to implement. These data structures are one-to-one bidirectional mapping key-value data structure. However, key-value data structure requires one-to-one, one-to-many and many-to-one bidirectional mapping. Also, there are many issues associated with the key-value data structure, namely, the synchronization issue, locking problem, privacy, and security. To address these issues, we propose XOR-ed key-value data structure (xKV) in this paper. xKV is a general purpose data structure which provides one-to-one, one-to-many and many-to-one bidirectional mapping. The asymptotic behavior of our proposed system is nearly constant. We also extend xKV, and propose secured and XOR-ed key-value data structure (sxKV) which provides high security and privacy with the same time complexity as the xKV. sxKV uses computationally inexpensive cryptography. We prove that sxKV can defend many attacks. Moreover, sxKV does not have any synchronization issue. It ensures strict privacy of users.