STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
Chosen-Ciphertext Security from Identity-Based Encryption
SIAM Journal on Computing
Efficient Selective Identity-Based Encryption Without Random Oracles
Journal of Cryptology
Improved efficiency for CCA-secure cryptosystems built using identity-based encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On the limitations of the spread of an IBE-to-PKE transformation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Chosen ciphertext security from identity-based encryption without strong condition
IWSEC'06 Proceedings of the 1st international conference on Security
Secure public-key encryption scheme without random oracles
Information Sciences: an International Journal
| Hi-index | 0.00 |
Design a secure public key encryption scheme and its security proof are one of the main interests in cryptography In 2004, Canetti, Halevi and Katz [8] constructed a public key encryption (PKE) from a selective identity-based encryption scheme with a strong one-time signature scheme In 2005, Boneh and Katz [6] improved Canetti-Halevi-Katz construction by replacing a strong one-time signature with a message authentication code, but it is not publicly verifiable Later, Boyen, Mei and Waters [7] constructed PKE scheme directly from Waters' IBE scheme [17] , which is only secure against direct chosen-ciphertext attack and is not secure against adaptive chosen-ciphertext attack In 2006, Tan [16] further improved the efficiency of Canetti-Halevi-Katz (CHK) construction by directly from Boneh-Boyen identity based encryption (IBE) scheme [4] with a weak one-time signature In this paper, we construct an efficient public key encryption scheme without one-time signature, which preserves a publicly verifiable property and secure against adaptive chosen-ciphertext attack The construction of the proposed scheme is based on Boneh-Boyen identity-based encryption (IBE) scheme [2] and a trapdoor function We also show that the proposed scheme is more efficient than CHK construction.