A(t, m, n)-Group Oriented Secret Sharing Scheme

查看全文 作　　者：MIAO [1]Fuyou;FAN [1]Yuanyuan;WANG [1]Xingfu;XIONG [1]Yan;Moaman [1]Badawy

机构地区：[1]School of Computer Science and Technology, University of Science and Technology of China

出　　处：《Chinese Journal of Electronics》索引2016年第25卷第1期,共5页

基　　金：supported by the National Natural Science Foundation of China(No.61232018,No.61572454,No.61272472,No.61472382) 摘　　要：Basic(t, n)-Secret sharing(SS) schemes share a secret among n shareholders by allocating each a share. The secret can be reconstructed only if at least t shares are available. An adversary without a valid share may obtain the secret when more than t shareholders participate in the secret reconstruction. To address this problem, the paper introduces the notion and gives the formal definition of(t, m, n)-Group oriented secret sharing(GOSS); and proposes a(t, m, n)-GOSS scheme based on Chinese remainder theorem. Without any share verification or user authentication, the scheme uses Randomized components(RC) to bind all participants into a tightly coupled group, and ensures that the secret can be recovered only if all m(m ≥ t) participants in the group have valid shares and release valid RCs honestly. Analysis shows that the proposed scheme can guarantee the security of the secret even though up to m-1 RCs or t-1 shares are available for adversaries. Our scheme does not depend on any assumption of hard problems or one way functions. 关键词：秘密分享导向中国剩余定理 RCS 秘密共享面向群体共享验证参与者

相关文献

参考文献（12）
引证文献（2）
耦合文献（0）

参考文献(12)

引证文献(2)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

A(t, m, n)-Group Oriented Secret Sharing Scheme

参考文献(12)

引证文献(2)

用户提示