- 期刊
A Joint Random Secret Sharing Scheme with Public Verifiability
並列摘要
In this paper, we propose a joint random secret sharing scheme with public verifiability. It is practical in distributed environment. Utilizing additive homomorphism, a random secret will be corporately constructed by some participants, which avoids the need for a mutually trusted dealer. In addition, we explore the technique of homomorphic verification and that of bilinear pairing to allow each participant to publicly verify whether the received shares are consistent. The verification process in our scheme is unconditionally secure and non-interactive without using Fiat-Shamir technique or any additional zero knowledge proof, which is simple and higher efficient compared with previously known. Lastly, as an applied example of our work, we present how our techniques can be applied to handle dynamic node-join in mobile ad hoc network.
延伸閱讀
- Ulutas, M. (2010). Meaningful Share Generation for Increased Number of Secrets in Visual Secret-Sharing Scheme. Mathematical Problems in Engineering, 2010(), 978-995-158. https://doi.org/10.1155/2010/593236
- Pieprzyk, J., & Zhang, X. M. (2006). Ideal Secret Sharing Schemes from Permutations. International Journal of Network Security, 2(3), 238-244. https://doi.org/10.6633/IJNS.200605.2(3).09
- Peng, Q., & Tian, Y. L. (2016). A Publicly Verifiable Secret Sharing Scheme Based on Multilinear Diffie-Hellman Assumption. International Journal of Network Security, 18(6), 1192-1200. https://doi.org/10.6633/IJNS.201611.18(6).20
- Tsai, H. C. (2008). Problems of Perfect Multi-Secret Sharing Schemes [master's thesis, National Chi Nan University]. Airiti Library. https://doi.org/10.6837/NCNU.2008.00243
- Chen, X., Liu, Y., Chang, C. C., & Guo, C. (2014). Generalized Secret Sharing with Linear Hierarchical Secrets. International Journal of Network Security, 16(6), 411-419. https://doi.org/10.6633/IJNS.201411.16(6).02