一种基于椭圆曲线的强可验证门限阈下信道方案

基于椭圆曲线离散对数问题,提出一种(t,n)-(k,m)强可验证门限阈下信道方案.该方案中n个阈下子信息拥有者中至少t个合作才能得到阈下信息进而生成有效的签名,而m个接收者中至少k个合作才能提取阈下信息.接收者不需要和发送者共享其私钥.通过采用一种可验证门限秘密共享技术,每个接收者可以对提取的子信息有效性进行验证,同时又可以防止接收者对签名进行联合攻击和广义伪造攻击.

A strong verifiable threshold subliminal channel scheme based on elliptic curve

A(t,n)-(k,m) verifiable threshold subliminal channel scheme was presented based on the elliptic curve discrete logarithm problem.In this scheme,at least t participants among n possessors of subliminal sub-information could get subliminal information so that could form valid signature,while at least k participants among m recipients could extract the subliminal information.Recipients did not need to share their private keys with the participants.By using one verifiable threshold secret sharing technique,the ...