Research Article
PDF EndNote BibTex RIS Cite

Year 2022, Volume 5, Issue 1, 1 - 26, 28.06.2022
https://doi.org/10.53508/ijiam.1073205

Abstract

References

  • Artz, D. (2001). Digital steganography: hiding data within data. IEEE Internet computing, 5(3), 75-80.
  • Petitcolas, F., Anderson, R., & Kuhn, M. (1999). Information Hiding–A Survey: IEEE Special Issue on Protection of Multimedia Content.
  • Provos, N., & Honeyman, P. (2003). Hide and seek: An introduction to steganography. IEEE security & privacy, 1(3), 32-44.
  • Por, L. Y., & Delina, B. (2008, April). Information hiding: A new approach in text steganography. In WSEAS international conference. Proceedings. Mathematics and computers in science and engineering (Vol. 7). World Scientific and Engineering Academy and Society.
  • Por, L. Y., Ang, T. F., & Delina, B. (2008). Whitesteg: a new scheme in information hiding using text steganography. WSEAS transactions on computers, 7(6), 735-745.
  • Changder, S., Ghosh, D., & Debnath, N. C. (2010, November). Linguistic approach for text steganography through Indian text. In 2010 2nd international conference on computer technology and development (pp. 318-322). IEEE.
  • Kumar, A., & Pooja, K. (2010). Steganography-A data hiding technique. International Journal of Computer Applications, 9(7), 19-23.
  • Bobade, S., & Goudar, R. (2015, February). Secure data communication using protocol steganography in IPv6. In 2015 International Conference on Computing Communication Control and Automation (pp. 275-279). IEEE.
  • Seo, J. O., Manoharan, S., & Mahanti, A. (2016, July). Network steganography and steganalysis-a concise review. In 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) (pp. 368-371). IEEE.
  • Yuan, C., Xia, Z., & Sun, X. (2017). Coverless image steganography based on SIFT and BOF. Journal of Internet Technology, 18(2), 435-442.
  • Ngo, H. H., Wu, X., Le, P. D., Wilson, C., & Srinivasan, B. (2010). Dynamic Key Cryptography and Applications. Int. J. Netw. Secur., 10(3), 161-174.
  • Sklavos, N. (2014). Book Review: Stallings, W. Cryptography and Network Security: Principles and Practice: Upper Saddle River, NJ: Prentice Hall, 2013, 752p, $142.40. ISBN: 13: 978-0133354690.
  • Sabeti, V., & Shoaei, M. (2020). New High Secure Network Steganography Method Based on Packet Length. The ISC International Journal of Information Security, 12(1), 24-44.
  • Liu, G., Zhai, J., & Dai, Y. (2012). Network covert timing channel with distribution matching. Telecommunication Systems, 49(2), 199-205.
  • Gianvecchio, S., & Wang, H. (2007, October). Detecting covert timing channels: an entropy-based approach. In Proceedings of the 14th ACM conference on Computer and communications security. (pp. 307-316).
  • Yang, L., Zhai, J., Liu, W., Ji, X., Bai, H., Liu, G., & Dai, Y. (2019). Detecting word-based algorithmically generated domains using semantic analysis. Symmetry, 11(2), 176.
  • Okello, M. (2018, October). A New Timing Steganography Algorithm in Real-Time Transmission Devices. In 2018 IEEE 18th International Conference on Communication Technology (ICCT) (pp. 880-884). IEEE.
  • Okello, M. O. (2021). Transmission of Secret Information Based on Time Instances. The Eurasia Proceedings of Science Technology Engineering and Mathematics, 16 , 209-218 . DOI: 10.55549/epstem.1068612
  • Ebbinghaus, H.-D., Flum, J., Thomas, Wolfgang, (1994)”Mathematical Logic” (2nd ed.). New York: Springer. p. 656. ISBN 0-387-94258-0
  • Weisstein, Eric W. “Concatenation.” From MatheWorld—A Wolfram WebResource. http://mathworld.wolfram.com/Concatenation.html
  • Stephanie Glen. "Probability of Two Events Occurring Together" From StatisticsHowTo.com: Elementary Statistics for the rest of us!. https://www.statisticshowto.com/how-to-find-the-probability-of-two-events-occurring-together/

