International Journal of Security and Its Applications
Vol.8, No.6 (2014), pp.295-302
http://dx.doi.org/10.14257/ijsia.2014.8.6.26
ISSN: 1738-9976 IJSIA
Copyright ⓒ 2014 SERSC
A Secret Sharing Scheme Based on AES
Jie Cui, Lei Chen, Yiming Zhang, Zhiqiang Xie and Hong Zhong*
School of Computer Science and Technology, Anhui University, Hefei, China
cvjxabcd@126.com
Abstract
In order to solve the key setting difficulty and the key security problem in the file
encryption, key distributed storage technology may be a proper choice to help improve the
safety of the key. In the paper, a novel secret sharing scheme is proposed by AES encryption
algorithm for file confidentiality, dynamic key generation mechanism to generate keys, multi-
secret-sharing ideas on key pre-treatment, using Shamir threshold scheme for secret
dispersed storage. Finally, a few tests are carried out and the test results suggest that the
efficiency of the whole scheme is good.
Keywords: AES, secret sharing, Rijndael, file security
1. Introduction
With the rapid development of computer and network communication technology, the
information security, meanwhile, has become increasingly prominent, and events such as
information leaks and other incidents happen more frequently nowadays. Cryptography
provides many practical techniques to solve information security problems. In order to
guarantee security and confidentiality of the private documents, people mainly resort to
encryption to protect files, and make it impossible for users who do not have a key to steal
information. This makes the security and confidentiality mainly hinges on the security key,
thus an effective method of key management is needed. In recent years, the key dispersed
storage technology has become a trend in key management. It helps to solve the problem that
the key text can not be decrypted caused by losing or forgetting the key. What is more, the
application in the field of computer and network security will be of significance both in
theory and practice.
The first secret sharing scheme is (t, n) threshold secret sharing scheme, which is proposed
independently by Blakley [1] and Shamir [2] in 1979. On that basis, Shamir’s scheme, which
is based on the theory of polynomials, is easy to understand and implement, and catch more
attention of researchers. On the one hand, it solves on the problem of the original threshold
scheme, on the other hand, it can be applied to other fields extensively. The threshold scheme
provides a good way to improve other technologies. For example, Zhang, et al., [3] adopted
the combination technology of Shamir scheme and cloud storage technology to construct a
secure network disc. Xu, et al., [4] resolved copyright issues on digital media, and the
threshold scheme and broadcast encryption algorithm are combined to construct the identity-
based broadcast encryption scheme. In the literature [5], the threshold scheme was used to
protect software copyrights, copyright information, enhanced anti-aggression and
survivability and other issues. In the literature [6], an existing Watermarking Algorithms and
(t, n) threshold were adopted for the copyright watermark sharing, and the improved
algorithm had good security and anti-attack capability. In the literature [7], security forensics
and Shamir threshold scheme were integrated to improve the security of the forensic