Research on Covert Communication Technology Based on Matrix Decomposition of Digital Currency Transaction Amount

• Lejun Zhang,
• Bo Zhang,
• Ran Guo,
• Zhujun Wang,
• Guopeng Wang,
• Jing Qiu,
• Shen Su,
• Yuan Liu,
• Guangxia Xu,
• Zhihong Tian,
• Sergey Gataullin,

Vol. 18, No. 4, April 30, 2024
10.3837/tiis.2024.04.011, Download Paper (Free):

• Blockchain
• Covert communication
• Matrix decomposition
• transaction amount
• embedding rate
• detection resistance

Abstract

With the development of covert communication technologies, the number of covert communication technologies using blockchain as a carrier is increasing. However, using the transaction amount of digital currency as a carrier for covert communication has problems such as low embedding rate, large consumption of transaction amount, and easy detection. In this paper, firstly, by experimentally analyzing the distribution of bitcoin transaction amounts, we determine the most suitable range of amounts for matrix decomposition. Secondly, we design a novel matrix decomposition method that can successfully decompose a large amount matrix into two small amount matrices and utilize the elements in the small amount matrices for covert communication. Finally, we analyze the feasibility of the novel matrix decomposition method in this scheme in detail from four aspects, and verify it by experimental comparison, which proves that our scheme not only improves the embedding rate and reduces the consumption of transaction amount, but also has a certain degree of resistance to detection.

Statistics

Cite this article