Research on Covert Communication Technology Based on Matrix Decomposition of Digital Currency Transaction Amount
Rattachement africain : cn, ru. Niveau de preuve : code pays fourni par la source.
Le résumé fourni par la source
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.
Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.
Le contrôle bibliographique ouvert
DOI retrouvé dans Crossref DOI retrouvé ; titre concordant.
- Titre Crossref
- Research on Covert Communication Technology Based on Matrix Decomposition of Digital Currency Transaction Amount
- Date Crossref
- 30/04/2024
- Éditeur
- Korean Society for Internet Information (KSII)
- Type
- journal-article
Ce recoupement confirme des métadonnées liées au DOI. Il ne confirme ni la méthode ni les conclusions de l’étude, et il ne compte pas comme une seconde source scientifique indépendante.
Les institutions déclarées
Une affiliation ne permet pas de déduire la nationalité d’un auteur.