摘要
现有的多秘密共享方案虽然可以防止可信中心欺骗,但往往计算量较大。针对此问题,基于离散对数求解的困难性,提出无可信中心的多秘密共享方案。该方案不存在可信中心,可以避免可信中心在分发秘密份额时的主动欺骗或无意欺骗。
Most present multi-secret sharing schemes need a lot of computation in order to prevent the trusted party from being cheated.To solve this problem,multi-secret sharing scheme without a trusted party on the basis of the intractability of the discrete logarithm is presented.Because the trusted party does not exist in the proposed scheme,which can prevent the trusted party from being actively or unintentionally cheated,it has good practical application.
出处
《重庆科技学院学报(自然科学版)》
CAS
2011年第4期150-151,166,共3页
Journal of Chongqing University of Science and Technology:Natural Sciences Edition
基金
合肥师范学院院级科研项目(2011kj03)
安徽高校省级自然科学研究项目(KJ2010B162)