MODIFICATION OF MENG’S DENIABLE ENCRYPTION ALGORITHM

Authors

  • A. V. Galchenko Zaporozhzhya National Technical University, Zaporizhzhya, Ukraine, Ukraine
  • G. L. Kozina Zaporozhzhya National Technical University, Zaporizhzhya, Ukraine, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2016-2-10

Keywords:

protocol, deniable encryption, ambiguity, distribution keys, fake messages, an extended Rabin’s scheme, oblivious transfer, factorization, discrete logarithm.

Abstract

The article discusses the stability of modern cryptographic systems to attack from coercion in respect of subscribers cryptographic systems. Due to the rapid development of information technology, this problem is relevant in the field of information security. To address the sustainability of modern cryptographic systems use algorithms offered by the authors deniable encryption ensures that the attacker is unable to get any valuable information from subscribers. Solving the problem is to use Meng’s deniable encryption algorithm, which guarantees
protection not only information, but also the participants of the exchange. The main purpose of the article is performed by modifying the initial Meng’s deniable encryption algorithm [1] with using Oblivious Transfer Protocol , which prompted by Moni Naor [2]. Oblivious Transfer Protocol to significantly reduce the time required to perform the Meng’s deniable encryption algorithm, and facilitates its implementation to solve applied problems in the field of information security.
As a result of experiments, the authors confirmed that Oblivious Transfer Protocol using is an effective solution to the problem of generation and distribution of keys in the Meng’s deniable encryption algorithm.

References

Wang J. A Receiver Deniable Encryption Scheme / J. Wang, Bo Meng // Proceedings of the 2009 International Symposium on Information Processing (ISIP’09), 21–23 August 2009: proceedings. – Huangshan : P. R. China, 2009. – P. 254–257. 2. Naor M. Efficient oblivious transfer protocols / M. Naor, B. Pinkas // Proceedings of SIAM Symposium on Discrete Algorithms (SODA ’01), 2001: proceedings. – Society for Industrial and Applied Mathematics, 2001. – P. 448–457. 3. Ibrahim H. Receiver–deniable Public–Key Encryption / H. Ibrahim // International Journal of Internet Security. – 2009. – Vol. 8, № 2. – P. 159–165. 4. Козіна Г. Л. Заперечуване шифрування / Г. Л. Козіна, А. В. Гальченко // Тиждень науки – 2015: Тези доповідей щорічної наук. – практ. конф. викладачів, науковців, молодих учених, аспірантів, студентів ЗНТУ, Запоріжжя, 13–17 квітня 2015 р. – Запоріжжя : ЗНТУ, 2015. 5. Canetti R. Deniable Encryption / [R. Canetti, С. Dwork, М. Naor, R. Ostronsky] // Advances in Cryptology. – CRYPTO, 1997, Proceedings. – P. 90–104. 6. Молдовян Н.А. Расширение криптосхемы Рабина: алгоритм отрицаемого шифрования по открытому ключу / Н. А. Молдовян, А. А. Горячев, М. А. Вайчикаускас // ВЗИ. Журнал по вопросам защиты информации. – ФГУП «ВИМИ», 2014. – № 2. – С. 12–16. 7. Фисун С.Н. Комбинированный алгоритм вероятностного шифрования / С. Н. Фисун, О. И. Куржиевская // Изд-во СевНТУ, 2010. – № 101. – С. 37–40. 8. Bresson E. A Simple Public – Key Cryptosystem with a Double Trapdoor Decryption Mechanism and its Applications / E. Bresson, D. Catalano, D. Pointcheval // Advances in Cryptology – ASIACRYPT, 2003. LNCS, Vol. 2894. Springer, Heidelberg, 2003. – P. 37–54. 9. Klonowski M. Practical Deniable Encryption // M. Klonowski, P. Kubiak, and M. Kutyіowsk // SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Slovakia : Novy Smokovec, 19–25 January 2008: proceedings. – 2008. – P. 599–609.

Downloads

How to Cite

Galchenko, A. V., & Kozina, G. L. (2016). MODIFICATION OF MENG’S DENIABLE ENCRYPTION ALGORITHM. Radio Electronics, Computer Science, Control, (2). https://doi.org/10.15588/1607-3274-2016-2-10

Issue

No. 2 (2016): Radio Electronics, Computer Science, Control

Section

Progressive information technologies

License

Copyright (c) 2016 A. V. Galchenko, G. L. Kozina

Creative Commons License

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.