Web-based Secret Sharing And Its Applications

Secret sharing scheme plays an important role in Key Management. With the development of the informationization all over the world, a secret sharing scheme based on computer networks becomes a new technology. The network technology changing with each passing day, it is a hotspot to build a secret sharing scheme depending on the distributed networks systems. People go in for a practical and feasible multiple keys sharing scheme in the face of the augment of keys scale. Therefore ,we propose a threshold multiple keys sharing scheme based on computer networks.To realize the multiple keys sharing in asynchronous distributed networks, the superiority of which lies in the concurrency of messages' sending, receiving and reserving in critical sections. According to the problems mentioned moment, three conclusions are advised as follows:(1)A scheme of asynchronous verifiable multiple keys sharing(AVMKS) and a proposal of refreshing are presented based on the security of ECC and TCP port of the servers in asynchronous distributed networks. In addition, a new method is presented to restore the secret based on the solution of algebraic equations, which is different from Lagrange interpolating polynomial and NIST digital signature scheme and also improves its efficiency.(2)A new electronic voting scheme for a large scale election activity is given based on the AVMKS scheme. Even if there exist up to t adaptive adversaries, this scheme can guard the ballots' producing, encrypting, transmitting, decrypting and final tally in spite of the adversaries's attack.(3)A method of Identification Authentication of the members in AVMKS scheme is presented based on XTR.When the method is used to prevent the blackmailer in electronic cash,the valid successful possibility of which improves one sixth.