Loading [a11y]/accessibility-menu.js
On the Security of Secret Sharing Over a Ring and the Fast Implementation | IEEE Journals & Magazine | IEEE Xplore

On the Security of Secret Sharing Over a Ring and the Fast Implementation


Abstract:

Secret sharing is the method to share secrets among a group of shares, and the secret can be reconstructed if one obtains a predefined number of shares. The polynomial se...Show More

Abstract:

Secret sharing is the method to share secrets among a group of shares, and the secret can be reconstructed if one obtains a predefined number of shares. The polynomial secret sharing is usually constructed over a field. In this letter, a novel polynomial secret sharing over a ring is proposed. In particular, by choosing a certain ring, the fast Fourier transform can be applied on the encoding of secret sharing. The analysis shows that the proposed secret sharing scheme requires O(N log2 N) Boolean operations per secret bit, which improves the prior result O(8log* NN log2 N) Boolean operations per secret bit. The simulation shows that the proposed scheme is in average four times faster than the conventional approach.
Published in: IEEE Signal Processing Letters ( Volume: 26, Issue: 5, May 2019)
Page(s): 705 - 709
Date of Publication: 25 March 2019

ISSN Information:

Funding Agency:


References

References is not available for this document.