KEY DISTRIBUTION USING GRAPHS FOR SECRET SHARING

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 sch...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 11 - Special Issue; no. Jaem Vol 11 - Special Issue, 2021; p. 63
Main Authors Malhotra, R, Chandramowliswaran, N
Format Journal Article
LanguageEnglish
Published Istanbul Elman Hasanoglu 01.01.2021
Subjects
Graph theory
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2146-1147