Novel space efficient secret sharing for implicit data security

In 2011, Parakh and Kak proposed a space efficient secret sharing for implicit data security using repeated polynomial interpolation. (Information sciences, vol. 181, 2011, pp.335–341.) However, we found that their scheme cannot provide verification, which is very important in secret sharing. Moreover, we present a novel space efficient secret sharing for implicit data security, which has the same advantages as PK scheme, as well as having verification property, anti-assault property, anti-cheating property and dynamic property.