New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system
Jing Yang, Fang-Wei Fu

TL;DR
This paper introduces two new verifiable multi-secret sharing schemes based on the XTR public key system, offering enhanced security, simplicity, and flexibility over existing schemes using RSA, LFSR, or ECC.
Contribution
The paper proposes novel VMSS schemes utilizing XTR cryptography with added validity checks, improving security, efficiency, and adaptability compared to prior methods.
Findings
Achieve GF(p^6) security via GF(p^2) computations without explicit GF(p^6) construction.
Shorter parameters for same security level compared to RSA and LFSR-based schemes.
Schemes are simpler, dynamic, and threshold changeable, facilitating practical implementation.
Abstract
Secret sharing was proposed primarily in 1979 to solve the problem of key distribution. In recent decades, researchers have proposed many improvement schemes. Among all these schemes, the verifiable multi-secret sharing (VMSS) schemes are studied sufficiently, which share multiple secrets simultaneously and perceive malicious dealer as well as participants. By pointing out that the schemes presented by Dehkordi and Mashhadi in 2008 cannot detect some vicious behaviors of the dealer, we propose two new VMSS schemes by adding validity check in the verification phase to overcome this drawback. Our new schemes are based on XTR public key system, and can realize security by computations in without explicit constructions of , where is a prime. Compared with the VMSS schemes using RSA and linear feedback shift register (LFSR) public key cryptosystems, our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
