From one-one to one-many: ORCA enables scalable and revocable group covert communication on blockchain

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Zhujun Wang , Lejun Zhang , Xueqing Li , Shen Su , Jing Qiu , Tie Qiu , Ran Guo
{"title":"From one-one to one-many: ORCA enables scalable and revocable group covert communication on blockchain","authors":"Zhujun Wang ,&nbsp;Lejun Zhang ,&nbsp;Xueqing Li ,&nbsp;Shen Su ,&nbsp;Jing Qiu ,&nbsp;Tie Qiu ,&nbsp;Ran Guo","doi":"10.1016/j.comnet.2025.111671","DOIUrl":null,"url":null,"abstract":"<div><div>The decentralized and immutable nature of blockchainprovides a resilient foundation for covert communication in adversarial and untrusted environments, specifically in scenarios requiring unobservable multi-recipient messaging. Most existing schemes, however, are limited to one-to-one transmission and lack mechanisms to handle untrusted receivers, which constrains their scalability and security. To address these challenges, we propose ORCA (Orthogonal Covert Architecture), a group covert communication framework based on strictly orthogonal, integer-valued codewords. ORCA selects codewords from a Hadamard matrix and applies secret column permutations to ensure decoding isolation and resistance against inference attacks. Each receiver recovers only its assigned message through projection, without coordination or leakage. This encoding structure supports scalable embedding, seamless receiver revocation, and clean integration with standard transaction fields. In contrast to prior work, we analyze the impact of imperfect orthogonality and provide theoretical bounds on decoding interference. Extensive experiments on real-world Bitcoin blockchain data and comparative evaluation against representative covert communication schemes confirm ORCA’s robustness, high embedding capacity, and statistical indistinguishability from normal blockchain activity. These results establish ORCA as a scalable and secure solution for multi-recipient covert communication in adversarial environments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111671"},"PeriodicalIF":4.6000,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625006383","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

The decentralized and immutable nature of blockchainprovides a resilient foundation for covert communication in adversarial and untrusted environments, specifically in scenarios requiring unobservable multi-recipient messaging. Most existing schemes, however, are limited to one-to-one transmission and lack mechanisms to handle untrusted receivers, which constrains their scalability and security. To address these challenges, we propose ORCA (Orthogonal Covert Architecture), a group covert communication framework based on strictly orthogonal, integer-valued codewords. ORCA selects codewords from a Hadamard matrix and applies secret column permutations to ensure decoding isolation and resistance against inference attacks. Each receiver recovers only its assigned message through projection, without coordination or leakage. This encoding structure supports scalable embedding, seamless receiver revocation, and clean integration with standard transaction fields. In contrast to prior work, we analyze the impact of imperfect orthogonality and provide theoretical bounds on decoding interference. Extensive experiments on real-world Bitcoin blockchain data and comparative evaluation against representative covert communication schemes confirm ORCA’s robustness, high embedding capacity, and statistical indistinguishability from normal blockchain activity. These results establish ORCA as a scalable and secure solution for multi-recipient covert communication in adversarial environments.
从一对一到一对一多:ORCA在区块链上实现可扩展和可撤销的组隐蔽通信
区块链的去中心化和不可变性为在对抗和不受信任的环境中进行秘密通信提供了弹性基础,特别是在需要不可观察的多接收者消息传递的情况下。然而,大多数现有方案仅限于一对一传输,缺乏处理不可信接收方的机制,这限制了它们的可扩展性和安全性。为了解决这些挑战,我们提出了ORCA(正交隐蔽架构),这是一种基于严格正交的整数值码字的组隐蔽通信框架。ORCA从Hadamard矩阵中选择码字,并应用秘密列排列来确保解码隔离和抵抗推理攻击。每个接收方通过投射只恢复其指定的信息,没有协调或泄漏。这种编码结构支持可扩展的嵌入、无缝的接收方撤销以及与标准事务字段的干净集成。与先前的工作相比,我们分析了不完全正交性的影响,并提供了解码干扰的理论界限。对真实世界比特币区块链数据的广泛实验以及与代表性隐蔽通信方案的比较评估证实了ORCA的鲁棒性、高嵌入容量以及与正常区块链活动的统计不可区分性。这些结果建立了ORCA作为对抗环境中多接收者隐蔽通信的可扩展和安全解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信