MULTI-IMAGE SECRET SHARING BASED ON POB BASED SECRET SHARING SCHEME

Authors

  • Ann Jisna James Department of Computer Engineering P.C.C.O.E,Pune
  • Prof.Reena Kharat Department of Computer Engineering P.C.C.O.E,Pune

Keywords:

Secret sharing,Permutation Ordered Binary (POB)

Abstract

Secret sharing refers to the process of splitting a secret such that n number of shares are formed out of it ,this
ensures that the recovery of secret is only possible if qualified subset is present.Such encryption make the data secure
with minimal amount of attacks as a single share can not reveal any information. The earliest successful attempt in this
arena was made by Adi Shamir and George Blakely who implemented this method successfully for threshold scheme
,since then a steady advancement has been observed ,the latest schemes are implementable on multimedia frameworks
for generating shares and ensuring privacy of the data.This paper attempts a survey on different schemes and their
advancement.It focuses on the POB number system based secret sharing scheme introduced by A. Sreekumar and
Sundar,which follows an n out of n scheme in which n number of shares are generated from a secret and the values in
these shares are converted to respective POB values.

Published

2018-03-25

How to Cite

Ann Jisna James, & Prof.Reena Kharat. (2018). MULTI-IMAGE SECRET SHARING BASED ON POB BASED SECRET SHARING SCHEME. International Journal of Advance Engineering and Research Development (IJAERD), 5(3), 1273–1276. Retrieved from https://ijaerd.org/index.php/IJAERD/article/view/2904