Strongly secure ramp secret sharing with more participants based on Reed-Solomon codes

摘要

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.