Forward Legal Anonymous Group Pairing-Onion Routing for Mobile Opportunistic Networks

计算机科学 计算机网络 配对 群(周期表) 布线(电子设计自动化) 移动计算 计算机安全 超导电性 量子力学 物理 有机化学 化学
作者
Xiuzhen Zhu,Limei Lin,Yanze Huang,Xiaoding Wang,Sun‐Yuan Hsieh,Jie Wu
出处
期刊:IEEE Transactions on Mobile Computing [IEEE Computer Society]
卷期号:24 (7): 6595-6612 被引量:2
标识
DOI:10.1109/tmc.2025.3544674
摘要

Mobile Opportunistic Networks (MONs) often experience frequent interruptions in end-to-end connections, which increases the likelihood of message loss during delivery and makes users more susceptible to various cyber attacks. However, most currently proposed anonymous routing protocols are primarily designed for networks with stable connections, making it challenging to protect user identities in MONs. To address these challenges, we propose FLAG-POR (Forward Legal Anonymous Group Pairing-Onion Routing), a novel anonymous routing protocol specifically tailored to enhance message delivery anonymity and security in MONs. Specifically, we abstract the mobile opportunistic network as a contact graph. By introducing the concept of “groups” into the pairing-onion routing protocol, which encrypts messages and relay nodes layer by layer, we develop a novel group-based pairing-onion routing protocol. This protocol ensures message confidentiality and relay node anonymity, while also improving message forwarding rates, as any node within a group can potentially act as a relay. To ensure message authenticity, we employ the efficient SM2 signing algorithm to generate signatures for the message source. Furthermore, by incorporating parameters such as the public key validity period and master key validity period into the group pairing-onion routing protocol, we achieve forward security in message delivery. We conduct a thorough theoretical analysis of the protocol’s security and performance. The experimental results demonstrate that our FLAG-POR protocol outperforms baseline anonymous protocols in terms of delivery success rate, traceability rate, path anonymity, and node anonymity. Additionally, the FLAG-POR scheme effectively resists three potential threats to the routing system: collusion attack threat, node identification threat, and path identification threat, in any situation.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
哈哈上将完成签到,获得积分10
1秒前
1秒前
1秒前
2秒前
小二郎应助格物致知采纳,获得20
2秒前
Baylin发布了新的文献求助10
4秒前
huohuo完成签到,获得积分10
4秒前
imagineer完成签到,获得积分10
4秒前
Lucas应助好好好采纳,获得10
4秒前
5秒前
lion完成签到,获得积分10
5秒前
搜集达人应助xmhxpz采纳,获得10
5秒前
大模型应助金金金采纳,获得10
5秒前
Owen应助科研通管家采纳,获得10
6秒前
深情安青应助科研通管家采纳,获得10
6秒前
6秒前
脑洞疼应助科研通管家采纳,获得10
6秒前
6秒前
传奇3应助科研通管家采纳,获得10
6秒前
爆米花应助科研通管家采纳,获得10
7秒前
无花果应助科研通管家采纳,获得10
7秒前
v0id应助科研通管家采纳,获得10
7秒前
vampv应助科研通管家采纳,获得10
7秒前
潘木白完成签到,获得积分10
7秒前
CodeCraft应助科研通管家采纳,获得10
7秒前
Akim应助科研通管家采纳,获得10
7秒前
小戈老师发布了新的文献求助30
8秒前
FashionBoy应助科研通管家采纳,获得10
8秒前
完美世界应助科研通管家采纳,获得10
8秒前
桐桐应助科研通管家采纳,获得10
8秒前
kinn应助科研通管家采纳,获得10
8秒前
bkagyin应助科研通管家采纳,获得10
8秒前
123发布了新的文献求助20
9秒前
周大人完成签到 ,获得积分10
9秒前
9秒前
9秒前
9秒前
隐形曼青应助粥粥采纳,获得10
10秒前
科研通AI6.4应助15采纳,获得10
10秒前
独行独行完成签到,获得积分10
11秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Cosmos as Art Object: Studies in Plato's Timaeus and Other Dialogues 500
What is the Future of Psychotherapy in Digital Age? Technology, AI Bots, and Psychotherapy after Covid 444
Management and the Arts 310
Teaching Social and Emotional Learning in Physical Education 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7635929
求助须知:如何正确求助?哪些是违规求助? 9209864
关于积分的说明 19753841
捐赠科研通 7203694
什么是DOI,文献DOI怎么找? 3275325
关于科研通互助平台的介绍 2437151
邀请新用户注册赠送积分活动 2272434