Communications of the ACM
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On Sharing Many Secrets (Extended Abstract)
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Elliptic Curves: Number Theory and Cryptography
Elliptic Curves: Number Theory and Cryptography
Secret image sharing with steganography and authentication
Journal of Systems and Software
A practical verifiable multi-secret sharing scheme
Computer Standards & Interfaces
Improvements of image sharing with steganography and authentication
Journal of Systems and Software
A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps
ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Sharing secrets in stego images with authentication
Pattern Recognition
Secret image sharing based on cellular automata and steganography
Pattern Recognition
Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC
Wireless Personal Communications: An International Journal
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
Hi-index | 0.00 |
In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participants in such a way that any t (or more) of them can reconstruct the secrets while a group of (t 驴 1) can not obtain any information. Therefore, when such schemes are used to distribute sensitive information over a network, fault tolerance property is achieved since even if n 驴 t of the nodes go out of function, the remaining t nodes suffice to recover the information. In 2009, Wang et al. proposed a verifiable (t, n)-threshold multi-secret sharing scheme (WTS) based on elliptic curves in which the secrets can change periodically [Wireless Pers. Commun., Springer-Verlage, doi: 10.1007/s11277-009-9875-0] . In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme based on bilinear maps. Our scheme does not require a secure channel and participants can verify the shares pooled in the reconstruction phase. Our proposed scheme is multi-use such that in order to change the secrets, it is sufficient to renew some public information. Furthermore, the proposed scheme is flexible to the threshold value. Therefore, our proposed scheme has all the merits of (WTS), however, we achieve two major improvements. First when the secrets are to be changed, we require to publish fewer public values. This reduction can be very important in certain applications such as steganographic use of secret sharing schemes. The second is that (WTS) is designed with the assumption that the number of secrets (m) is equal to the threshold t so that the case m t is handled by repeating the scheme $${\left\lceil \frac{m}{t}\right\rceil}$$ times. However, in designing the scheme we do not assume any restrictions on the number of secrets.