On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
From MaRDI portal
Publication:2198255
DOI10.1016/j.ins.2018.06.046zbMath1440.94092MaRDI QIDQ2198255
Ferucio Laurenţiu Ţiplea, Constantin Cătălin Drăgan
Publication date: 9 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.06.046
entropy; Chinese remainder theorem; secret sharing scheme; asymptotic idealness; asymptotic perfectness
94A62: Authentication, digital signatures and secret sharing