<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Information security of printing organizations </article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dmytro Kucherov</string-name>
          <email>d_kucherov@ukr.net</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andriy Fesenko</string-name>
          <email>aafesenko88@gmail.com</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Igor V. Ogirko</string-name>
          <email>ogirko@gmail.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olha I. Ogirkо</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrei Berezkin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>G.E. Pukhov Institute for Modelling in Energy Engineering</institution>
          ,
          <addr-line>15, General Naumov Str., Kyiv, 03164</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Lviv State University of Internal Affairs</institution>
          ,
          <addr-line>26 Horodotska str., Lviv, 79007</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Ukrainian Academy of Printing</institution>
          ,
          <addr-line>19, str. Pidgolosko, Lviv, 79020</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>112</fpage>
      <lpage>122</lpage>
      <abstract>
        <p>   The paper discusses the main options for technical protection at the stages of pre-printing and post-printing preparation of products by a printing company using modern cloud technologies. In the study course, insufficient security of the SSL / TLS protocol for transferring data between websites was established, which is confirmed by numerous reports in the press about the theft of personal data and the constant improvement of this protocol. Additionally, it has been established that data security has a dependency on the user's responsibility for personal information protection. In essence, options for protecting documents of a printing company can be supplemented by the introduction of digital signatures or passwords. Based on the theory of planning and processing the results of experiments, the whole factor experiment was prepared and carried out to analyze the password "strength" based on two signs of password strength: length and different types of categories of characters used in passwords. An experiment execution plan has been built based on an orthogonal matrix. According to the matrix plan, the unknown coefficients of the response function were determined; and we determined their significance as well; we have also confirmed the adequacy of the obtained equation. In the paper, we also present a model experiment is, confirming the validity of the hypothesis of the relativity of the importance of the message length concerning the types of categories of symbols used.</p>
      </abstract>
      <kwd-group>
        <kwd>1  password complexity</kwd>
        <kwd>experiment planning</kwd>
        <kwd>processing of experiment results</kwd>
        <kwd>experiment model</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction </title>
      <p>The main goal of this paper is to show additional possibilities for the protection of printed products
based on the differentiation of access rights to information and the value of protecting information by
passwords.</p>
      <p>The rest of the paper is organized as follows: the next Section is devoted to a review of the relevant
literature and the main achievements taking place in the chosen field; in Section 3, the research problem
is formulated; in section 4, the approach for solving it is presented, based on the methods of the theory
of planning and processing data from the results of experiments; Section 5 discusses the main results
and draws conclusions based on them.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work </title>
      <p>
        Recently, there has been a sharp leap in the development of the printing industry due to the
