Citation: | MIAO Fuyou, FAN Yuanyuan, WANG Xingfu, et al., “A (t,m,n)-Group Oriented Secret Sharing Scheme,” Chinese Journal of Electronics, vol. 25, no. 1, pp. 174-178, 2016, doi: 10.1049/cje.2016.01.026 |
A. Shamir, “How to share a secret”, Communications of the ACM, Vol.22, No.11, pp.612-613, 1979.
|
G.R. Blakley, “Safeguarding cryptographic keys”, International Workshop on Managing Requirements Knowledge, pp.313-313, 1899.
|
Massey James L, “Minimal codewords and secret sharing”, Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp.276-279, 1993.
|
M. Mignotte, “How to share a secret”, Cryptography, pp.371- 375, 1983.
|
C. Asmuth and J. Bloom, “A modular approach to key safeguarding”, IEEE Transactions on Information Theory, Vol.30, No.2, pp.208-210, 1983.
|
M.L. Das, A. Saxena and V.P. Gulati, “A dynamic ID-based remote user authentication scheme”, Consumer Electronics, IEEE Transactions on, Vol.50, No.2, pp.629-631, 2004.
|
B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, “Verifiable secret sharing and achieving simultaneously in the presence of faults”, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp.383-395, 1985.
|
Lein Harn, “Secure secret reconstruction and multi-secret sharing schemes with unconditional security”, Security and Communication Networks, Vol.7, No.3, pp.567-573, 2014.
|
J.C. Benaloh, “Secret sharing homomorphisms: Keeping shares of a secret secret”, Advances in Cryptology-CRYPTO'86, pp.251-260, 1987.
|
W.A. Jackson and K.M. Martin, “Combinatorial models for perfect secret sharing schemes”, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol.28, pp.249-265, 1998.
|
C.C. Yang, T.Y. Chang and M.S. Hwang, “A (t, n) multisecret sharing scheme”, Applied Mathematics and Computation, Vol.151, No.2, pp.483-490, 2004.
|
L. Harn, “Group authentication”, IEEE Transactions on Computers, Vol.62, No.9, pp.1893-1898, 2013.
|