检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:佘维[1,2] 马佳伟 张淑慧 程孔 刘炜 田钊[1,2] SHE Wei;MA Jiawei;ZHANG Shuhui;CHENG Kong;LIU Wei;TIAN Zhao(School of Cyber Science and Engineering,Zhengzhou University,Zhengzhou 450002,China;Zhengzhou Key Laboratory of Blockchain and Data Intelligence,Zhengzhou 450002,China)
机构地区:[1]郑州大学网络空间安全学院,河南郑州450002 [2]郑州市区块链与数据智能重点实验室,河南郑州450002
出 处:《通信学报》2025年第2期147-165,共19页Journal on Communications
基 金:国家重点研发计划基金资助项目(No.31703-3);河南省高等学校重点科研基金资助项目(No.24A520045)。
摘 要:针对区块链隐蔽通信效率与安全问题,提出一种基于动态时间型二叉树的隐蔽通信模型。通过特定时刻动态生成时间型二叉树,利用根哈希提取随机因子为树节点分配不同的路径编码,将通信信息字符映射为编码路径及索引字段。通过将特定时刻嵌入路径编码空置位并整合至区块链交易实现隐蔽传输,接收端通过解析特定时刻重构时间型二叉树完成解码。实验结果表明,相较于同类模型,所提模型在保证安全性的同时提升了通信效率,并避免了预协商过程带来的安全隐患。A covert communication model based on a dynamic time binary tree was proposed to address the efficiency and security issues in blockchain-based covert communication.A time binary tree was dynamically generated at specific moments,and the roothash was used to extract random factors for assigning different path codes to the tree nodes.Communication information characters were mapped to the encoded paths and index fields.By embedding vacant bits of the path codes at specific moments and integrating them into blockchain transactions,covert transmission was achieved.The receiver reconstructed the time binary tree at the specific moment to complete the decoding.Experimental results show that,compared to similar models,the proposed model improves communication efficiency while ensuring security,and avoids the security risks brought by the pre-negotiation process.
分 类 号:TP309.2[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.183.98