Dissertation > Industrial Technology > Radio electronics, telecommunications technology > Communicate > Confidentiality of communications and communications security > Theory

Study of several secret sharing scheme

Author ChenYangKui
Tutor YuJia
School Qingdao University
Course Computer Software and Theory
Keywords Secret sharing Publicly verifiable Homogeneous Linear Recursion Cellular Automata
CLC TN918.1
Type Master's thesis
Year 2011
Downloads 12
Quotes 0
Download Dissertation

The secret sharing is an important means to protect information and data , it is mainly used to protect important information and data in order to prevent the loss of important information , destruction and tampering . Secret sharing has become an important branch of cryptography research , is also an important research direction in information security content . This paper first introduces the status quo , and then in several safe and effective secret sharing scheme based on secret sharing . The main work is reflected in the following aspects : publicly verifiable secret sharing is a special kind of secret sharing , the secret share not only be distributed by the distributor share holders own validation , and validation can be any other members . However, the general can publicly verifiable secret sharing adversary might use a very long time to break the threshold share server to obtain secret . To solve this problem , a proactive ability publicly verifiable secret sharing scheme , not only to publicly verify the correctness of the share and share regularly updated nature , which makes the program than other general public verifiability secret sharing scheme is more secure, and better able to meet the security needs of the various applications . Proposed a new multi - secret sharing scheme based on homogeneous linear recursion , then expanded into a verifiable program . Secret distribution process , just released a few public parameters , secret reconstruction process , each member only needs to provide pseudo- share will not expose the secret share when the secret change without redistribution of secret shares , to achieve multiple use of the secret share . The proposed program has a secret share can be used several times , publicly parameters and to reconstruct the polynomial number of small advantages , which makes the program more efficient , and better able to meet the demand for a variety of applications . A no -confidence center multi - secret sharing scheme based on the principle of cellular automata , and multi - secret sharing scheme of cellular automata , the share of the distribution does not require the distributor to participate , to meet the not been distributed by the case can also be achieved in the distribution of the secret shares , which makes such a program can be obtained wider applications .

Related Dissertations
More Dissertations