对可验证秘密共享方案的研究数学应用数学专业论文.docxVIP

AbstractKey Abstract Key management is one of the important cryptographic problems．Linear threshold scheme and visual cryptography scheme provide two different methods to solve problem of secret sharing．This dissertation devotes to the related problems of secret sharing and the main contributions are listed as follows： (1)While the dealer is not on—line in a(尼，n)-threshold scheme，assume t(t≥1)new participants want to share the secret，there exists a problem to distribute shares to new participants．This paper adopts the(尼，n+f)scheme transformed from old(克，n)scheme based on Lagrange interpolation in which k out of n old participants will function as the dealer to distribute new shares to t new participants．The scheme achieves the distribution of searet to t new participants．k out of拧+t shares can reconstruct the secret and less than k shares will get no information about the secret． (2)Typical publicly verifiable secret sharing schemes rely on a dealer to distribute shares．However，there may be cheating action from the dealer which distributes an inconsistent secret to participants．In order to prevent cheating action from the dealer，two publicly verifiable secret sharing are presented based on the Chinese Remainder Theorem and Lagrange interpolation separately without the dealer substituded by刀participants to jointly generate shared secret and to distribute their shares．ElGamal cryptosystem is used to encrypt transmitted information．The public verification is realized by utilizing zero—knowledge proof． (3)Existing multi—threshold multi—secret sharing schemes need private channel to transmit information．Their shares can not be selected by the dealer instead of participants．The verification can not preventing the cheating action from the dealer distributing an inconsistent secret to participants．Because of the high cost to protect private channel，an improved scheme is proposed in II this this paper．The information is encrypted using the RSA cryptosystem SO that the