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 c...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.展开更多
基金Supported by the National Natural Science Foundation of China (60970119, 60803149)the National Basic Research Program of China (973 Program) (2007CB311201)
文摘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.
