Secret sharing scheme based on hashing

TL;DR

This paper introduces an adaptive multi-secret sharing scheme using cryptographically secure hash functions, offering enhanced security features and lower computational complexity compared to traditional finite field-based schemes.

Contribution

The paper presents a novel hash-based secret sharing scheme that is perfect, ideal, verifiable, proactive, and computationally efficient.

Findings

Scheme is perfect and ideal

Scheme is verifiable and proactive

Lower computational complexity than finite field schemes

Abstract

We propose an adaptive threshold multi secret sharing scheme based solely on cryptographically secure hash functions. We show that the proposed scheme is also: perfect, ideal, verifiable, and proactive. Moreover the proposed scheme has a low computational complexity comparing to the most common schemes operating over finite fields.