ISSN 1997-7670 (Print)
ISSN 2541-8785 (Online)

List of issues > Series «Mathematics». 2022. Vol 40

Generalized Scheme of Hidden Compact Storage of Data of Various Users in a Common Open Database

Vitaly A. Roman’kov1

1Dostoevsky Omsk State University, Omsk, Russian Federation


A database is an organized collection of structured information, typically stored electronically in a computer system and usually controlled by a database management system (DBMS). Confidentiality, integrity and availability are the main requirements for database security. Data within the most common types of modern databases in operation is typically stored in rows and columns in a series of tables, but other configurations are also used. The use of public networks and the development of information technologies (including cloud ones) impose new increased requirements on the formation of databases. The paramount requirement is the security of databases from unauthorized actions of both the users themselves and third-party observers (potential violators). Cryptographic security tools are becoming an important tool to meet this requirement.

In this paper, based on new (introduced by the author in a recent publication) concepts of generalized discrete differentiation and integration, a fundamentally new scheme for hidden compact storage of user group data in a common open database is proposed. The components of the table are elements of the ring 𝐾 that encode the data. The paper proposes to use residue rings. The database does not have subsections related to the data of individual users. The corresponding table is a component-by-component sum of individual tables built by a certain algorithm according to the data of each user. Any user can retrieve his data from the database using his own individual key. The construction of the table and the algorithms for extracting individual user data from it are carried out efficiently. A user gets the key at the time of his registration in the system, when his table (obtained on the basis of his data) is created and added to the database. The key has the form of two polynomials with coefficients from 𝐾 with invertible leading coefficients. At the same time, a particular user does not have the opportunity to obtain the data of other users. An outside observer (potential intruder) cannot obtain any data. The scheme allows changing and deleting data without replacing keys. Free access to the database and reuse of keys are the main advantages of the scheme.

About the Authors
Vitaly Roman’kov, Dr. Sci. (Phys.–Math.), Prof., Dostoevsky Omsk State University, Omsk, 644077, Russian Federation, romankov48@mail.ru
For citation
Roman’kov V.A. Generalized Scheme of Hidden Compact Storage of Data of Various Users in a Common Open Database. The Bulletin of Irkutsk State University. Series Mathematics, 2022, vol. 40, pp. 63–77. (in Russian) https://doi.org/10.26516/1997-7670.2022.40.63
discrete differentiation and integration, cryptography, compact data storage

1. Voloshin S.K., Roman’kov V.A. Obobshenniye discretniye operacii differencirovaniya i integrirovaniya [Generalized discrete operations of differentiation and integration]. Herald of Omsk University, 2021, vol. 26, no. 4, pp. 4–8. https://doi.org/10.24147/1812-3996.2021.26(4).4–8 (in Russian)

2. Roman’kov V.A. O skrytom kompactnom sposobe khraneniya dannih [About the hidden compact way to store data]. Applied discrete mathematics. Applications, 2020, no. 13, pp. 56–59. https://doi.org/10.17223/2226308X/13/17 (in Russian)

3. Desmedt Y. Society and group oriented cryptography: A new concept. Conference on the Theory and Application of Cryptographic Techniques. Berlin, Heidelberg, Springer, 1987, pp. 120–127.

4. Huang C.-T., Huang L., Qin Z., Kuo C.-C.J., Yuan H., Zhou L., Varadharadjan V., and Kuo C.-C.J. Survey on securing data storage in the cloud. APSIPA Transactions on Signal and Information Processing, 2014, vol. 3, pp. 1–17. https://doi.org/10.1017/ATSIP.2014.6

5. Katz J., Lindell Y. Introduction to Modern Cryptography. Boca Raton, London, New York, Washington D.C., CRC Press, 2007, 498 p.

6. Knuth D.E. The Art of Computer Programming. New York, Addison-Wesley Professional Publ., 2011, 912 p.

7. Mazumdar S., Seybold D., Kritikos K., and Verginadis Y. A survey on data storage and placement methodologies for Cloud-Big Data ecosystem. J Big Data, 2019, vol. 6, pp. 6–37. https://doi.org/10.1186/s40537-019-0178-3

8. Menezes A.J., Vanstone S.A., and Oorschot P.C. van. Handbook of Applied Cryptography. Boca Raton, CRC Press, 1996, 816 p.

9. Neumann P.M. On the structure of standard wreath products of groups. Math. Z., 1964, vol. 84, pp. 343–373.https:/doi.org/10.1007/BF01109904

10. Roman’kov V.A. Embedding theorems for solvable groups. Proc. Amer. Math. Soc., 2021, vol. 149, no. 10, pp. 4133–4143. https://doi.org/10.1090/proc/15562.

11. Smart N. Cryptography: An Introduction. New York, McGraw-Hill College Publ., 2004, 433 p.

12. Thammattor A. Normal Limit of the Binomial via the Discrete Derivative. The College Mathematics Journal, 2018, vol. 49, no. 3, pp. 216–217. https://doi.org./10.1080/07468342.2018.1440872

Full text (russian)