New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system

Secret sharing was proposed primarily in 1979 to solve the problem of key distribution. In recent decades, researchers have many improvement schemes. Among all these schemes, verifiable multi-secret (VMSS) schemes are studied sufficiently, which share multiple secrets simultaneously and perceive malicious dealer as well participants. By pointing out that presented by Dehkordi Mashhadi 2008 cannot detect some vicious behaviors dealer, we propose two new VMSS adding validity check verification phase overcome this drawback. Our based on XTR public system, can realize GF(p6) security computations GF(p2) without explicit constructions GF(p6), where p is a prime. Compared with using RSA linear feedback shift register (LFSR) cryptosystems, achieve same level shorter parameters trace function. What's more, our much simpler operate than those Elliptic Curve Cryptography (ECC). addition, dynamic threshold changeable, means it efficient implement when participants, or needs be changed.