TY - JOUR TI - Group-oriented secret sharing using Shamir's algorithm DO - https://doi.org/doi:10.7282/T3K077G6 PY - 2018 AB - In the current state of highly distributed and hybrid-cloud systems environment, managing and securing enterprise or government systems/data requires effective access control techniques and protocols. Currently, individual and independent logins using single or multi-factor passwords are widely used across the industry, but they are highly vulnerable to hacking, phishing and various password stealth techniques. For securing highly sensitive IT assets, comprehensive data management and governance programs include group-oriented login or authorization procedures, wherein a group of individuals or processes (as opposed to a single individual) provide their credentials/passwords or keys to gain access to the sensitive resource. To implement the group-oriented login, a widely acclaimed cryptographic technique, Secret Sharing, offers an elegant and secure solution. In this technique, the secret (password) is divided into multiple shares in such a way that a threshold number of shares are essential to reconstruct the secret (password). Shamir’s Secret Sharing uses this cryptographic technique, and the Secret Share splitting and reconstruction are based on a polynomial over a finite field. The goal of this thesis is to study and evaluate this technique with reference to threshold based group-login by various examples. KW - Computer Science KW - Computer security LA - eng ER -