A New Secure Distributed Storage Scheme for Cloud-Mathematical Designs and Implementation

Hou Teng Cheong Pui Ching Middle School, Macau Chih Wei Tan Pui Ching Middle School, Macau

S.-T. Yau High School Science Awarded Papers mathscidoc:1608.35134

Dongrun-Yau Science Award, 2013
In this report, we have mainly developed an abstract framework of k bit (t,n) secret sharing framework for cloud storage. Such framework is clean and it can be implemented. A successful implementation of the framework would provide users with protection when the system is under the attack on its confidentiality,integrity and reliability. Furthermore, such system has its own encryption by using permutations and tailor made error detection, location and data rescue. We make use of Lagrange polynomials and take the advantages of the algebraic property “t distinct points on the plane can uniquely determine a polynomial function of degree t-1” to design a k bit (t,n) -secret sharing distributed storage. We employ the set with unique factorization property (UFP) so that we simply need to calculate the y intercept of a Lagrange polynomial and then use a look up table to recover a secret.Moreover, the set which has minimum UFP would help us to design storage with smallest containers. In addition to the algebraic methods, we can utilize the geometric facts that three non collinear points determine a unique circle and four non coplanar points determine a unique sphere to construct k bit (3,n) and k bit (4,n) secret sharing storage respectively. To generalize to arbitrary case, it is straight forward if we have defined the Haar measure on the higher dimensional unit sphere. The last method is an application of Chinese Remainder Theorem (CRT) and we have designed k bit (t,n) secret sharing distributed storage and one of the designs can produce containers with the half size of the original secret. However, such k is no longer unrestricted and it has to be chosen from an interval. We have developed a C program for implementing both algebraic, geometric k bit (3,n) secret sharing distributed storages as well as the CRT method. The performances of both algebraic and geometric designs are satisfactory in term of processing time and compressed container size. The container size is even half of the size of the original secret in the CRT case and it is also very speedy.
No keywords uploaded!
[ Download ] [ 2016-08-18 13:32:13 uploaded by yauawardadmin ] [ 599 downloads ] [ 0 comments ]
  title={A New Secure Distributed Storage Scheme for Cloud-Mathematical Designs and Implementation},
  author={Hou Teng Cheong, and Chih Wei Tan},
  booktitle={Dongrun-Yau Science Award},
Hou Teng Cheong, and Chih Wei Tan. A New Secure Distributed Storage Scheme for Cloud-Mathematical Designs and Implementation. 2013. In Dongrun-Yau Science Award. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20160818133213900211226.
Please log in for comment!
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved