Key distribution using graphs for secret sharing

Abstract

Key distribution for secret sharing is the core important aspect of any secure cryptosystem, the threshold scheme enables a secret key to be shared among p members in which each member holds a part of the secret key. In recent years, many works have been done on constructing (t + 1, l) threshold schemes using different algebraic aspects of the mathematics. In this paper, we discuss certain aspects of key sharing using Graph Theory and Strongly co-prime integers to present techniques which manage the sharing of keys equally amongst the users keeping the security of the system intact.