On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme-Reference-Cited by-同舟云学术

On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme

Published:2018-10 Issue: Volume:463-464 Page:75-85
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Drăgan Constantin Cătălin,Tiplea Ferucio Laurentiu^ORCID

Funder

European Social Fund

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference10 articles.

1. A modular approach to key safeguarding;Asmuth;IEEE Trans. Inf. Theory,1983

2. Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes;Barzu;Inf. Sci. (Ny),2013

3. Elements of Information Theory;Cover,2006

4. Chinese Remainder Theorem. Applications in Computing, Coding, Cryptography;Ding,1996

5. Distributive weighted threshold secret sharing schemes;Drăgan;Inf. Sci. (Ny),2016

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

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

2. An effective revocable and traceable public auditing scheme for sensor-based urban cities;Journal of King Saud University - Computer and Information Sciences;2023-04

3. Practical Secret Image Sharing Based on the Chinese Remainder Theorem;Mathematics;2022-06-07

4. Asymptotically ideal Chinese remainder theorem ‐based secret sharing schemes for multilevel and compartmented access structures;IET Information Security;2021-04-20

5. Grouped Secret Sharing Schemes Based on Lagrange Interpolation Polynomials and Chinese Remainder Theorem;Security and Communication Networks;2021-04-03