## CryptoDB

### Paper: Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem

Authors: Yu Ning Fuyou Miao Wenchao Huang Keju Meng Yan Xiong Xingfu Wang DOI: 10.1007/978-3-030-03332-3_12 Search ePrint Search Google Slides ASIACRYPT 2018 Since (t, n)-threshold secret sharing (SS) was initially proposed by Shamir and Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and Bloom presented a (t, n)-threshold SS scheme based on the Chinese Remainder Theorem (CRT) for integers in 1983. However, compared with the most popular Shamir’s thresholdtn SS scheme, existing CRT based schemes have a lower information rate, moreover, they are harder to construct due to the stringent condition on moduli. To overcome these shortcomings of CRT based schemes, (1) we first propose a generalized (t, n)-threshold SS scheme based on the CRT for polynomial ring over a finite field. We show that our scheme is ideal, i.e., it is perfect in security and has the information rate 1. Comparison show that our scheme has a better information rate and is easier to construct compared with the existing threshold SS schemes based on the CRT for integers. (2) We prove that Shamir’s scheme, which is based on the Lagrange interpolation, is a special case of our scheme. Therefore, we establish the connection among threshold schemes based on the Lagrange interpolation, schemes based on the CRT for integers and our scheme. (3) As a natural extension of our threshold scheme, we present a weighted threshold SS scheme based on the CRT for polynomial rings, which inherits the above advantages of our threshold scheme over existing weighted schemes based on the CRT for integers.
##### BibTeX
@inproceedings{asiacrypt-2018-29193,
title={Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem},
booktitle={Advances in Cryptology – ASIACRYPT 2018},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={11274},
pages={310-331},
doi={10.1007/978-3-030-03332-3_12},
author={Yu Ning and Fuyou Miao and Wenchao Huang and Keju Meng and Yan Xiong and Xingfu Wang},
year=2018
}