Author:
Dehkordi Masoud Hadian,Farzaneh Yousof
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Computer Science Applications
Reference18 articles.
1. Benaloh, J., & Leichter, J. (1989). Generalized secret sharing and monotone functions. Proceedings of advances in cryptology-CRYPTO’88, LNCS (Vol. 403, p. 213222). Heidelberg: Springer.
2. Blakley, G. R. (1979). Safeguarding cryptography keys. In Proceedings of the AFIPS 1979 National Computer Conference (pp. 313317).
3. Chor, B., Goldwasser, S., Micali, S., & Awerbuch, B. (1985). Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (pp. 251–260).
4. Das, A., & Adhikari, A. (2010). An efficient multi-use multi-secret sharing scheme based on hash function. Applied Mathematics Letters, 23, 993–996.
5. Feldman, P. (1987). A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science (pp. 427–437). IEEE.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献