Communications of the ACM
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
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
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
New efficient and practical verifiable multi-secret sharing schemes
Information Sciences: an International Journal
Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves
Computer Communications
An ideal multi-secret sharing scheme based on MSP
Information Sciences: an International Journal
Verifiable multi-secret sharing based on LFSR sequences
Theoretical Computer Science
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 | 0.00 |
In 2004, C.-C. Yang, T.-Y. Chang and M.-S. Hwang proposed an efficient multi-secret sharing scheme based on two-variable one-way function and Shamir's secret sharing. In order to add the verifiable property into previous scheme, J. Shao and Z. Cao proposed an efficient (t,n) verifiable multi-secret sharing based on YCH [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) pp. 483-490.] in 2005. Both of the previous schemes need a secure channel. This paper presents a verifiable multi-secret sharing based on YCH, intractability of Discrete Logarithm (DL) and RSA cryptosystem. In our scheme each participant chooses her/his shadow by her/himself and there is not any need to a secure channel. In addition, compared with Shao and Cao scheme, verifiable property is more efficient in our scheme.