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
4秒前
Jason完成签到 ,获得积分10
5秒前
可一可再发布了新的文献求助10
6秒前
分析发布了新的文献求助10
6秒前
7秒前
7秒前
7秒前
uqq完成签到,获得积分10
8秒前
张德彪完成签到,获得积分10
8秒前
9秒前
地啦啦啦完成签到,获得积分10
10秒前
刘二狗完成签到,获得积分10
10秒前
10秒前
仁爱的小博完成签到 ,获得积分10
10秒前
11秒前
鄂惜霜发布了新的文献求助10
12秒前
樱桃发布了新的文献求助10
12秒前
核桃发布了新的文献求助10
13秒前
巴黎的防发布了新的文献求助10
13秒前
CipherSage应助直率的曼香采纳,获得10
13秒前
14秒前
哇哇哇发布了新的文献求助10
15秒前
鄂惜霜完成签到,获得积分10
19秒前
JamesPei应助MIST采纳,获得10
23秒前
littlepig完成签到,获得积分10
23秒前
25秒前
26秒前
洛莫完成签到,获得积分10
27秒前
28秒前
天天快乐应助王达庆采纳,获得20
28秒前
感动访卉完成签到,获得积分10
28秒前
明亮盼望完成签到,获得积分20
30秒前
30秒前
31秒前
诚心傲南完成签到,获得积分10
32秒前
明理平文完成签到 ,获得积分10
32秒前
32秒前
33秒前
33秒前
明亮盼望发布了新的文献求助10
33秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Molecular Mechanisms of Photosynthesis, 4th Edition 1000
Organic Reactions, Volume 116 1000
Current concepts in cutaneous toxicity : proceedings of the Fourth Conference on Cutaneous Toxicity, Washington, D.C., May 9-11, 1979 1000
The recovery-stress questionnaires : user manual 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7256382
求助须知:如何正确求助?哪些是违规求助? 8878380
关于积分的说明 18751544
捐赠科研通 6936541
什么是DOI,文献DOI怎么找? 3200822
关于科研通互助平台的介绍 2375015
邀请新用户注册赠送积分活动 2176408