CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A Python based Approach to Enhance Security using Secret Sharing Scheme

by Siyaram Gupta, Madhu Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 89 - Number 11
Year of Publication: 2014
Authors: Siyaram Gupta, Madhu Sharma
10.5120/15673-4421

Siyaram Gupta, Madhu Sharma . A Python based Approach to Enhance Security using Secret Sharing Scheme. International Journal of Computer Applications. 89, 11 ( March 2014), 4-7. DOI=10.5120/15673-4421

@article{ 10.5120/15673-4421,
author = { Siyaram Gupta, Madhu Sharma },
title = { A Python based Approach to Enhance Security using Secret Sharing Scheme },
journal = { International Journal of Computer Applications },
issue_date = { March 2014 },
volume = { 89 },
number = { 11 },
month = { March },
year = { 2014 },
issn = { 0975-8887 },
pages = { 4-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume89/number11/15673-4421/ },
doi = { 10.5120/15673-4421 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:08:56.587658+05:30
%A Siyaram Gupta
%A Madhu Sharma
%T A Python based Approach to Enhance Security using Secret Sharing Scheme
%J International Journal of Computer Applications
%@ 0975-8887
%V 89
%N 11
%P 4-7
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Privacy of the information is one of the major issues in digital world. However it is responsibility of the owner of the information to secure it from disclosure and unauthorized access. The main motivation behind this protocol is to ensures individual privacy along with integrity of the information. To achieve such security requirements a sharing scheme formally known as secret sharing scheme is proposed. According to this well-known (k, n) threshold scheme at-least k shareholders must gather to regenerate the secret [2]. The Lagrange interpolation polynomial used to construct the shares for participants [3] in this proposed concept. Secret sharing is a method for distributing a piece of secrets amongst a group of individuals, each of which is allotted some share related to the secret. The secret can only be reconstructed according to its threshold value. Python is used to implement the concept of secret sharing scheme because of its ease of use and huge collection of functions, libraries and modules. It is easy to generate and use polynomials using python.

References
  1. Medical image security and EPR hiding using Shamir's secret sharing scheme, Mustafa Ulutas, Güzin Ulutas?, Vasif V. Dept. Of Computer Engineering, Karadeniz Technical University, 61080 Trabzon, Turkey.
  2. A. Shamir, How to share a secret, Communications of the ACM 22 (11) (1979) 612–613.
  3. A practical verifiable multi-secret sharing scheme. Jianjie Zhao, Jianzhong Zhang, Rong Zhao. College of Mathematics and Information Science, Shaanxi Normal University, Xi'an 710062, People's Republic of Chin b Natural Science Institute, Xi'an University of Technology, Xi'an 710048, People's Republic of China.
  4. G. Blakley, Safeguarding cryptographic keys, Proc AFIPS 1979 National Computer Conference, AFIPS Press, New York, 1979, pp. 313–317.
  5. J. He, E. Dawson, Multisecret-sharing scheme based on one-way function, Electronics Letters 31 (2) (1995) 93–95.
  6. C. -C. Yang, T. -Y. Chang, M. -S. Hwang, A (t, n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490.
  7. B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, Proc. 26th IEEE Symp. FOCS, 1985, pp. 251–260.
  8. L. Harn, Efficient sharing (broadcasting) of multiple secret, Computers and Digital Techniques 142 (3) (1995) 237–240.
  9. J. Shao, Z. -F. Cao, A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme, Applied Mathematics and Computation 168 (2005) 135–140.
  10. R. -J. Hwang, C. -C. Chang, An on-line secret sharing scheme for multisecrets, Computer Communications 21 (13) (1998) 1170–1176.
  11. H. -Y. Chien, J. -K. Tseng, A practical (t,n) multi-secret sharing scheme, IEICE Transactions on Fundamentals of Electronics, Communications and Computer 83-A (12) (2000) 2762–2765.
  12. J. He, E. Dawson, Multistage secret sharing based on one-way function, Electronics Letters 30 (19) (1994) 1591–1592.
Index Terms

Computer Science
Information Sciences

Keywords

Cryptography Secret sharing Polynomials Python.

Powered by PhDFocusTM