widespread introduction of digital content publications into the practice of publishing organizations,
based on the consistent distribution of computer technology in the 90s of the last century [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        The advance of computer publishing systems made it possible to transfer an electronic layout of a
publication directly from a computer or to a photographic form, or a photographic plate, and later
directly to a digital printing machine, which determined the prospect of obtaining a personalized
publication of any required circulation. Digital processes (prepress, print, and post-press) at all
manufacturing stages of printed products have created the basis for the transition to full automation of
production of a printing company based on online solutions [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Innovations in computer technology
offer to abandon traditional servers and switch to Cloud Computing technologies. The problems of
automating the task of accounting for the budgetary process to discharge are presented in the works
[618].
      </p>
      <p>
        The paper [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] explores the security technology of transpromo printing based on the corresponding
Internet protocol.
      </p>
      <p>
        To evaluate the security of printing depending on its cost, the authors of [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] proposed a method,
based on linear programming.
      </p>
      <p>The emergence of cloud solutions along with several advantages, namely: an unlimited amount of
data storage, independence from the operating system when working with documents, the possibility of
constant and shared access to this one, the rational use of resources, reduction in software costs, the
ability to regularly update it; there was a strict need to protect deleted data.</p>
      <p>So, it is possible to intercept confidential and private data when one's working with the "cloud"; and
the internet provider can view the client's data if they are not protected by a password; this data can also
become the property of hackers who have managed to break into the provider's security systems.</p>
      <p>The reliability, timeliness, and availability of data in the "cloud" strongly depend on the intermediate
parameters, which include data transmission channels on the way from the client to the "cloud"; the
reliability of the last mile, the quality of the client's Internet provider, the availability of the "cloud"
itself in the given moment. When the online storage company is liquidated, a computer customer can
lose all their papers.</p>
      <p>
        Some papers [
        <xref ref-type="bibr" rid="ref21 ref22 ref23">21-27</xref>
        ] presented at recent conferences are dedicated to password strength studies.
Thus, the authors of the article [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] studied the methods used to assess the strength of passwords, which
made it possible to establish the advantage of neural networks over traditional methods.
      </p>
      <p>
        The paper [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] studied password strength and the dependence on the sensitivity of users'
information. The study established the function of assessing the confidentiality of personal data and
proposed an assessment method for password strength based on sensitive personal information.
      </p>
      <p>
        The authors of the paper [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] establish the need to improve the methods for assessing the strength
of passwords based on measuring the strength of passwords.
      </p>
      <p>The paper [24] proposes group methods for estimating password strength using the attention
mechanism (AM) in a neural network model. The long-short-term memory model (LSTM) is used for
password processing, and a more accurate estimate of password strength is obtained.</p>
      <p>The authors [25] propose a password-generation algorithm. It is based on information provided by
users. The authors tested the reliability of the generated passwords when exposed to the dictionary and
brute force password cracking attacks.</p>
      <p>Based on prototyping methods, the architecture and main functions of the user interface [26] are
proposed for developing a strong password.</p>
      <p>Authors [27] propose protection against targeted attacks using personalized password strength
meters.</p>
      <p>The purpose of this study is to establish an effective system for protecting printed products at all
stages of their preparation.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Problem statement </title>
      <p>The preparation process of a digital layout of products by some printing companies using some
publishing system is considered. A feature of the preparation process is its multistage nature (character),
the essential component of which is prepress preparation. An electronic version of the final document
is prepared in the prepress process. The electronic layout development of a printed document involves
participation in the cloud storage of various staff members that provides collective access.
3.1.</p>
    </sec>
    <sec id="sec-4">
      <title>A problem in cloud storing </title>
      <p>As you know, the problem of storing data in the "cloud" is the data protection in the case of
interception during transmission over a communication channel; there is also a problem associated with
devices of the "last mile"; in addition, there is a problem with data integrity during remote storage.</p>
      <p>The most common technical solutions for data protection are data encryption, closing documents
with a password, and using a digital signature.</p>
      <p>Usually, data transmission performs by the SSL/TLS protocol. It is worth noting that despite the
similarities between SSL and TLS, a series of technical documents (for example, RFC 8446) have
recently been promoting TLS 1.3 for browser use. Google, Facebook, and Cloudflare have provided the
TLS 1.3 protocol support for the web space since July 2019, in addition, to the main branches of the
Chrome and Firefox browsers. The protocol supports three services: authentication, encryption, and
message integrity checking. The safety experts consider the suggested protective measures sufficient.
Nevertheless, the message interception problem is relevant, as evidenced by the numerous
confirmations of theft of personal data. Thus, the user himself should be primarily concerned about his
data protection.</p>
      <p>From the point of view of protecting printed information, one of the most effective measures is to
set a password for a printed document. The problem here is the establishment of obvious passwords,
which may be available to an attacker, or the creator of the documents does not consider it necessary to
use a password here. To secure your information and not use external audit services, it is recommended
that you independently acquire a strong password.
3.2.</p>
    </sec>
    <sec id="sec-5">
      <title>Several requirements for passwords </title>
      <p>
        We must abide by some rules to avoid the negative consequences of data theft due to the introduction
of "weak" passwords. To create a strong password, [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] is recommended:
 avoid primitive passwords (repetitive words, English terminology, widespread digital
combinations, etc.);
 avoid the same passwords for all services and resources;
 store the password in an open, visible place (on a table, on a monitor, in a browser, etc.);
 change the discredited password;
 do not use short passwords;
 a complex password must have a uniform distribution of alphanumeric and other symbols.
      </p>
      <p>Presently (and, likely, in the near future), the user's password looks like a simple and accessible
remedy for user authentication. Therefore, attempts to organize strong authentication based on a
password are continuous nowadays. The application of special software and equipment for password
generation leads to the creation of hard-to-guess passwords that cannot be remembered by users.
Therefore, passwords are stored in a convenient place for the user that is inconsistent with the notion
of protecting the integrity of information.</p>
      <p>
        A possible way out in these circumstances is the use of password strength meters, which allow you
to assess the degree of password trust to the user. Users accept or complicate used passwords in a user
feedback system. Building systems for evaluating password strength is currently a hot topic, as
evidenced by recent publications [
        <xref ref-type="bibr" rid="ref21 ref22 ref23">21-28</xref>
        ] on this topic.
3.3.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Study goal </title>
      <p>
        According to the analysis of foreign publications [
        <xref ref-type="bibr" rid="ref21 ref22 ref23">21-27</xref>
        ], the most commonly used passwords at
present are passwords associated with personal data, which include birthdays, passport numbers, phone
numbers, e-mail addresses, etc. Using the proposed approach, we will establish how the dependence of
personal information on the number of categories used in the password.
      </p>
      <p>The study poses and solves the problem of determining an effective password based on the theory
of planning and processing the results of experiments.</p>
      <p>This analysis of the results obtained allows us to conclude that password efficiency is primarily
affected by password duration. The effect of mutual influence, based on the initial conditions of the
experiment, practically does not have a significant effect on the listed condition of reliability, which
made it possible to exclude this regressor from the equation.</p>
    </sec>
    <sec id="sec-7">
      <title>4. Problem solution </title>
      <p>Based on the independence of the factors that affect the quality of the password, we will consider
them independent, the combination of the same characters is not allowed, and all of the characters have
the same distribution. Given the considerations, we assume that the password security function satisfies
the regression equation in the form</p>
      <p>… 
,</p>
      <p>According to the results of testing user passwords, it has been found that the strengths of passwords,
which are quantitatively expressed in relative units y, are most significantly influenced by two factors:
the length of the password x1, measured by the number of characters in a password, and the number of
categories of characters x2, measured by various types of characters.
4.1.</p>
    </sec>
    <sec id="sec-8">
      <title>Planning experiments </title>
      <p>categories of characters.
the values of which are presented in Table. 1.</p>
      <p>We will assume that at the user's disposal, lowercase and uppercase letters of the Latin alphabet can
be used as symbols total of numbers are 26 characters, numbers are the total numbers 10 characters,
and special characters are the total number of 33 characters. Thus, we have a total of numbers 4</p>
      <p>Based on the experiment planning theory [29], we also introduce the levels of variation by factors,
Using formulas (3) and (4), we obtain</p>
      <p>The planning matrix looks as shown in Table 2. In this table j is the number of experiments, x1 is the
first sign, which means the number of symbols in the password; x2 is the number of categories used in
the password; yi is the result of an experiment. In this test, we proposed that for each condition of
experiment j we can obtain three results, therefore y j is the average of these results; S
y2 is the variance
characterizing the set of yjv values under constant experimental conditions (i.e., at one point of the
design) is found by the following formula</p>
      <p>Based on Table 2 data and using the feature of the orthogonally-planning matrix for the full factorial
experiment, we can significantly simplify the calculation of the coefficients of the response equation. For the
number of factors k, sample estimates bi are calculated by the formulas
 ̅
 1</p>
      <p>1
х2 
+ 
+ 
 
 


1
4

х1х2 

+ 
 
 
+ 

1</p>
      <p>1</p>
      <p> 
27, 31, 
yi 
35 
25 
55 
36 
15, 20, 
51, 53, 
30, 33, 
  </p>
      <p> 
 ̅
 ̅</p>
      <p>̅
1
4</p>
      <p>1
  1
Next, we calculate S y2 by using values S j2 (these values are shown in Table 2)
Find the variance of the regression coefficients:
We choose the level of reliability of calculations α = 0.95 and find from the table value t1  t0.975</p>
      <p>Therefore







that, less than the critical value F &lt; F0.05; m1 = 1, m2 = 8 = 5.32, and the final formula for the response
function is:</p>
      <p>Formula (8) allows you to evaluate the effectiveness of the entered password within the framework
of the experiment. The analysis of equation (8), where the parameter x1 varies from 4 to 6 symbols, and
the parameter x2 varies from 1 to 3 types of symbol categories, is presented in Table 3.
Response function values for different types of passwords </p>
      <p>The results presented in Table 3 have been derived from the algorithm shown in Figure 1. In this
algorithm, the response function has been calculated according to (1); the variance of measurements
has been calculated by the formula (4); the variance of the coefficients bi has been calculated by the
formula (6); the coefficients ti have been calculated according to (7) to assess the significance; the
adequacy of the response function has been determined by the Fisher criterion.</p>
      <p>Following the task, the number of significant coefficients of the model is d = 3; and
Now we find</p>
      <p>3</p>
      <p>The model experiment consisted in changing the number of symbols of categories 1 and 2, under
the initial data, and establishing the result by the response function (5). The results of the calculation
are shown in Figures 2 and 3.
Figure 2: Diagram of the influence of factors x1 and x2 on the response function y 
Figure 3: Graph of the dependence of the influence of the factor x1 on the response function y 
4.3.</p>
    </sec>
    <sec id="sec-9">
      <title>Discussion </title>
      <p>The article discusses the problem of increasing password strength with personal information use. To
solve this problem, we propose a system that uses personal information when the weak strength
password has initially been set, the strength of which step-by-step increases based on the results of
measurements. Unlike other approaches, the article analyzes the results of our measurements based on
the input response function, which is usually used in the theory of planning and processing the results
of experiments.</p>
      <p>In creating the system model, we build the response function that in the study takes into account not
only various sign of factors but also their mutual influence. As variable factors of the response function,
the length of the password symbols and the number of symbol categories involved in the formation of
the password has been chosen. The algorithm proposed in the article is based on the statistical
characteristics of the set used. Apart from, based on these findings, the dispersion of the response
function coefficients is calculated, and their homogeneity and significance are checked.</p>
      <p>In the course of the study, it has been found that the mutual influence of various categories of
symbols on the result of the response function is not significant, which makes it possible to bring the
response function to a linear form and use it in further research.</p>
      <p>However, the primary analysis regarding the lack of significance of their mutual influence made it
possible to discard the need for such an analysis. During the study, we also concluded the satisfactory
results of the research; and it was considered feasible to recommend the use proposed approach to the
construction of practical password strength meters.</p>
    </sec>
    <sec id="sec-10">
      <title>5. Conclusions </title>
      <p>The article proposes the centralization of technical computing resources, IT specialists, and software
in the general budget cloud. Access to the cloud via the Internet, individualized access to data, and a set
of software functions provided by the bandwidth of network communication channels will be
transferred to the sites. </p>
      <p>To increase the security of printed products at the stages of pre-print and post-print preparation, it is
recommended to use passwords consisting of a large number of characters, including lowercase and
uppercase letters of the Latin alphabet, numbers, and auxiliary symbols. Based on a whole-factor
experiment, a type of response function has been established that allows you to compare passwords and
set the strength of a password.</p>
      <p>This analysis of the results obtained allows us to conclude that password efficiency is primarily
affected by password duration. The effect of mutual influence, based on the initial conditions of the
experiment, practically does not have a significant effect on the put-forward condition of reliability,
which made it possible to exclude this regressor from the equation.</p>
    </sec>
    <sec id="sec-11">
      <title>Acknowledgements </title>
      <p>The work has been carried out on an initiative basis. The authors thank the anonymous reviewers,
whose comments significantly improved the content of the paper.</p>
      <p>The authors also thank both the authorities of the Ukrainian Academy of Printing, Lvov State
University of Internal Affairs, and National Aviation University the especially leadership of the Faculty
of Cybersecurity, Computer and Software Engineering for their support during the preparation of this
paper.</p>
    </sec>
    <sec id="sec-12">
      <title>References </title>
      <p>[24] D. He, B. Zhou, X. Yang, S. Chan, Y. Cheng and N. Guiana, Group Password Strength Meter
Based on Attention Mechanism, IEEE Network 4, (2020): 196-202. doi:
10.1109/MNET.001.1900482.
[25] F. Z. Glory, A. U. Aftab, O. Tremblay-Savard, N. Mohammed, Strong Password Generation Based
On User Inputs, in: Proceeding of 2019 IEEE 10th Annual Information Technology, Electronics
and Mobile Communication Conference (IEMCON), Vancouver, BC, Canada, 2019, pp. 416-423.
doi: 10.1109/IEMCON.2019.8936178.
[26] E. Stavrou, A situation-aware user interface to assess users' ability to construct strong passwords:
A conceptual architecture, in: Proceeding of 2017 International Conference On Cyber Situational
Awareness, Data Analytics And Assessment (Cyber SA), London, UK, 2019, pp. 1-6. doi:
10.1109/CyberSA.2017.8073385.
[27] B. Pal, T. Daniel, R. Chatterjee, T. Ristenpart, Beyond Credential Stuffing: Password Similarity
Models Using Neural Networks, in: Proceeding of 2019 IEEE Symposium on Security and Privacy
(SP), San Francisco, CA, USA, 2019, pp. 417-434. doi: 10.1109/SP.2019.00056.
[28] Passwords – the good ones, the bad ones, and the ugly ones, 2021. URL:
https://itglobal.com/ruru/company/blog/paroli-horoshie-plohie-i-uzhasnye [in Russian]
[29] A.I. Kobzar, Applied mathematical statistics. For engineers and scientists, Fizmatlit, Moscow,
Russia, 2012. URL: https://inlnk.ru/LABao5 [in Russian]</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Whitman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. J.</given-names>
            <surname>Mattord</surname>
          </string-name>
          , Principles of Information Security, Cengage Learning, Boston, USA,
          <year>2021</year>
          . URL: https://inlnk.ru/XO3VB0
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Stamp</surname>
          </string-name>
          , Information security,
          <source>principle and practice</source>
          , Wiley Interscience, Hoboken, USA,
          <year>2021</year>
          . URL: http://surl.li/cubpv
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Varaksa</surname>
          </string-name>
          ,
          <article-title>Underestimating risks can lead to loss of business, Independent Ukrainian magazine F+S: Technologies of business and fire protection</article-title>
          , (
          <year>2011</year>
          ). URL: http://securityinfo.com.ua/articles/?ELEMENT_ID=
          <fpage>526</fpage>
          . [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Armbrust</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Griffith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Joseph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Katz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Konwinski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Patterson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rabkin</surname>
          </string-name>
          , I. Stoica,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharia</surname>
          </string-name>
          , A View of Cloud Computing,
          <source>Communications of the ACM</source>
          ,
          <volume>53</volume>
          (
          <year>2010</year>
          ):
          <fpage>50</fpage>
          -
          <lpage>58</lpage>
          . doi:
          <volume>10</volume>
          .1145/1721654.1721672.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>P.I. Machuga</surname>
          </string-name>
          ,
          <article-title>Virtualization and cloud technologies in accounting: distant future or real present? Efficient economy, 5 (</article-title>
          <year>2013</year>
          ). URL: http://www.economy.nayka.com.ua/?op=1&amp;z=
          <year>2008</year>
          . [in Ukranian]
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E.S.</given-names>
            <surname>Bondar</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.M. Glubovetc</surname>
            ,
            <given-names>S.S.</given-names>
          </string-name>
          <string-name>
            <surname>Gorohovskii</surname>
          </string-name>
          , Cloud computing,
          <article-title>and its applications</article-title>
          .
          <source>Bulletin of KNU named after T. Shevchenko</source>
          ,
          <volume>1</volume>
          (
          <year>2011</year>
          ):
          <fpage>74</fpage>
          -
          <lpage>82</lpage>
          . [in Ukranian]
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.A.</given-names>
            <surname>Voloshchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.I.</given-names>
            <surname>Roznovets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.D.</given-names>
            <surname>Voloshchuk</surname>
          </string-name>
          ,
          <article-title>Support for the decision making on implementation of applications in the hybrid cloud infrastructure</article-title>
          ,
          <source>Informatics and Mathematical Methods in Simulation</source>
          ,
          <volume>1</volume>
          (
          <year>2018</year>
          ):
          <volume>86</volume>
          
          <fpage>97</fpage>
          . URL: http://immm.op.edu.ua/files/archive/ n1_v8_
          <year>2018</year>
          /
          <year>2018</year>
          _1(
          <issue>9</issue>
          ).pdf.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ramgovind</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. M. Eloff</surname>
            ,
            <given-names>E. Smith,</given-names>
          </string-name>
          <article-title>The Management of Security in Cloud computing, in: Proceeding of 2010 Information Security for South Africa (ISSA), Johannesburg</article-title>
          , South Africa,
          <year>2010</year>
          , pp.
          <volume>1</volume>
          
          <issue>7</issue>
          . doi:
          <volume>10</volume>
          .1109/ISSA.
          <year>2010</year>
          .
          <volume>5588290</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Yu. S.</given-names>
            <surname>Ganzhurov</surname>
          </string-name>
          ,
          <article-title>Strategic directions of development of enterprises in the printing industry, printing activities and book trade</article-title>
          , NTUU «KPI», Kyiv,
          <year>2015</year>
          . URL: https://ela.kpi.ua/handle/123456789/15408 [in Ukranian]
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Ya</surname>
            . Yu. Zmihov,
            <given-names>I.V.</given-names>
          </string-name>
          <string-name>
            <surname>Shablyi</surname>
            ,
            <given-names>I.V.</given-names>
          </string-name>
          <string-name>
            <surname>Ogirko</surname>
          </string-name>
          ,
          <article-title>Data formats of the automated control system of the printing house, Qualology of the book</article-title>
          ,
          <source>Proceeding of Ukrainian Academy of Printing</source>
          ,
          <volume>2</volume>
          (
          <year>2018</year>
          ):
          <volume>51</volume>
          
          <fpage>56</fpage>
          . URL: https://inlnk.ru/QwQ1j6 [in Ukranian]
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Wyld</surname>
          </string-name>
          ,
          <article-title>Moving to the Cloud: An Introduction to Cloud Computing in Government, IBM Center for the Business of Government</article-title>
          , USA,
          <year>2009</year>
          . URL: https://www.businessofgovernment.org/sites/default/files/CloudComputingReport.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>O.O.</given-names>
            <surname>Gudzovata</surname>
          </string-name>
          , Cloud services: possibilities, security, perspectives, in: O.
          <article-title>A. Parshina, Theoretical and applied aspects of entrepreneurial competitiveness</article-title>
          , Gerda, Dnipropetrovsk, Ukraine,
          <year>2013</year>
          . URL: https://www.ipu.ru/taxonomy/term/21062. [in Ukranian]
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>L. M. Kaufman</surname>
          </string-name>
          , Can Public-Cloud
          <source>Security Meet Its Unique Challenges? IEEE Security &amp; Privacy</source>
          ,
          <volume>4</volume>
          (
          <year>2010</year>
          ):
          <volume>55</volume>
          
          <fpage>57</fpage>
          . doi:
          <volume>10</volume>
          .1109/MSP.
          <year>2010</year>
          .
          <volume>120</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>G.</given-names>
            <surname>Anthes</surname>
          </string-name>
          , Security in the Cloud,
          <source>Communications of the ACM</source>
          ,
          <volume>53</volume>
          (
          <year>2010</year>
          ):
          <volume>16</volume>
          
          <fpage>18</fpage>
          . doi:
          <volume>10</volume>
          .1145/1839676.1839683.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Christodorescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sailer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Schales</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sgandurra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zamboni</surname>
          </string-name>
          ,
          <article-title>Cloud security is not (just) virtualization security: a short paper</article-title>
          ,
          <source>in: Proceedings of the 2009 ACM workshop on Cloud Computing Security</source>
          , Chicago, Illinois, USA,
          <year>2009</year>
          , pp.
          <volume>97</volume>
          
          <fpage>102</fpage>
          . doi:
          <volume>10</volume>
          .1145/1655008.1655022.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.</given-names>
            <surname>Shaver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Acken</surname>
          </string-name>
          ,
          <article-title>Effects of Equipment Variation on Speaker Recognition Error Rates</article-title>
          ,
          <source>in: Proceeding IEEE International Conference on Acoustics Speech and Signal Processing</source>
          , Dallas, Texas,
          <year>2010</year>
          , pp.
          <fpage>1814</fpage>
          -
          <lpage>1818</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICASSP.
          <year>2010</year>
          .
          <volume>5495401</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ristenpart</surname>
          </string-name>
          , E. Tromer,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shacham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Savage</surname>
          </string-name>
          ,
          <article-title>Hey, you, get off of my cloud: Exploring Information Leakage in Third-party Compute Clouds</article-title>
          ,
          <source>in: Proceedings of the 16th ACM conference on Computer and Communications Security</source>
          , Chicago, Illinois, USA,
          <year>2009</year>
          , pp.
          <volume>199</volume>
          
          <fpage>212</fpage>
          . doi:
          <volume>10</volume>
          .1145/1653662.1653687.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>D.P.</given-names>
            <surname>Kucherov</surname>
          </string-name>
          <article-title>Control of computer network overload</article-title>
          ,
          <source>in: Proceeding of the XVII International Scientific and Practical Conference on Information Technologies and Security (ITS</source>
          <year>2017</year>
          ), Kyiv, Ukraine, November
          <volume>30</volume>
          ,
          <year>2017</year>
          , pp.
          <fpage>69</fpage>
          -
          <lpage>75</lpage>
          ,
          <year>2017</year>
          ,
          <article-title>CEUR-WS.org, online</article-title>
          . URL: http://ceurws.org/Vol-2067/paper10.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Seto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lisi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. K.</given-names>
            <surname>Ahmed</surname>
          </string-name>
          ,
          <article-title>Ensuring document security and privacy in transpromo printing</article-title>
          , in: Proceeding of 2009 IEEE Toronto International Conference Science and
          <article-title>Technology for Humanity (TIC-STH)</article-title>
          , Toronto, ON, Canada,
          <year>2009</year>
          . pp.
          <fpage>290</fpage>
          -
          <lpage>295</lpage>
          . doi:
          <volume>10</volume>
          .1109/TIC-STH.
          <year>2009</year>
          .
          <volume>5444488</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhernova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bizuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Diachenko</surname>
          </string-name>
          ,
          <article-title>Optimizing the parameters of the security printing complex</article-title>
          ,
          <source>in: Proceeding 2015 Xth International Scientific and Technical Conference "Computer Sciences and Information Technologies" (CSIT)</source>
          , Lviv, Ukraine,
          <year>2015</year>
          , pp.
          <fpage>94</fpage>
          -
          <lpage>96</lpage>
          . doi:
          <volume>10</volume>
          .1109/STCCSIT.
          <year>2015</year>
          .
          <volume>7325441</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zelei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Qiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Deep Learning for Password Guessing and Password Strength Evaluation: A Survey</article-title>
          ,
          <source>in: Proceeding of 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</source>
          , Guangzhou, China,
          <year>2020</year>
          , pp.
          <fpage>1162</fpage>
          -
          <lpage>1166</lpage>
          . doi:
          <volume>10</volume>
          .1109/TrustCom50675.
          <year>2020</year>
          .
          <volume>00155</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>C.</given-names>
            <surname>Xinchun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Comxueqing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yiming</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Password</given-names>
            <surname>Strength</surname>
          </string-name>
          <article-title>Evaluation Algorithm Based on Sensitive Personal Information</article-title>
          ,
          <source>in: Proceeding of 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</source>
          , Guangzhou, China,
          <year>2020</year>
          , pp.
          <fpage>1542</fpage>
          -
          <lpage>1545</lpage>
          . doi:
          <volume>10</volume>
          .1109/TrustCom50675.
          <year>2020</year>
          .
          <volume>00211</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>D.</given-names>
            <surname>Pereira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Ferreira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mendes</surname>
          </string-name>
          ,
          <article-title>Evaluating the Accuracy of Password Strength Meters using Off-The-Shelf Guessing Attacks</article-title>
          ,
          <source>in: Proceeding of 2020 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)</source>
          , Coimbra, Portugal,
          <year>2020</year>
          , pp.
          <fpage>237</fpage>
          -
          <lpage>242</lpage>
          . doi:
          <volume>10</volume>
          .1109/ISSREW51248.
          <year>2020</year>
          .
          <volume>00079</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>