在这份报纸,基于可证实的对和基于身份的阀值密码学,一篇小说基于身份(基于标志) 阀值解密计划(IDTDS ) 被建议,它对在在随机的神谕的计算双线性的 Diffie-Hellman (CBDH ) 问题假设下面的适应选择密文攻击是 provably 安全的。在 IDTDS 的密文的阴毛的 checkability 被简单地创造签署的 ElGamal 加密而不是一个不相关的零知识的证明给。而且,我们介绍一保证所有解密分享的修改可证实的配对是一致的。我们的计划比以前考虑的计划在确认是更有效的。
In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based (ID-based) threshold decryption scheme (IDTDS) is proposed, which is provably secure against adaptive chosen cipbertext attack under the computational bilinear Diffie-Hellman (CBDH) problem assumption in the random oracle. The pubic cheekability of ciphertext in the IDTDS is given by simply creating a signed E1Gamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously.