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

Volume: 26, Issue: 5, Pages: 705 - 709
Published: May 1, 2019
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...
Paper Details
Title
On the Security of Secret Sharing Over a Ring and the Fast Implementation
Published Date
May 1, 2019
Volume
26
Issue
5
Pages
705 - 709
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.