Space efficient secret sharing for implicit data security

Authors:
Abhishek Parakh;Subhash Kak
Affiliations:
Computer Science Department, Oklahoma State University, Stillwater, OK 74078, USA;Computer Science Department, Oklahoma State University, Stillwater, OK 74078, USA
Venue:
Information Sciences: an International Journal
Year:
2011

Citing 18
Cited 3

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Distributed fingerprints and secure information dispersal

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Secret sharing made short

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure distributed storage and retrieval

Theoretical Computer Science
How to share a secret

Communications of the ACM
The architecture of robust publishing systems

ACM Transactions on Internet Technology (TOIT)
Recursive hiding of secrets in visual cryptography

Cryptologia
On-Line Secret Sharing

Proceedings of the 5th IMA Conference on Cryptography and Coding
Generalized Secret Sharing and Group-Key Distribution using Short Keys

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Responsive Security for Stored Data

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Robust computational secret sharing and a unified account of classical secret-sharing goals

Proceedings of the 14th ACM conference on Computer and communications security
New efficient and practical verifiable multi-secret sharing schemes

Information Sciences: an International Journal
Schneier's Cryptography Classics Library: Applied Cryptography, Secrets and Lies, and Practical Cryptography

Schneier's Cryptography Classics Library: Applied Cryptography, Secrets and Lies, and Practical Cryptography
Online data storage using implicit security

Information Sciences: an International Journal
General short computational secret sharing schemes

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Strong (n,t,n) verifiable secret sharing scheme

Information Sciences: an International Journal
A new scheme of key distribution using implicit security in wireless sensor networks

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Secret sharing schemes from binary linear codes

Information Sciences: an International Journal

Recursive hiding of biometrics-based secret sharing scheme using adversary structure

Information Processing Letters
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures

Information Sciences: an International Journal
Defending collaborative false data injection attacks in wireless sensor networks

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

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.