On the Deductive Security of Queries to Databases with Multi-Bit Records
- Authors: Abbas M.M.1, Varnovskiy N.P.2, Zakharov V.A.1, Shokurov A.V.3
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Institute for Information Security Issues
- Ivannikov Institute for System Programming
- Issue: Vol 42, No 1 (2018)
- Pages: 39-43
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176219
- DOI: https://doi.org/10.3103/S0278641918010028
- ID: 176219
Cite item
Abstract
One of the priority problems in the development and use of databases is that of information security. It becomes substantially more complicated when databases are implemented in cloud computing systems. In our previous paper we studied this problem for the simple case of databases with one-bit records; we offered a criterion of deductive security for queries to such databases, proved the hardness of its checking, and showed that for some classes of queries deductive security can be verified relatively easy. In this paper these results are generalized for the case of more complex databases with multi-bit records.
About the authors
M. M. Abbas
Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: unlock96@gmail.com
Russian Federation, Moscow
N. P. Varnovskiy
Institute for Information Security Issues
Email: unlock96@gmail.com
Russian Federation, Moscow
V. A. Zakharov
Faculty of Computational Mathematics and Cybernetics
Email: unlock96@gmail.com
Russian Federation, Moscow
A. V. Shokurov
Ivannikov Institute for System Programming
Email: unlock96@gmail.com
Russian Federation, Moscow
Supplementary files
