MIAO Fuyou, FAN Yuanyuan, WANG Xingfu, XIONG Yan, Moaman Badawy. A (t,m,n)-Group Oriented Secret Sharing Scheme[J]. Chinese Journal of Electronics, 2016, 25(1): 174-178. doi: 10.1049/cje.2016.01.026
Citation: MIAO Fuyou, FAN Yuanyuan, WANG Xingfu, XIONG Yan, Moaman Badawy. A (t,m,n)-Group Oriented Secret Sharing Scheme[J]. Chinese Journal of Electronics, 2016, 25(1): 174-178. doi: 10.1049/cje.2016.01.026

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

doi: 10.1049/cje.2016.01.026
Funds:  This work is supported by the National Natural Science Foundation of China (No.61232018, No.61572454, No.61272472, No.61472382).
  • Received Date: 2014-04-01
  • Rev Recd Date: 2014-05-20
  • Publish Date: 2016-01-10
  • 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 (mt) 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.
  • loading
  • A. Shamir, “How to share a secret”, Communications of the ACM, Vol.22, No.11, pp.612-613, 1979.
    G.R. Blakley, “Safeguarding cryptographic keys”, International Workshop on Managing Requirements Knowledge, pp.313-313, 1899.
    Massey James L, “Minimal codewords and secret sharing”, Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp.276-279, 1993.
    M. Mignotte, “How to share a secret”, Cryptography, pp.371- 375, 1983.
    C. Asmuth and J. Bloom, “A modular approach to key safeguarding”, IEEE Transactions on Information Theory, Vol.30, No.2, pp.208-210, 1983.
    M.L. Das, A. Saxena and V.P. Gulati, “A dynamic ID-based remote user authentication scheme”, Consumer Electronics, IEEE Transactions on, Vol.50, No.2, pp.629-631, 2004.
    B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, “Verifiable secret sharing and achieving simultaneously in the presence of faults”, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp.383-395, 1985.
    Lein Harn, “Secure secret reconstruction and multi-secret sharing schemes with unconditional security”, Security and Communication Networks, Vol.7, No.3, pp.567-573, 2014.
    J.C. Benaloh, “Secret sharing homomorphisms: Keeping shares of a secret secret”, Advances in Cryptology-CRYPTO'86, pp.251-260, 1987.
    W.A. Jackson and K.M. Martin, “Combinatorial models for perfect secret sharing schemes”, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol.28, pp.249-265, 1998.
    C.C. Yang, T.Y. Chang and M.S. Hwang, “A (t, n) multisecret sharing scheme”, Applied Mathematics and Computation, Vol.151, No.2, pp.483-490, 2004.
    L. Harn, “Group authentication”, IEEE Transactions on Computers, Vol.62, No.9, pp.1893-1898, 2013.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (194) PDF downloads(418) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return