ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Reducing file size and time complexity in secret sharing based document protection | JoVE Visualize

Home
Research Domains
Information And Computing Sciences

Reducing file size and time complexity in secret sharing based document protection

Yan-Xiao Liu¹, Ya-Ze Zhang¹, Ching-Nung Yang²

¹Department of Computer Science and Engineering, XI'AN University of Technology, XI'AN, China.

Mathematical Biosciences and Engineering : MBE|September 11, 2019

View abstract on PubMed

Summary

This study enhances secret sharing for document protection. The new scheme reduces share size and speeds up document reconstruction by combining inner codes and using a larger finite field.

Area of Science:

* Computer Science
* Information Security
* Cryptography

Background:

* Secret sharing schemes enable secure data distribution.
* Tu and Hsu proposed a document protection scheme using Shamir's (k,n) secret sharing.
* Their method encrypts documents into shares linked to a cover document.

Purpose of the Study:

* To improve upon the Tu-Hsu secret sharing document protection scheme.
* To reduce the size of encrypted shares.
* To enhance the efficiency of share generation and document reconstruction.

Main Methods:

* Developed a novel document protection scheme extending Tu-Hsu's work.
* Combined two inner codes into one double-byte inner code.
* Employed computation in GF(65537), a Fermat Prime, for share generation.

Main Results:

* Achieved a reduction in share size compared to the Tu-Hsu scheme.
* Reduced the number of inner codes by half.
* Demonstrated significant improvements in running time for share generation and reconstruction.

Conclusions:

* The proposed scheme offers a more efficient and compact solution for secret sharing-based document protection.
* The use of larger finite fields and code combination effectively addresses limitations of previous methods.
* This advancement contributes to more practical and performant data security solutions.

Keywords:

Data Management And Data Science

Recommender Systems

Reducing File Size And Time Complexity In Secret Sharing Based Document Protection

document protection