skip to main content
research-article

Authentication of LINE Chat History Files by Information Hiding

Authors Info & Claims
Published:27 January 2022Publication History
Skip Abstract Section

Abstract

With the prevalence of smartphones, message exchanges via mobile chatting programs like LINE have become popular. The messages in the form of chat records in a LINE chat history, after being downloaded for legal uses, might be tampered with illicitly. A novel method for authenticating the chat history against such attacks is proposed. The signal used for authenticating each chat-record segment is created by concatenating the ID label of the segment and a digest yielded by hashing the segment content. The signal is then encoded by three types of spacing code, namely half space, full space, and tab, and embedded into the blank-space areas created by the tab codes in the chat records of the segment. Authentication of a history file is accomplished by extracting the authentication signals embedded in the file and comparing them with the original signals computed directly from the file. The embedded signals are invisible, arousing no suspicion from the hacker. The signals are fragile, because any modification of the records can be detected by the authentication process. Experiments for testing four types of tampering with text files of four languages have been conducted, yielding correct authentication results that show the feasibility of the proposed method.

REFERENCES

  1. [1] LINE Corporation. 2019. LINE: Free Calls & Messages. Retrieved October 10, 2019 from https://line.me/en/.Google ScholarGoogle Scholar
  2. [2] Wikipedia. 2021. Facebook Messenger. Retrieved March 25, 2021 from https://en.wikipedia.org/wiki/Facebook_Messenger.Google ScholarGoogle Scholar
  3. [3] Wikipedia. 2021. Instagram. Retrieved March 28, 2021 from https://en.wikipedia.org/wiki/Instagram.Google ScholarGoogle Scholar
  4. [4] LINE Corporation. 2019. Responding to Law Enforcement Agencies, Retrieved April 15, 2021 from https://linecorp.com/en/security/article/35.Google ScholarGoogle Scholar
  5. [5] Artz Donovan. 2001. Digital steganography: Hiding data within data. IEEE Internet Computing 5, 3 (2001), 7580. DOI:http://doi.org/10.1109/4236.935180 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Chotikakamthorn Nopporn. 1999. Document image data hiding technique using character spacing width sequence coding. In Proceedings of the International Conference on Image Processing. 250254. DOI: DOI: https://doi.org/10.1109/ICIP.1999.822894Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] Lee I.-Shi and Tsai. Wen-Hsiang 2008. Data hiding in emails and applications using unused ASCII control codes. Journal of Information Technology and Applications 3, 1 (2008), 1324.Google ScholarGoogle Scholar
  8. [8] Kothari Lipi, Thakkar Rikin, and Khara Satvik. 2017. Data hiding on web using combination of steganography and cryptography. In Proceedings of the International Conference on Computer, Communications, and Electronics. 448452. DOI: DOI: https://doi.org/10.1109/COMPTELIX.2017.8004011Google ScholarGoogle ScholarCross RefCross Ref
  9. [9] Bender Walter, Gruhl Daniel, Morimoto Norishige, and Lu Anthony. 1996. Techniques for data hiding. IBM System Journal 35, 3.4 (1996), 313336. DOI: DOI: https://doi.org/10.1147/sj.353.0313 Google ScholarGoogle ScholarCross RefCross Ref
  10. [10] Winstein K.. 2019. Lexical Steganography Through Adaptive Modulation of the Word Choice Hash. Retrieved July 15, 2019 from http://web.mit.edu/keithw/tlex/.Google ScholarGoogle Scholar
  11. [11] Nagarhalli Tatwadarshi P.. 2014. A new approach to SMS text steganography using emoticons. In Proceedings of the National Conference on the Role of Engineers in Nation Building. 103105.Google ScholarGoogle Scholar
  12. [12] Liu Tsung-Yuan and Tsai Wen-Hsiang. 2007. A new steganographic method for data hiding in Microsoft Word documents by a change tracking technique. IEEE Transactions on Information Forensics and Security 2, 1 (2007), 2430. DOI: DOI: https://doi.org/10.1109/TIFS.2006.890310 Google ScholarGoogle ScholarCross RefCross Ref
  13. [13] Rafat Khan Farhan. 2009. Enhanced text steganography in SMS. In Proceedings of the 2nd IEEE International Conference on Computer, Control, and Communication. 16. DOI: DOI: https://doi.org/10.1109/IC4.2009.4909228Google ScholarGoogle ScholarCross RefCross Ref
  14. [14] Samphaiboon Natthawut. 2011. Steganography via running short text messages. Multimedia Tools and Applications 52 (2011), 569596. DOI: DOI: https://doi.org/10.1007/s11042-009-0432-3 Google ScholarGoogle ScholarCross RefCross Ref
  15. [15] Hassan Shirali-Shahreza M. and Shirali-Shahreza Mohammad. 2007. Text steganography in chat. In Proceedings of the 3rd IEEE/IFIP International Conference in Central Asia on Internet. 1–5. DOI: DOI: https://doi.org/10.1109/CANET.2007.4401716 Google ScholarGoogle ScholarCross RefCross Ref
  16. [16] Hsu Yu-Tsung and Wu Da-Chun. 2019. Authentication of LINE chat records by information hiding techniques. In Proceedings of the 2019 Cryptology and Information Security Conference.Google ScholarGoogle Scholar
  17. [17] Wikipedia. 2021. HTML. Retrieved April 5, 2021 from https://en.wikipedia.org/wiki/HTML.Google ScholarGoogle Scholar
  18. [18] JSON org. 2021. Introducing JSON. Retrieved April 10, 2021 from https://www.json.org.Google ScholarGoogle Scholar
  19. [19] Lin Chang-Chou and Tsai Wen-Hsiang. 2014. Secret image sharing with steganography and authentication. Journal of Systems and Software 73, 3 (2014), 405414. DOI: DOI: https://doi.org/10.1016/S0164-1212(03)00239-5 Google ScholarGoogle ScholarCross RefCross Ref
  20. [20] Schild Tomas. 2019. Search for Character(s) in Unicode 13.0.0. Retrieved November 8, 2021 from https://unicode-search.net/.Google ScholarGoogle Scholar
  21. [21] Unicode Inc. 2019. Unicode: World Standard for Text and Emoji. Retrieved September 16, 2019 from https://home.unicode.org/.Google ScholarGoogle Scholar
  22. [22] Song Ling, Liao Guohong, and Guo Jian. 2017. Non-full Sbox linearization: Applications to collision attacks on round-reduced Keccak. In Proceedings of the Annual International Cryptology Conference. 428451.Google ScholarGoogle ScholarCross RefCross Ref
  23. [23] Sandcastle Documented Class Library. 2019. SHA3.Shake256 Method. Retrieved September 30, 2019 from http://mathmesh.com/Code/mmm/html/86c2bae1-9518-e8ae-e1f5-5a7712812f1b.htm.Google ScholarGoogle Scholar
  24. [24] NIST. 2019. SHA-3 Project - Hash Functions | CSRC. Retrieved September 22, 2019 from https://csrc.nist.gov/projects/hash-functions/sha-3-project.Google ScholarGoogle Scholar
  25. [25] Craver Scott, Memon Nasir, Yeo Boon-Lock, and Yeung Minerva M.. 1998. Resolving rightful ownerships with invisible watermarking techniques: Limitations, attacks, and implications. IEEE Journal on Selected Areas in Communications 16, 4 (1998), 573586. DOI: DOI: https://doi.org/10.1109/49.668979 Google ScholarGoogle ScholarCross RefCross Ref
  26. [26] Zhu Renjie, Zhang Xinpeng, Shi Mengte, and Tang Zhenjun. 2020. Secure neural network watermarking protocol against forging attack. EURASIP Journal on Image and Video Processing 2020, 37 (2020), 112. DOI: DOI: https://doi.org/10.1186/s13640-020-00527-1Google ScholarGoogle Scholar
  27. [27] Miller Matt L., Cox Ingemar J., Linnartz Jean-Paul M. G., and Kalker Ton. 1999. A review of watermarking principles and practices. In Digital Signal Processing in Multimedia Systems, Keshab K. Parhi and Takao Nishitani (Eds.). CRC Press, Boca Raton, FL, 461485. DOI: DOI: https://doi.org/10.1201/9781482276046Google ScholarGoogle Scholar

Index Terms

  1. Authentication of LINE Chat History Files by Information Hiding

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Multimedia Computing, Communications, and Applications
      ACM Transactions on Multimedia Computing, Communications, and Applications  Volume 18, Issue 1
      January 2022
      517 pages
      ISSN:1551-6857
      EISSN:1551-6865
      DOI:10.1145/3505205
      Issue’s Table of Contents

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 27 January 2022
      • Accepted: 1 July 2021
      • Revised: 1 May 2021
      • Received: 1 November 2020
      Published in tomm Volume 18, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    View Full Text

    HTML Format

    View this article in HTML Format .

    View HTML Format