On the Deductive Security of Queries to Databases with Multi-Bit Records


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Allerton Press, Inc.