Optimal Covert Communication Techniques

Year 2022, Volume 5, Issue 1, 1 - 26, 28.06.2022
https://doi.org/10.53508/ijiam.1073205

Abstract

Due to advancements in hacking and reverse engineering tools, threat against transfer of sensitive data or highly classified information is always at risk of being intercepted by an attacker. Covert communication outwits this malicious breach of privacy act better than cryptography as it camouflages secret information inside another innocent looking information, while cryptography shows scrambled information that might arouse attention of an attacker. However, the challenges in Steganography are the modification of carrier that causes some abnormalities, which are detectable and often the methods are not optimized. This paper presents an approach in Covert communication Chanel, which utilizes mathematical concept of combination to optimize time of transmission using sets of multiple transmitters, and receivers addresses where each abstractly represents a set of bits or characters combination without modifying the address. To minimize the number of physical address for use, a combination and permutation concept of virtual address generation from physical address is introduce. The paper in addition presents some technique like relationship and their application in both re-enforcing resistivity against Steganalysis and generating combinations. Furthermore, a concept of dynamical clockwise and anti-clockwise rotation of combination over addresses after every transmission is introduced to improve on resistivity against Steganalysis. A simple test was performed for demonstrating relay address, combination and permutation concepts. Based on test results and analysis, the method is effective as expected and it is quite easy to use as it can be implemented in different platforms without much difficulties.

References

  • Artz, D. (2001). Digital steganography: hiding data within data. IEEE Internet computing, 5(3), 75-80.
  • Petitcolas, F., Anderson, R., & Kuhn, M. (1999). Information Hiding–A Survey: IEEE Special Issue on Protection of Multimedia Content.
  • Provos, N., & Honeyman, P. (2003). Hide and seek: An introduction to steganography. IEEE security & privacy, 1(3), 32-44.
  • Por, L. Y., & Delina, B. (2008, April). Information hiding: A new approach in text steganography. In WSEAS international conference. Proceedings. Mathematics and computers in science and engineering (Vol. 7). World Scientific and Engineering Academy and Society.
  • Por, L. Y., Ang, T. F., & Delina, B. (2008). Whitesteg: a new scheme in information hiding using text steganography. WSEAS transactions on computers, 7(6), 735-745.
  • Changder, S., Ghosh, D., & Debnath, N. C. (2010, November). Linguistic approach for text steganography through Indian text. In 2010 2nd international conference on computer technology and development (pp. 318-322). IEEE.
  • Kumar, A., & Pooja, K. (2010). Steganography-A data hiding technique. International Journal of Computer Applications, 9(7), 19-23.
  • Bobade, S., & Goudar, R. (2015, February). Secure data communication using protocol steganography in IPv6. In 2015 International Conference on Computing Communication Control and Automation (pp. 275-279). IEEE.
  • Seo, J. O., Manoharan, S., & Mahanti, A. (2016, July). Network steganography and steganalysis-a concise review. In 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) (pp. 368-371). IEEE.
  • Yuan, C., Xia, Z., & Sun, X. (2017). Coverless image steganography based on SIFT and BOF. Journal of Internet Technology, 18(2), 435-442.
  • Ngo, H. H., Wu, X., Le, P. D., Wilson, C., & Srinivasan, B. (2010). Dynamic Key Cryptography and Applications. Int. J. Netw. Secur., 10(3), 161-174.
  • Sklavos, N. (2014). Book Review: Stallings, W. Cryptography and Network Security: Principles and Practice: Upper Saddle River, NJ: Prentice Hall, 2013, 752p, $142.40. ISBN: 13: 978-0133354690.
  • Sabeti, V., & Shoaei, M. (2020). New High Secure Network Steganography Method Based on Packet Length. The ISC International Journal of Information Security, 12(1), 24-44.
  • Liu, G., Zhai, J., & Dai, Y. (2012). Network covert timing channel with distribution matching. Telecommunication Systems, 49(2), 199-205.
  • Gianvecchio, S., & Wang, H. (2007, October). Detecting covert timing channels: an entropy-based approach. In Proceedings of the 14th ACM conference on Computer and communications security. (pp. 307-316).
  • Yang, L., Zhai, J., Liu, W., Ji, X., Bai, H., Liu, G., & Dai, Y. (2019). Detecting word-based algorithmically generated domains using semantic analysis. Symmetry, 11(2), 176.
  • Okello, M. (2018, October). A New Timing Steganography Algorithm in Real-Time Transmission Devices. In 2018 IEEE 18th International Conference on Communication Technology (ICCT) (pp. 880-884). IEEE.
  • Okello, M. O. (2021). Transmission of Secret Information Based on Time Instances. The Eurasia Proceedings of Science Technology Engineering and Mathematics, 16 , 209-218 . DOI: 10.55549/epstem.1068612
  • Ebbinghaus, H.-D., Flum, J., Thomas, Wolfgang, (1994)”Mathematical Logic” (2nd ed.). New York: Springer. p. 656. ISBN 0-387-94258-0
  • Weisstein, Eric W. “Concatenation.” From MatheWorld—A Wolfram WebResource. http://mathworld.wolfram.com/Concatenation.html
  • Stephanie Glen. "Probability of Two Events Occurring Together" From StatisticsHowTo.com: Elementary Statistics for the rest of us!. https://www.statisticshowto.com/how-to-find-the-probability-of-two-events-occurring-together/

