DENIABLE ENCRYPTION BASED ON HYBRID CRYPTOGRAPHIC SYSTEMS USING
Keywords:block encryption, brute force, deniable encryption, information and telecommunication system, denability, unauthorized access, data processing, pseudo-likelihood, public data, recognition, extended cryptographic schema Rabin, secret data, static data.
Context. Unauthorized access to well-protected information and telecommunication systems is a topical problem in the information security field . For this problem solving, it is proposed to use the deniable encryption mechanisms, which allows its
managers to object to the existence of data, ensure their confidentiality and protect the information managers from brute force using by the intruders to obtain key information, during the unauthorized access to information. The article outlines the approach to the use of the existing deniable encryption algorithms for the protection of large data arrays.
Objective. The main purpose of this researching is a hypothesis test that it’s possibile to use deniable encryption algorithms for large data arrays protection, because all algorithms in this direction are asymmetric and not adapted to work with “big data”. Method. The test of hypothesis is carried out by additional data processing units using in the output deniable encryption algorithm with public key, which based on the extended cryptographic scheme of Rabin  and whose structure and features are most suitable for verifying this hypothesis put forward by the author. Results. According to the experiments result, the authors proposed a prototype of deniable encryption algorithm with block encryption of data implemented, which also preserves the deniability mechanism features from the original deniable encryption algorithm. Besides, all changes in algorithm which were proposed by the authors provide the productivity increasing compared with existing approaches [3–6]. Conclusions. Authors have solved a problem of using the existing deniable encryption algorithms, for the large data arrays security, for example for the deniable encryption algorithm with open key, which based on the Rabin extended cryptographic scheme. The proposed approach of the hybrid algorithm constructing with deniable mechanism demonstrates not only the preservation of the basic algorithm properties, but also good performance of the any size data block encrypting ability. Proposed algorithm allows to solve not only the problem of ensuring data confidentiality during the unauthorized access to them, but also makes its suitable for practical using.
Analiticheskij centr kompanii InfoWatch [Elektronnij
resurs]. Moscow, InfoWatch, 2017–2018. Rezhim dostupu:
Moldovyan N. A., Vajchikauskas M. A. Rasshirenie
kriptosxemy Rabina: algoritm otricaemogo shifrovaniya po
otkrytomu klyuchu, Nauchno-texnicheskij centr oboronnogo
kompleksa «Kompas», Voprosy zashhity informacii, 2014,
No. 2, pp. 12–16.
Goldwasser S., Micali S. Probabilistic encrypton Journal of
Computer and System Sciences, 1984, Vol. 28, pp. 270–299.
Ibrahim H. Receiver-Deniable Public-Key Encryption,
International Journal of Network Security, 2009, Vol. 8,
No. 2, pp. 159–165.
Moldovyan N. A., Birichevskij A. R., Mondikova Ya. A.
Otricaemoe shifrovanie na osnove blochnyx shifrov,
Informacionno-upravlyayushhie sistemy, 2014, No. 5,
Moldovyan A. A., Tatchina Ya. A. Sposoby
psevdoveroyatnostnogo blochnogo shifrovaniya,
Intellektual’nye texnologii na transporte, 2018, No. 1,
Canetti R., Dwork C., Naor M., Ostrovsky R. Deniable
Encryption, Advances in Cryptology, CRYPTO, 1997,
Procedings, pp. 90–104.
Bo Meng, Jiang Qing Wang A Receiver Deniable Encryption
Scheme, Proceedings of the 2009 International Symposium
on Information Processing (ISIP’09), 2009, pp. 254–
Gal’chenko A. V. Perspektyvy vykorystannja
zaperechuvanogo shyfruvannja v galuzi aviaperevezen’,
AVIA 2017: HIII Mizhnarodna naukovo-tehnichna
konferencija, Kyi’v, 19–21 kvitnja 2017 r, tezy dopovidej.
Kyi’v, NAU, 2017, pp. 24–28.
Gal’chenko A. V. Zahyst personal’nyh danyh z
vykorystannjam algorytmiv neodnoznachnogo shyfruvannja,
Visnyk ZNU: Matematychne modeljuvannja ta prykladna
mehanika, 2017, No. 2, pp. 19–32.
Moldovyan N. A., Mixteev M. S., Nguen K. T. Protokol
otricaemogo shifrovaniya po otkrytomu klyuchu,
vklyuchayushhij proceduru autentifikacii pol’zovatelej,
Voprosy zashhity informacii, 2016, No. 3, pp. 9–15.
Moldovyan N. A., Bashirov Z. S., Solnyshkin Zh. A.
Protokol potochnogo otricaemogo shifrovaniya s
razdelyaemym klyuchom, Voprosy zashhity informacii,
, No. 3, pp. 27–31.
Shnajer B. Prikladnaya kriptografiya: Protokoly, algoritmy,
isxodnye teksty na yazyke Si. Moscow, Triumf, 2012, 816 p.
How to Cite
Copyright (c) 2019 A. V. Galchenko, S. V. Choporov
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.