A Multi-Secret Reputation Adjustment Method in the Secret Sharing for Internet of Vehicles

A Multi-Secret Reputation Adjustment Method in the Secret Sharing for Internet of Vehicles
复制标题

车联网秘密共享中的多秘密信誉调整方法

DOI:
10.1155/2022/1413976
复制
发表时间:
2022-05
影响因子:
--
通讯作者:
Jingbang Wu;Xiyu Chen;Luyuan Zhang;Shufen Zhou;Daoshun Wang
Jingbang Wu;Xiyu Chen;Luyuan Zhang;Shufen Zhou;Daoshun Wang
中科院分区:
计算机科学4区
文献类型:
--
作者:
Jingbang Wu;Xiyu Chen;Luyuan Zhang;Shufen Zhou;Daoshun Wang

文献摘要

相似文献

车联网(IoV)的安全数据共享在发展智能城市和智能交通方面引起了广泛关注。实现这一点的一种方法是基于参与车辆的声誉以及它们之间的交互。大多数信誉调整方案都是针对单秘密的情况,存在重构后共享信息泄露的情况,并且所有参与者的共享信息需要再次更新。本文利用二元非对称多项式实现秘密的异步重构,即一次分发多个秘密,每个秘密在恢复时相互独立。每个参与者持有一个变量多项式的共享划分信息部分。当秘密被重构时,共享信息部分不被直接示出,以确保共享信息不被泄露。此外,我们提供了另一种方法来保持秘密不变,并修改秘密阈值。
Secure data sharing for the Internet of Vehicles (IoV) has drawn much attention in developing smart cities and smart transportation. One way to achieve that is based on the reputation of the participant vehicles and the interaction between them. Most of the reputation adjustment schemes are aimed at single-secret situations, and there are cases where shared information leaks after reconstruction; and the shared information of all participants need to be updated again. This paper uses binary asymmetric polynomials to realize the asynchronous reconstruction of secrets, that is, multiple secrets are distributed at once, and each secret is independent of each other when it is restored. Each participant holds the shared divided information part of a one-variable polynomial. When the secret is reconstructed, the shared information part is not directly shown to ensure that the shared information is not leaked. Furthermore, we provide another way to keep the secret unchanged and modify the secret threshold.