Details

Primary Language English
Subjects Computer Science, Interdisciplinary Application, Mathematics, Applied
Journal Section Articles
Authors

Moses Oyaro OKELLO> (Primary Author)
It is not affiliated with an institution
0000-0002-5483-1147
Uganda

Publication Date June 28, 2022
Published in Issue Year 2022, Volume 5, Issue 1

Cite

Bibtex @research article { ijiam1073205, journal = {International Journal of Informatics and Applied Mathematics}, issn = {}, eissn = {2667-6990}, address = {}, publisher = {International Society of Academicians}, year = {2022}, pages = {1 - 26}, doi = {10.53508/ijiam.1073205}, title = {Optimal Covert Communication Techniques}, key = {cite}, author = {Okello, Moses Oyaro} }
APA Okello, M. O. (2022). Optimal Covert Communication Techniques . International Journal of Informatics and Applied Mathematics , 5 (1) , 1-26 . DOI: 10.53508/ijiam.1073205
MLA Okello, M. O. "Optimal Covert Communication Techniques" . International Journal of Informatics and Applied Mathematics 5 (2022 ): 1-26 <https://dergipark.org.tr/en/pub/ijiam/article/1073205>
Chicago Okello, M. O. "Optimal Covert Communication Techniques". International Journal of Informatics and Applied Mathematics 5 (2022 ): 1-26
RIS TY - JOUR T1 - Optimal Covert Communication Techniques AU - Moses OyaroOkello Y1 - 2022 PY - 2022 N1 - doi: 10.53508/ijiam.1073205 DO - 10.53508/ijiam.1073205 T2 - International Journal of Informatics and Applied Mathematics JF - Journal JO - JOR SP - 1 EP - 26 VL - 5 IS - 1 SN - -2667-6990 M3 - doi: 10.53508/ijiam.1073205 UR - https://doi.org/10.53508/ijiam.1073205 Y2 - 2022 ER -
EndNote %0 International Journal of Informatics and Applied Mathematics Optimal Covert Communication Techniques %A Moses Oyaro Okello %T Optimal Covert Communication Techniques %D 2022 %J International Journal of Informatics and Applied Mathematics %P -2667-6990 %V 5 %N 1 %R doi: 10.53508/ijiam.1073205 %U 10.53508/ijiam.1073205
ISNAD Okello, Moses Oyaro . "Optimal Covert Communication Techniques". International Journal of Informatics and Applied Mathematics 5 / 1 (June 2022): 1-26 . https://doi.org/10.53508/ijiam.1073205
AMA Okello M. O. Optimal Covert Communication Techniques. IJIAM. 2022; 5(1): 1-26.
Vancouver Okello M. O. Optimal Covert Communication Techniques. International Journal of Informatics and Applied Mathematics. 2022; 5(1): 1-26.
IEEE M. O. Okello , "Optimal Covert Communication Techniques", International Journal of Informatics and Applied Mathematics, vol. 5, no. 1, pp. 1-26, Jun. 2022, doi:10.53508/ijiam.1073205

International Journal of Informatics and Applied Mathematics