Communications of the ACM
An iterative error-free algorithm to solve Vandermonde systems
Applied Mathematics and Computation
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
Discrete Mathematics
Secret Sharing with Reusable Polynomials
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
A practical verifiable multi-secret sharing scheme
Computer Standards & Interfaces
Multiuser-based shadow watermark extraction system
Information Sciences: an International Journal
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Electronic Notes in Theoretical Computer Science (ENTCS)
Threshold cryptography based on Asmuth-Bloom secret sharing
Information Sciences: an International Journal
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
A novel efficient (t,n) threshold proxy signature scheme
Information Sciences: an International Journal
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
Linear multi-secret sharing schemes based on multi-party computation
Finite Fields and Their Applications
Online data storage using implicit security
Information Sciences: an International Journal
Recursive secret sharing for distributed storage and information hiding
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
A verifiable multi-secret sharing scheme based on cellular automata
Information Sciences: an International Journal
Strong (n,t,n) verifiable secret sharing scheme
Information Sciences: an International Journal
Secret sharing schemes from binary linear codes
Information Sciences: an International Journal
Space efficient secret sharing for implicit data security
Information Sciences: an International Journal
An ideal multi-secret sharing scheme based on MSP
Information Sciences: an International Journal
Efficient (n, t, n) secret sharing schemes
Journal of Systems and Software
Verifiable multi-secret sharing based on LFSR sequences
Theoretical Computer Science
Information Sciences: an International Journal
| Hi-index | 0.07 |
In 2006, Zhao et al. proposed a practical verifiable multi-secret sharing based on Yang et al.'s and Feldman's schemes. In this paper we propose two efficient, computationally secure (t,n), and verifiable multi-secret sharing schemes based on homogeneous linear recursion. The first scheme has the advantage of better performance, a new simple construction and various techniques for the reconstruction phase. The second scheme requires fewer public values with respect to Zhao et al.'s and Shao and Cao schemes. These schemes are easy to implement and provide great capabilities for many applications.