On the design and security of a lattice-based threshold secret sharing scheme

In this paper, we introduce a method of threshold secret sharing scheme (tsss) in which secret reconstruction is based on babai's nearest plane algorithm. in order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. a solution to this problem can be utilization of lattice-based cryptosystems for these channels which requires designing lattice-based tssss. we investigate the effect of lattice dimension on the security and correctness of the proposed scheme. moreover, we prove that for a fixed lattice dimension the proposed scheme is asymptotically correct. we also give a quantitative proof of security from information theoretic viewpoint.