一种可验证的门限可变多秘密共享方案  

A Verifiable Threshold Variable Multi-Secret Sharing Scheme

作　　者：黄科华[1] 陈和风[2] HUANG Kehua;CHEN Hefeng(Department of Primary Education,Quanzhou Preschool Education College,Quanzhou Fujian 362000,China;College of Computer Engineering,Jimei University,Xiamen Fujian 361021,China)

机构地区：[1]泉州幼儿师范高等专科学校初等教育学院,福建泉州362000 [2]集美大学计算机工程学院,福建厦门361021

出　　处：《泉州师范学院学报》2022年第2期66-69,共4页Journal of Quanzhou Normal University

基　　金：泉州市高等学校中青年学科(专业)带头人培养计划(泉教高[2018]1号);福建省科技厅项目(2020R0066);福建省教育厅项目(JAT190314)。

摘　　要：针对现有密钥安全方案一些不足之处,如需要安全信道、密钥单次使用、不可验证等,利用离散对数签名的可验证性,基于陷门单向函数的特性构造了一种门限可变,并实现可验证的多秘密共享方案.该方案不需要使用到安全信道;用户的私钥不会暴露,可以多次使用;可以公开验证可信中心和用户是否作弊.方案便于新用户的加入和用户的删除,在运算复杂度上也有一定的优势.To overcome some shortcomings of the existing schemes, such as the need for a secure channel, the single use of the key, and the unverifiability of the key, a verifiable multi-secret sharing scheme with variable threshold is constructed based on the verifiability of discrete logarithmic signatures and the characteristics of the trapdoor one-way function. This scheme does not need to use a secure channel;it can be publicly verified whether the trusted center and the user cheat;the user’s private key will not be exposed and can be used for multiple times.The scheme also facilitates the addition and deletion of users, and has certain advantages in terms of computational complexity.

关 键 词：多秘密共享方案 可验证 陷门单项函数 离散对数 

分 类 号：TN918.1[电子电信—通信与信息系统]