Space efficient secret sharing for implicit data security

This paper presents a k-threshold computational secret sharing technique that distributes a secret S into shares of size | S | k - 1 , where ∣ S∣ denotes the secret size. This bound is close to the space optimal bound of | S | k if the secret is to be recovered from k shares. In other words, our tec...

Full description

Saved in:
Bibliographic Details
Published inInformation sciences Vol. 181; no. 2; pp. 335 - 341
Main Authors Parakh, Abhishek, Kak, Subhash
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.01.2011
Subjects
Computation
Computational security
Computer information security
Data partitioning
Implicit security
Information dispersal
Recursive secret sharing
Data partitioning
Recursive secret sharing
Implicit security
Computational security
Information dispersal
Online AccessGet full text

Cover

More Information
Summary:This paper presents a k-threshold computational secret sharing technique that distributes a secret S into shares of size | S | k - 1 , where ∣ S∣ denotes the secret size. This bound is close to the space optimal bound of | S | k if the secret is to be recovered from k shares. In other words, our technique can be looked upon as a new information dispersal scheme that provides near optimal space efficiency. The proposed scheme makes use of repeated polynomial interpolation and has potential applications in secure information dispersal on the Web and in sensor networks.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2010.09.013