A Modified Shamir Secret Sharing Scheme With Efficient Encoding
Allyson Hineman, Mario Blaum
Abstract
The Shamir secret sharing (SSS) scheme requires a Maximum Distance Separable (MDS) code, and in its most common implementation, a Reed-Solomon (RS) code is used. In this letter, we observe that the encoding procedure can be made simpler and faster by dropping the MDS condition and specifying the possible symbols that can be shared. In particular, the process can be made even faster by using array codes based on exclusive-or (XOR) operations instead of RS codes.
Topics & Concepts
Secret sharingComputer scienceEncoding (memory)Homomorphic secret sharingScheme (mathematics)Shamir's Secret SharingTheoretical computer scienceCode (set theory)ArithmeticSeparable spaceBitwise operationAlgorithmMathematicsCryptographyProgramming languageArtificial intelligenceMathematical analysisSet (abstract data type)Coding theory and cryptographyAdvanced Data Storage TechnologiesCryptography and Data Security