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

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.