Space Efficient Secret Sharing

TL;DR

This paper introduces a space-efficient secret sharing scheme that maps multiple secrets into shares of the same size, optimizing storage compared to traditional methods that handle one secret at a time.

Contribution

The proposed method allows multiple secrets to be shared simultaneously with space efficiency, unlike conventional schemes that are less efficient for multiple secrets.

Findings

Supports sharing multiple secrets with equal-sized shares

Achieves space efficiency by mapping k secrets into n shares

Can be configured with n=k for optimal space use

Abstract

This note proposes a method of space efficient secret sharing in which k secrets are mapped into n shares (n>=k) of the same size. Since, n can be chosen to be equal to k, the method is space efficient. This method may be compared with conventional secret sharing schemes that divide a single secret into n shares.