Communications of the ACM
Secret Sharing with Reusable Polynomials
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
The GH Public-Key Cryptosystem
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
A practical verifiable multi-secret sharing scheme
Computer Standards & Interfaces
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Electronic Notes in Theoretical Computer Science (ENTCS)
A multiple-level visual secret-sharing scheme without image size expansion
Information Sciences: an International Journal
An efficient threshold verifiable multi-secret sharing
Computer Standards & Interfaces
New efficient and practical verifiable multi-secret sharing schemes
Information Sciences: an International Journal
A novel secret image sharing scheme in color images using small shadow images
Information Sciences: an International Journal
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A novel secret image sharing scheme for true-color images with size constraint
Information Sciences: an International Journal
A novel efficient (t,n) threshold proxy signature scheme
Information Sciences: an International Journal
A verifiable multi-secret sharing scheme based on cellular automata
Information Sciences: an International Journal
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
Linear multi-secret sharing schemes based on multi-party computation
Finite Fields and Their Applications
Securing communications between external users and wireless body area networks
Proceedings of the 2nd ACM workshop on Hot topics on wireless network security and privacy
| Hi-index | 5.23 |
In verifiable multi-secret sharing schemes (VMSSs), many secrets can be shared but only one share is kept by each user and this share is verifiable by others. In this paper, we propose two secure, efficient, and verifiable (t,n) multi-secret sharing schemes, namely Scheme-I and Scheme-II. Scheme-I is based on the Lagrange interpolating polynomial and the LFSR-based public key cryptosystem. The Lagrange interpolating polynomial is used to split and reconstruct the secrets and the LFSR-based public key cryptosystem is employed to verify the validity of the data. Scheme-II is designed according to the LFSR sequence and the LFSR-based public key cryptosystem. We compare our schemes with the state-of-the-art in terms of attack resistance, computation complexity, and so on, and conclude that our schemes have better performance and incur less computation overhead. Our schemes can effectively detect a variety of forgery or cheating actions to ensure that the recovery of the secrets is secure and creditable, and the length of the private key is only one third of that of others for the same security level.