KEY DISTRIBUTION USING GRAPHS FOR SECRET SHARING

KEY DISTRIBUTION USING GRAPHS FOR SECRET SHARING

R. Malhotra, N. Chandramowliswaran

[PDF]

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.

Keywords

Key Distribution, Chinese Remainder Theorem, Asymmetric Graph, Strongly co-prime integers, Graceful Labelling