Verifiable secret sharing based on the Chinese remainder theorem-Reference-Cited by-同舟云学术

Verifiable secret sharing based on the Chinese remainder theorem

Author:

Harn Lein¹,Fuyou Miao²,Chang Chin-Chen³⁴

Affiliation:

1. Department of Computer Science and Electrical Engineering; University of Missouri; Kansas City MO U.S.A.

2. School of Computer Science and Technology; University of Science & Technology of China; China

3. Department of Information Engineering and Computer Science; Feng Chia University; Taichung 407 Taiwan

4. Department of Computer Science and Information Engineering; Asia University; Taichung 413 Taiwan

Publisher

Wiley

Subject

Computer Networks and Communications,Information Systems

Link

Reference17 articles.

1. How to share a secret;Shamir;Commun. Assoc. Comp. Mach.,1979

2. A modular approach to key safeguarding;Asmuth;IEEE Transactions on Information Theory,1983

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On modular (CRT-based) secret sharing;Journal of Computer Virology and Hacking Techniques;2024-07-01

3. A Verifiable Secret Sharing Scheme using Elliptic Curve Cryptography;2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT);2023-07-06