论文标题

ZK-pot:零知识的流量证明启用了合作感

zk-PoT: Zero-Knowledge Proof of Traffic for Privacy Enabled Cooperative Perception

论文作者

Tao, Ye, Jiang, Yuze, Lin, Pengfei, Tsukada, Manabu, Esaki, Hiroshi

论文摘要

合作感是一种必不可少的且广泛讨论的连接自动化车辆的应用。但是,无法确保感知数据的真实性,因为车辆无法独立验证他们没有看到的事件。已经提出了许多方法,包括基于信任的(即统计)方法和基于合理的方法来确定数据真实性。但是,如果没有先验知识,这些方法将无法验证数据。在这项研究中,提出了一种从目标车辆数量板构建自我保护数据的新方法。通过将化名和数字板作为共享的秘密,并让多个车辆证明他们是独立的,可以将数据真实问题转变为加密问题,该问题可以解决而无需信任或合理性评估。我们的工作可以适应现有的作品,包括ETSI/ISO的标准,同时保持向后兼容。对所提出方法的常见攻击和攻击的分析表明,可以防止大多数攻击,而防止其他攻击(例如勾结攻击)可以缓解。基于现实数据集的实验表明,成功验证的速率可以在高峰时段达到70 \%至80 \%。

Cooperative perception is an essential and widely discussed application of connected automated vehicles. However, the authenticity of perception data is not ensured, because the vehicles cannot independently verify the event they did not see. Many methods, including trust-based (i.e., statistical) approaches and plausibility-based methods, have been proposed to determine data authenticity. However, these methods cannot verify data without a priori knowledge. In this study, a novel approach of constructing a self-proving data from the number plate of target vehicles was proposed. By regarding the pseudonym and number plate as a shared secret and letting multiple vehicles prove they know it independently, the data authenticity problem can be transformed to a cryptography problem that can be solved without trust or plausibility evaluations. Our work can be adapted to the existing works including ETSI/ISO ITS standards while maintaining backward compatibility. Analyses of common attacks and attacks specific to the proposed method reveal that most attacks can be prevented, whereas preventing some other attacks, such as collusion attacks, can be mitigated. Experiments based on realistic data set show that the rate of successful verification can achieve 70\% to 80\% at rush hours.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源