An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem (Revised Version) - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Yun Zhang, Christophe Tartary, Huaxiong Wang. An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem (Revised Version). IACR Cryptology ePrint Archive, 2011:392, 2011. [doi]

The following publications are possibly variants of this publication:

An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder TheoremYun Zhang, Christophe Tartary, Huaxiong Wang. acisp 2011: 259-275 [doi]

Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder TheoremYu Ning, Fuyou Miao, Wenchao Huang, Keju Meng, Yan Xiong, Xingfu Wang. asiacrypt 2018: 310-331 [doi]

Constructing Ideal Secret Sharing Schemes based on Chinese Remainder TheoremYu Ning, Fuyou Miao, Wenchao Huang, Keju Meng, Yan Xiong, Xingfu Wang. iacr, 2018:837, 2018. [doi]

A new threshold changeable secret sharing scheme based on the Chinese Remainder TheoremXingxing Jia, Daoshun Wang, Daxin Nie, Xiangyang Luo, Jonathan Zheng Sun. isci, 473:13-30, 2019. [doi]

A Threshold Secret Sharing Scheme Based on LMCA and Chinese Remainder TheoremDianjun Lu, Yu Wang, Xiaoqin Zhang, Lanfen Ji. iscid 2016: 439-442 [doi]

runs on WebDSL