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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Analyzing Extended Secret Sharing Schemes based on Share Size

by Suvarna S. Thube, Sonali Patil
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 118 - Number 23
Year of Publication: 2015
Authors: Suvarna S. Thube, Sonali Patil
10.5120/20889-3667

Suvarna S. Thube, Sonali Patil . Analyzing Extended Secret Sharing Schemes based on Share Size. International Journal of Computer Applications. 118, 23 ( May 2015), 40-44. DOI=10.5120/20889-3667

@article{ 10.5120/20889-3667,
author = { Suvarna S. Thube, Sonali Patil },
title = { Analyzing Extended Secret Sharing Schemes based on Share Size },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 118 },
number = { 23 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 40-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume118/number23/20889-3667/ },
doi = { 10.5120/20889-3667 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:02:33.509079+05:30
%A Suvarna S. Thube
%A Sonali Patil
%T Analyzing Extended Secret Sharing Schemes based on Share Size
%J International Journal of Computer Applications
%@ 0975-8887
%V 118
%N 23
%P 40-44
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Secret sharing is the technique in which secret is distributed among n participants. Each participant has unique secret share. Secret can be recovered only after sufficient number of shares (k out of n) combined together. In many circumstances secret sharing has to provide additional capabilities to satisfy certain requirements. Such capabilities include proactive redistribution of shares, verifiability of the shares, robustness against cheating shareholders and general access structure. In this paper various secret sharing schemes are discussed and critically analysed with the strengths and weaknesses introduced into these schemes on the basis of additional features, storage space, share size.

References
  1. Adi Shamir, "How to share a secret", Communication of the ACM, Volume 22, No. 11, PP. 612- 613, Nov 1979.
  2. G. R. Blakey, "Safeguarding Cryptographic Keys", Proceedings of National Computer Conference, American Federation of Information, 1979.
  3. Thien and Lin, "Secret image sharing", Computers and Graphics, Volume. 26, No. 5, PP. 765-770, 2002.
  4. Li Bai, "A Strong Ramp Secret Sharing Scheme Using Matrix Projection", IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2006.
  5. Li Bai ,"A Reliable (k, n) Image Secret Sharing Scheme", IEEE International Symposium on Dependable, Autonomic and Secure Computing, 2006.
  6. A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, "Proactive Secret Sharing Or: How to Cope with Perceptual Leakage", Springer- Verlag, 1998.
  7. Saria Islam, A. S. M. Mahmudul Hasan, "Implementation of Shamir's Secret Sharing on Proactive Network", International Journal of Applied Information Systems, Volume 6- No. 2, Sep 2013.
  8. Li Bai, XuKai Zou, "A Proactive Secret Sharing Scheme in Matrix Projection Method", International Journal of Security and Networks, Volume. 4, No. 4, PP. 201-209, 2009.
  9. J. C. Benaloh, "Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret", Proceedings of CRYPTO86 Springer, Berlin, PP. 251260, 1986.
  10. P. Feldman, "A practical scheme for non-interactive verifiable secret sharing", IEEE Symposium on Foundations of Computer Science, PP. 427437, 1987.
  11. Z. Wang et. al. , "Sharing a Secret Image in Binary Images with Verification", Journal of Information Hiding and Multimedia Signal Processing, Volume 2, No. 1, Jan 2011.
  12. Sonali Patil, P. Deshmukh, "Verifiable Image Secret Sharing in Matrix Projection Using Watermarking", International conference on Circuits, Systems, Communication and Information Technology Applications, IEEE, 2014.
  13. J. Benaloh, J. Leichter. "Generalized Secret Sahring and Monotone Functions", Springer- Verlag, 1998.
  14. Sonali Patil, Prashant Deshmukh, "General Access Structure Secret Sharing in Matrix Projection", International Journal of Computer Applications, Volume 107, No. 13, Dec 2014.
  15. L. Harn, C. Lin, "Detection and identification of cheaters in (t, n) secret sharing scheme", Springer Science + Business Media, Designs, Codes and Cryptography, Volume 52, PP. 15-24, 2009.
  16. Rong Zhao, Jian-jie Zhao, Fang Dai, Feng-qun Zhao, A new image secret sharing scheme to identify cheaters, Computer Standards and Interfaces 31, pp. 252257, 2007.
  17. Sonali Patil, Prashant Deshmukh, "Image Secret Sharing with Identification of Cheaters", IEEE International Conference on Advances in Engineering &Technology Research (ICAETR - 2014), Aug 2014.
  18. Sonali Patil, Prashant Deshmukh, "An Explication of Multifarious Secret Sharing Schemes", International Journal of Computer Applications, volume. 46, no. 19, pp. 6-10, 2012.
Index Terms

Computer Science
Information Sciences

Keywords

General access structure Secret Sharing Proactive redistribution Verifiability.

Powered by PhDFocusTM