抗泄漏可验证多秘密共享方案  

Leakage-Resilient Verifiable Multi-Secret Sharing Scheme

作　　者：沈华[1] 陈泌文 张明武[1] 

机构地区：[1]湖北工业大学计算机学院,武汉430068

出　　处：《北京邮电大学学报》2016年第1期87-91,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61370224;61502156);湖北省自然科学基金重点项目(2013CFA046);湖北省教育厅中青年人才项目(Q20151402)

摘　　要：在依赖分发者选取多项式系数、构造多项式并将多项式的函数值作为秘密份额的秘密共享方案中,半诚实的分发者可通过修改多项式系数泄漏关于秘密的信息,破坏秘密共享方案的安全性.为了解决半诚实分发者造成的秘密泄漏问题,提出了一种抗泄漏的可验证多秘密共享方案.该方案采用所有参与者共同构造多项式系数的方式,成功解决了半诚实分发者可能泄漏秘密信息的问题.与其他方案相比,新方案实现了抗半诚实分发者泄漏.同时,实验结果也表明,新方案在计算方面具有较好的性能.In the existing multi-secret sharing schemes mainly depending on a dealer selection,the polynomial coefficients constructs the polynomial and takes the value of the polynomial function as shadows of secrets,however,the semi-honest dealer may leak information of secrets by changing the polynomial coefficients. In order to solve the problem by semi-honest dealer,the article presented a new leakage-resilient verifiable multi-secret sharing scheme. The problem of leakage secret information hiddens in that the polynomial coefficients are selected and constructed by all of participants. Comparison with existing schemes which also achieve verifiable multi-secret sharing,the scheme can still work well even when the dealer leaks some secret information. It has better efficiency in terms of computation overhead.

关 键 词：多秘密共享 可验证性 抗泄漏 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]