论文标题
车辆网络中的合作位置隐私:为什么简单的混合区还不够
Cooperative Location Privacy in Vehicular Networks: Why Simple Mix-zones are not Enough
论文作者
论文摘要
车辆通信披露了有关车辆及其下落的丰富信息。化名身份验证可以在增强用户隐私的同时确保通信。为了增强位置隐私,提出了加密混合区,以促进车辆秘密过渡到新的短暂凭证。对(句法和语义)的弹性链接(攻击)高度取决于混合区,迁移率模式,车辆密度和到达速率的几何形状。我们引入了一种跟踪算法,用于在密码保护的混合区之前和之后连接假名。我们的实验结果表明,窃听的,利用标准化的车辆通信信息和道路布局,可以在非毛茸茸的时间内成功连接73%的假名,而在车辆在混合区域中更改其假名后的高峰时段,可以将73%的假名与62%的化名联系起来。为了减轻这种推理攻击,我们提出了一种新颖的合作混合区域方案,该方案可增强用户隐私,而不管车辆移动性模式,车辆密度和到达混合区的到达率如何。一部分被称为继电器车辆的车辆被选为负责模拟不存在的车辆的原因。此类车辆在不影响安全关键操作的情况下协同发射诱饵交通:有50%的车辆作为中继车辆,将假名(整个间隔)连接起来的可能性从68%下降到18%。平均而言,这将在路边单元(RSUS)和4.67毫秒的额外计算开销上,每秒在(继电器)车辆侧施加28毫秒的额外计算开销;它还通过(继电器)车辆和45 kb/sec的RSU引入了1.46 kb/sec的额外通信开销,用于传播诱饵交通。因此,用户隐私以低计算和通信开销的成本增强。
Vehicular communications disclose rich information about the vehicles and their whereabouts. Pseudonymous authentication secures communication while enhancing user privacy. To enhance location privacy, cryptographic mix-zones were proposed to facilitate vehicles covertly transition to new ephemeral credentials. The resilience to (syntactic and semantic) pseudonym linking (attacks) highly depends on the geometry of the mix-zones, mobility patterns, vehicle density, and arrival rates. We introduce a tracking algorithm for linking pseudonyms before and after a cryptographically protected mix-zone. Our experimental results show that an eavesdropper, leveraging standardized vehicular communication messages and road layout, could successfully link 73% of pseudonyms during non-rush hours and 62% of pseudonyms during rush hours after vehicles change their pseudonyms in a mix-zone. To mitigate such inference attacks, we present a novel cooperative mix-zone scheme that enhances user privacy regardless of the vehicle mobility patterns, vehicle density, and arrival rate to the mix-zone. A subset of vehicles, termed relaying vehicles, are selected to be responsible for emulating non-existing vehicles. Such vehicles cooperatively disseminate decoy traffic without affecting safety-critical operations: with 50% of vehicles as relaying vehicles, the probability of linking pseudonyms (for the entire interval) drops from 68% to 18%. On average, this imposes 28 ms extra computation overhead, per second, on the Roadside Units (RSUs) and 4.67 ms extra computation overhead, per second, on the (relaying) vehicle side; it also introduces 1.46 KB/sec extra communication overhead by (relaying) vehicles and 45 KB/sec by RSUs for the dissemination of decoy traffic. Thus, user privacy is enhanced at the cost of low computation and communication overhead.