Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference47 articles.
1. Bagherpour B., Zaghian A., Sajadieh M.: Sigma protocols for faster proof of simultaneous homomorphism relations. IET Inf. Secur. 13, 508–814 (2019).
2. Blakley G.R.: Safeguarding cryptographic keys. AFIPS Nat1 Comput. Conf. 48, 313–317 (1979).
3. Chen L., Gollmann D., Mitchell C., Wild P.: Secret Sharing with Reusable Polynomials, Information Security and Privacy, pp. 183–193. Springer, Berlin (1997).
4. Chor B., Goldwasser S., Micali S., Awerbuch B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, pp. 383–395. FOCS’ 85 IEEE Computer Society, Washington (1985).
5. Das A., Adhikari A.: An efficient multi-use multi-secret sharing scheme based on hash function. Appl. Math. Lett. 23, 993–996 (2010).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献