Geodesic
Generalized scheme of hidden compact storage of data of various users in a common open database
The Bulletin of Irkutsk State University. Series Mathematics, Tome 40 (2022), pp. 63-77 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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 $K$ 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 $K$ 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.
Keywords: discrete differentiation and integration, cryptography, compact data storage. 
@article{IIGUM_2022_40_a4,
     author = {Vitaly A. Roman'kov},
     title = {Generalized scheme of hidden compact storage of data of various users in a common open database},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {63--77},
     year = {2022},
     volume = {40},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2022_40_a4/}
}
TY  - JOUR
AU  - Vitaly A. Roman'kov
TI  - Generalized scheme of hidden compact storage of data of various users in a common open database
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2022
SP  - 63
EP  - 77
VL  - 40
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2022_40_a4/
LA  - ru
ID  - IIGUM_2022_40_a4
ER  - 
%0 Journal Article
%A Vitaly A. Roman'kov
%T Generalized scheme of hidden compact storage of data of various users in a common open database
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2022
%P 63-77
%V 40
%U http://geodesic.mathdoc.fr/item/IIGUM_2022_40_a4/
%G ru
%F IIGUM_2022_40_a4
Vitaly A. Roman'kov. Generalized scheme of hidden compact storage of data of various users in a common open database. The Bulletin of Irkutsk State University. Series Mathematics, Tome 40 (2022), pp. 63-77. http://geodesic.mathdoc.fr/item/IIGUM_2022_40_a4/

[1] Voloshin S. K., Roman'kov V. A., “Generalized discrete operations of differentiation and integration”, Herald of Omsk University, 26:4 (2021), 4–8 (in Russian) | DOI

[2] Roman'kov V. A., “About the hidden compact way to store data”, Applied discrete mathematics. Applications, 2020, no. 13, 56–59 (in Russian) | DOI

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

[4] C.-T. Huang, L. Huang, Z. Qin, C.-C. J. Kuo, H. Yuan, L. Zhou, V. Varadharadjan, C.-C. J. Kuo, “Survey on securing data storage in the cloud”, APSIPA Transactions on Signal and Information Processing, 3 (2014), 1–17 | DOI

[5] Katz J., Lindell Y., Introduction to Modern Cryptography, CRC Press, Boca Raton–London–New York–Washington D. C., 2007, 498 pp. | MR

[6] Knuth D. E., The Art of Computer Programming, Addison-Wesley Professional, New York, 2011, 912 pp. | MR | Zbl

[7] S. Mazumdar, D. Seybold, K. Kritikos, Y. Verginadis, “A survey on data storage and placement methodologies for Cloud-Big Data ecosystem”, J. Big Data, 6 (2019), 6–37 | DOI

[8] Menezes A. J., Vanstone S. A., Oorschot P. C. van, Handbook of Applied Cryptography, CRC Press, Boca Rapton, 1996, 816 pp. | MR

[9] Neumann P. M., “On the structure of standard wreath products of groups”, Math. Z., 84 (1964), 343–373 | DOI | MR | Zbl

[10] Roman'kov V. A., “Embedding theorems for solvable groups”, Proc. Amer. Math. Soc., 149:10 (2021), 4133–4143 | DOI | MR | Zbl

[11] Smart N., Cryptography: An Introduction, McGraw-Hill College, New York, 2004, 433 pp.

[12] Thammattor A., “Normal Limit of the Binomial via the Discrete Derivative”, The College Mathematics Journal, 49:3 (2018), 216–217 | DOI | MR