An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry

Abstract

Secret sharing has numerous applications in cryptography field and distributed computing. Threshold secret allotment scheme has been well considered a lot for the last three decades and proposed many such efficient schemes. The main objective of allotment sharing scheme is to deliver the secret to some parties so that only desirable subsets of the parties can get back the secrets whereas secret cannot be leaked by other parties. Nowadays, an ideal scheme shares multiple secrets with perfect security is of high demand. In this paper, we have designed a multi-secret sharing scheme on the basis of geometry in Galois field. The scheme is ideal, perfect without information leakage.