CFP last date
15 April 2024
Reseach Article

Implementation of Shamir�s Secret Sharing on Proactive Network

by Saria Islam, A. S. M Mahmudul Hasan
International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 6 - Number 2
Year of Publication: 2013
Authors: Saria Islam, A. S. M Mahmudul Hasan
10.5120/ijais13-451003

Saria Islam, A. S. M Mahmudul Hasan . Implementation of Shamir�s Secret Sharing on Proactive Network. International Journal of Applied Information Systems. 6, 2 ( September 2013), 17-22. DOI=10.5120/ijais13-451003

@article{ 10.5120/ijais13-451003,
author = { Saria Islam, A. S. M Mahmudul Hasan },
title = { Implementation of Shamir�s Secret Sharing on Proactive Network },
journal = { International Journal of Applied Information Systems },
issue_date = { September 2013 },
volume = { 6 },
number = { 2 },
month = { September },
year = { 2013 },
issn = { 2249-0868 },
pages = { 17-22 },
numpages = {9},
url = { https://www.ijais.org/archives/volume6/number2/524-1003/ },
doi = { 10.5120/ijais13-451003 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T17:59:33.364524+05:30
%A Saria Islam
%A A. S. M Mahmudul Hasan
%T Implementation of Shamir�s Secret Sharing on Proactive Network
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 6
%N 2
%P 17-22
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

For most cryptosystems, by using a single-system master key there is a need to protect many important encryption and decryption keys used to achieve data security. There are three major drawbacks under this single-master key arrangement. First, if the master key is disclosed to the public by accident, then the entire system has no secrecy at all. Second, if the master key is lost, then all the keys under protection become inaccessible. Third, if the owner of the master key becomes disloyal, then all important information becomes completely available to the opponents. The secret sharing scheme was designed to overcome these problems. Shamir's (t, n)-threshold scheme is one of the most well-known examples of secret sharing schemes which provides a very simple and efficient way to share a secret among any t of the n participants. The primary goal of our research is to study the terminology and protocols behind secret sharing schemes and implement Shamir's scheme using Java. In addition, we have also introduced a new scheme for extending the Shamir's scheme on proactive network.

References
  1. Fredrik Olsson, "A Lab System for Secret Sharing", 2004.
  2. N. Ferguson & B. Schneier. Practical Cryptography. 2003, pp. 358-360.
  3. R. Anderson, R. Needham & A. Shamir. "The Steganographic File System. " in D. Aucsmith (ed. ) Information Hiding. Second International Workshop. 1998, pp. 73-82.
  4. Lidong Zhou. Secret Sharing. Secret Sharing. Retrieved August 01, 2013, from http://www. cs. cornell. edu/courses/cs513/2000sp/SecretSharing. html
  5. Secret Sharing Scheme. Retrived Auguest 02, 2013, from http://www. jetico. com/web_help/bc8/html/08_1_new_key_generator/03_SSS. htm
  6. A. Shamir, How to share a secret, Communications of the ACM 22 (1979), 612-613.
  7. What is "Secret Sharing"? Retrived Auguest 02, 2013, from http://point-at-infinity. org/ssss/
  8. V. Nikov, S. Nikova. On Proactive Secret Sharing Schemes, SAC'04, LNCS 3357, 2004, pp. 314-331.
Index Terms

Computer Science
Information Sciences

Keywords

Cryptography Secret Sharing Shamir's secret sharing scheme Proactive Secret Sharing Implementation of Shamir's Secret Sharing