Space efficient secret sharing for implicit data security

Abhishek Parakh, Subhash Kak

Research output: Contribution to journalArticle

37 Citations (Scopus)

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

Data Security
Secret Sharing
Security of data
Sensor networks
Interpolation
Polynomials
Optimal Bound
Polynomial Interpolation
Sensor Networks
Denote
Data security
Secret sharing
World Wide Web

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

Space efficient secret sharing for implicit data security. / Parakh, Abhishek; Kak, Subhash.

In: Information Sciences, Vol. 181, No. 2, 15.01.2011, p. 335-341.

Research output: Contribution to journalArticle

Parakh, Abhishek ; Kak, Subhash. / Space efficient secret sharing for implicit data security. In: Information Sciences. 2011 ; Vol. 181, No. 2. pp. 335-341.
@article{067f1f5070d2460087b9337edf72b837,
title = "Space efficient secret sharing for implicit data security",
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.",
keywords = "Computational security, Data partitioning, Implicit security, Information dispersal, Recursive secret sharing",
author = "Abhishek Parakh and Subhash Kak",
year = "2011",
month = "1",
day = "15",
doi = "10.1016/j.ins.2010.09.013",
language = "English (US)",
volume = "181",
pages = "335--341",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "2",

}

TY - JOUR

T1 - Space efficient secret sharing for implicit data security

AU - Parakh, Abhishek

AU - Kak, Subhash

PY - 2011/1/15

Y1 - 2011/1/15

N2 - 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.

AB - 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.

KW - Computational security

KW - Data partitioning

KW - Implicit security

KW - Information dispersal

KW - Recursive secret sharing

UR - http://www.scopus.com/inward/record.url?scp=78049326546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049326546&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2010.09.013

DO - 10.1016/j.ins.2010.09.013

M3 - Article

VL - 181

SP - 335

EP - 341

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 2

ER -