Preprint Article Version 1 This version is not peer-reviewed

Strongly Secure Ramp Secret Sharing with More Participants based on Reed-Solomon Codes

Version 1 : Received: 7 May 2019 / Approved: 8 May 2019 / Online: 8 May 2019 (09:50:23 CEST)

How to cite: Matsumoto, R. Strongly Secure Ramp Secret Sharing with More Participants based on Reed-Solomon Codes. Preprints 2019, 2019050088 Matsumoto, R. Strongly Secure Ramp Secret Sharing with More Participants based on Reed-Solomon Codes. Preprints 2019, 2019050088

Abstract

The number of participants in the McEliece-Sarwate strongly secure ramp secret sharing scheme is at most $q-L$, where $q$ is the size of each share and $L$ is the number of symbols in the secret. We propose another construction of strongly secure ramp secret sharing that can support $q$ participants also based on the Reed-Solomon codes.

Subject Areas

ramp secret sharing; strong security; Reed-Solomon code

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.