Space efficient secret sharing for implicit data security

Abhishek Parakh, Subhash Kak

Research output: Contribution to journalArticle

41 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)335-341
Number of pages7
JournalInformation Sciences
Volume181
Issue number2
DOIs
StatePublished - Jan 15 2011

    Fingerprint

Keywords

  • Computational security
  • Data partitioning
  • Implicit security
  • Information dispersal
  • Recursive secret sharing

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this