Font Size: a A A

Research On The Secret Sharing Scheme Of Non - Trusted Distributors

Posted on:2016-07-17Degree:MasterType:Thesis
Country:ChinaCandidate:M LiFull Text:PDF
GTID:2278330479991666Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
As an ideal cryptography technology for storing information, secret sharing schemes can spread the risk of centralized storage and achieve the purpose of intrusion tolerance. As a result, secret sharing schemes are widely used in many cryptography applications, and have become a significant research field of information security. Multiple secrets can be shared in one process in a multi-secret sharing scheme. Comparing with traditional secret sharing schemes, multi-secret sharing schemes are more efficient. It usually needs a trusted dealer to distribute shares among participants in multi-secret sharing schemes. However, the dealer might be a bottleneck in the scenarios where a mutually trusted party is not available. Although many researches on multi-secret sharing have been done, it is still a challenge to construct a multi-secret sharing scheme without a trusted dealer. In order to overcome this challenge, two no trusted dealer verifiable multi-secret sharing schemes with novel properties are proposed in this paper:(1) A no trusted dealer verifiable multi-secret sharing scheme with secure reconstruction is proposed in this paper. The scheme has the following advantages:(i) A mutually trusted dealer is no longer needed to distribute shares;(ii) shares can be verified by shareholders both in the secret generation and reconstruction phases; and( iii) any adversary without providing a valid share cannot recover the real secrets in the secret reconstruction phase. The security of the proposed scheme is analyzed, and the comparison among the proposed scheme and some other schemes is also given.(2) A no trusted dealer verifiable multi-secret sharing scheme based on cellular automata is proposed in this paper. The linear computational property of cellular automata makes it possible to build a scheme without the assistance of a trusted dealer, and the parallel computational property contributes to the high efficiency of the scheme. Hash function is adopted to realize the verification of shares, which also makes the scheme more efficient. Security analysis and comparison are stated.As a conclusion, there is a summary of all the work in this paper and the areas worth researching.
Keywords/Search Tags:secret sharing, no trusted dealer, secure reconstruction, cellular automata, hash function
PDF Full Text Request
Related items