JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2015, Vol. 50 ›› Issue (05): 7-11.doi: 10.6040/j.issn.1671-9352.0.2014.379

Previous Articles     Next Articles

Communication rate in the secret reconstruction phase

ZHANG Ben-hui1, TANG Yuan-sheng2, CHEN Wen-bing2   

  1. 1. School of Mathematical Science, Huaibei Normal University, Huaibei 235000, Anhui, China;
    2. School of Mathematical Science, Yangzhou University, Yangzhou 225002, Jiangsu, China
  • Received:2014-08-20 Online:2015-05-20 Published:2015-05-29

PDF (PC)

1182

Abstract: Communication rate is an extremely important concept in the field of secret sharing. It was proved that the communication rate ρ=v/((v+t-l)l) of the ideal (t,n)-threshold secret sharing scheme constructed by the existing solution couldn't meet the bound. Based on this scheme, an improved reconstruction algorithm was proposed and a higher communication rate ρ'=v/((t-l)(t-1)+tv)(≥ρ) was figured out. The result proves that ρ' is greater than the lower bound 1/t and can achieve the upper bound v/(t+v-1) when l=t+v-1.

Key words: secret sharing, reconstruction algorithm, communication rate

CLC Number: 

  • TP309
[1] SHAMIR A. How to share a secret[J]. Communications of the ACM, 1979, 22(11):612-613.
[2] BLAKLEY G R. Safeguarding cryptographic key[C]//Proceedings of AFIPS National Computer Conference. New York: AFIPS, 1979, 48:313-317.
[3] 张本慧, 陈文兵, 唐元生. 基于签密的可验证向量空间多秘密共享方案[J]. 合肥工业大学学报:自然科学版, 2013, 36(5):555-558. ZHANG Benhui, CHEN Wenbing, TANG Yuansheng. Verifiable vector space multi-secret sharing scheme based on signcryption[J]. Journal of Hefei University of Technology: Natural Science, 2013, 36(5):555-558.
[4] 吴星星, 李志慧, 李婧. 一个可验证的多秘密共享门限方案[J]. 计算机工程与应用, 2013, 49(13):65-67. WU Xingxing, LI Zhihui, LI Jing. Threshold verifiable multi-secret sharing scheme[J]. Computer Engineering and Applications, 2013, 49(13):65-67.
[5] 许春香, 肖国镇. 门限多重秘密共享方案[J]. 电子学报, 2004, 32(10):1688-1689. XU Chunxiang, XIAO Guozhen. A threshold multiple secret sharing scheme[J]. Acta Electronic Sinica, 2004, 32(10):1688-1689.
[6] DEHKORDI M H, MASHHADI S. New efficient and practical verifiable multi-secret sharing schemes[J]. Information Sciences, 2008, 178:2262-2274.
[7] 张志芳, 刘木兰. 理性密钥共享的扩展博弈模型[J]. 中国科学: 信息科学, 2012, 42(1):32-46. ZHANG Zhifang, LIU Mulan. Rational secret sharing as extensive games[J]. Science China: Information Sciences, 2012, 42(1):32-46.
[8] WANG Daoshun, YI Feng, LI Xiaobo. On general construction for extended visual cryptography schemes[J]. Pattern Recognition, 2009, 42(11):3071-3082.
[9] 陈祺, 裴定一, 赵淦森, 等. 实现分离多级存取结构的黑盒密钥共享体制[J]. 计算机学报, 2012, 35(9):1804-1815. CHEN Qi, PEI Dingyi, ZHAO Gansen, et al. Black-box secret sharing scheme for disjunctive multi-level access structure[J]. Chinese Journal of Computers, 2012, 35(9):1804-1815.
[10] 姜莲霞, 谭晓青. 基于Bell态的量子秘密共享协议[J]. 计算机工程与应用, 2013, 49(18): 61-64. JIANG Lianxia, TAN Xiaoqing. Quantum secret sharing scheme based on bell states[J]. Computer Engineering and Applications, 2013, 49(18):61-64.
[11] WANG Huaxiong, WONG Duncan S. On secret reconstruction in secret sharing schemes[J]. IEEE Transactions on Information Theory, 2008, 54(1):473-480.
[12] ZHANG Zhifang, CHEE Y M, LING San, et al. Threshold changeable secret sharing schemes revisited[J]. Theoretical Computer Science, 2012, 418:106-115.
[1] JIAO Hong-ru, QIN Jing. Quantum secret sharing scheme realizing all hyperstar quantum access structure [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(9): 62-68.
[2] XU Ting-ting, LI Zhi-hui, MA Min. A new improvable quantum secret sharing scheme [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(3): 8-15.
[3] ZHANG Xiao-dong, DONG Wei-guang, TANG Min-an, GUO Jun-feng, LIANG Jin-ping. gOMP reconstruction algorithm based on generalized Jaccard coefficient for compressed sensing [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(11): 23-28.
[4] XU Sheng-wei. A new quantum secret sharing scheme [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 36-40.
[5] . A compact construction for non-monotonic online/offline CP-ABE [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(12): 78-86.
[6] XUE Li-xia, LI Zhi-hui, XIE Jia-li. A note on the optimal information rate of hypercycle access structure with three hyperedges [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(11): 60-66.
[7] ZHANG Na, LI Zhi-hui. The optimal information rate of a type of access structures based on connected hypergraphs on nine participants [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(09): 74-82.
[8] SHI Runhua, ZHONG Hong. A novel anonymous threshold secret sharing scheme [J]. J4, 2012, 47(11): 31-39.
[9] WANG Kan1, WU Lei2,3, HAO Rong4. A resilient and distributed scheme of data security [J]. J4, 2011, 46(9): 39-42.
[10] ZHU Yi,DAI Tao,ZHANG Xian-feng . A state-tree based (t, n) secret sharing scheme [J]. J4, 2008, 43(9): 68-72 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd