Overview of Blakley's Secret Sharing Scheme

01/09/2019
by   Alireza Shamsoshoara, et al.
0

In this report, I explained the problem of Secret Sharing Scheme. Then based on the definition of the problem, two old methods: Blakley's Secret Sharing Scheme and Shamir's Secret Sharing are introduced. However, we explained the details of the first one since it's the topic of this work. Blakley's method has an application in distributing a key between different parties and reconstructing the key based on each share. However, this method is not efficient enough because of too large space states. Also, we tried to simulate a scenario for spreading a key between some users and tried to reconstruct the first key using Matlab in a graphical user interface.

READ FULL TEXT
research
03/31/2020

Yet another insecure group key distribution scheme using secret sharing

A recently proposed group key distribution scheme known as UMKESS, based...
research
09/10/2019

Crucial and Redundant Shares and Compartments in Secret Sharing

Secret sharing is the well-known problem of splitting a secret into mult...
research
09/03/2022

Quantum Advantage of Threshold Changeable Secret Sharing Scheme

In TCSS (Threshold Changeable Secret Sharing) scheme, the threshold can ...
research
09/29/2018

A Randomized Kernel-Based Secret Image Sharing Scheme

This paper proposes a (k,n)-threshold secret image sharing scheme that o...
research
11/30/2020

Extremal Set Theory and LWE Based Access Structure Hiding Verifiable Secret Sharing with Malicious Majority and Free Verification

Secret sharing allows a dealer to distribute a secret among several part...
research
09/02/2023

Manifesting Unobtainable Secrets: Threshold Elliptic Curve Key Generation using Nested Shamir Secret Sharing

We present a mechanism to manifest unobtainable secrets using a nested S...

Please sign up or login with your details

Forgot password? Click here to reset