Abstract
General secret sharing schemes comprise a secret dealer and a number of participants. The dealer can randomly generate a secret and then distribute shares of the secret to the participants. Verifiable multi-secret sharing enables a dealer to share multiple secrets among a group of participants such that the deceptive behaviors of the dealer and the participants can be detected. However, in the absence of secure channels, few verifiable secret sharing schemes can simultaneously share multiple secrets at one time. In this paper, we present an information privacy protection and verifiable multi-secret sharing scheme with a simple structure and high security. Each participant can verify correctness of the share distribution process based on public information published by the dealer and guarantee validity of the received share to avoid offering fake information in the process of restoring the original secret. Our performance and security analysis indicate that the newly proposed scheme is more efficient and practical while maintaining the same level of security compared with similar protocols available.
Highlights
Information privacy protection has become an important issue in the field of information security, and secret sharing is a promising technology among privacy protection schemes
PROPOSED SCHEME we present an information privacy protection scheme based on verifiable (t, n) threshold multi-secret sharing scheme
In the view of the above shortcomings, this paper proposed a verifiable (t, n) threshold multi-secrets sharing scheme based on the difficulty of discrete logarithm, which has the following properties: 1) it can prevent cheating between dealer and participants; 2) it does not need to maintain the secure channel in the secret distribution, so that the scheme can be applied in the system where there is no secure channel; 3) It realizes the sharing of multi-secrets in parallel through one-time secret sharing process; 4) it allows participants to reuse their shares in different rounds of multi-secret sharing
Summary
Information privacy protection has become an important issue in the field of information security, and secret sharing is a promising technology among privacy protection schemes. Lin and Wu [8] propose a (t, n) threshold verifiable multi-secret sharing scheme, which is designed based on mathematical difficulties in cryptography. One situation is that the dealer can distribute some false shares to the participants, and the other is that malicious participants deliberately provide false shares to other participants, both of which can result in the secret being unable to be rebuilt successfully To overcome these drawbacks, several verifiable secret sharing schemes have been proposed in [13]–[17] to resist dishonest dealer or malicious participants. Sheikhi-Garjan et al [19] proposed the threshold verifiable multi-secret sharing based on elliptic curves and Chinese remainder theorem The challenge of this scheme is to solve equations.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
