OVERVIEW OF BLAKLEYS SECRET SHARING SCHEME
You can find the report published on Arxiv at this link.
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.
- 1- Secret-Sharing Schemes Jim Royer
- 2- Secret Sharing and Key Escrow Richard Newman
- 3- Secret Sharing Schemes A Cryptographic Application of Finite Projective Geometry - Kiah Han Mao
- 4- Secret Sharing Schemes
- 5- Safeguarding cryptographic keys - G. R. BLAKLEY
- 6- Secret-Sharing Schemes: A Survey - Amos Beimel
- 7- Threshold Cryptography Based on Blakley Secret Sharing - Ilker Nadi Bozkurt, et.al
- 8- Two Matrices for Blakley’s Secret Sharing Scheme - Xiali Hei, et. al.
- 9- Secret Sharing Schemes and their Applications - Giorgio Zanin
The programming language for this repository is Matlab. It is possible to implement that in other languages as well.
Three files are used in this project, two of them are related to the Graphical User Interface and one of them is the test one in Matlab. Blakley.m is the main file for the Secret Sharing Scheme. Later, this file is used in the GUI Blakley_GUI.m
The sample figure of this GUI is shown here:
If you find the code or the article useful, please cite our paper using this BibTeX:
@article{shamsoshoara2019overview,
title={Overview of Blakley's Secret Sharing Scheme},
author={Shamsoshoara, Alireza},
journal={arXiv preprint arXiv:1901.02802},
year={2019}
}