On Novel Verifiable Multi-Secret Sharing Scheme
In this paper, we analyze two improved YCH schemes and one multi-secret sharing scheme that is based on homogeneous linear recursion, and further based on Shamir secret sharing we propose a verifiable multi-secret sharing model, whose time complexity of secret reconstruction is O(k × t 2) and is superior to the other two improved YCH models (O(t 3)(t > k)O(k 3)(t ≤ k), O(k × n + k 2), and that the secret reconstruction time in simulations is even less than the other three models. We compare the advantages and disadvantages of the four models in the time complexity, the verifiability, the security, and the other aspects. When n > k, the required number of open values of the new model are fewer than the numbers of the other three models. The simulations show that the new model behaves better than the other three models in saving time to distribute and reconstruct secrets.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Publication date: 2011-11-01
More about this publication?
- ADVANCED SCIENCE LETTERS is an international peer-reviewed journal with a very wide-ranging coverage, consolidates research activities in all areas of (1) Physical Sciences, (2) Biological Sciences, (3) Mathematical Sciences, (4) Engineering, (5) Computer and Information Sciences, and (6) Geosciences to publish original short communications, full research papers and timely brief (mini) reviews with authors photo and biography encompassing the basic and applied research and current developments in educational aspects of these scientific areas.
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites