ABSTRACT
This chapter starts with the introduction of the Canetti-Halevi-Katz (CHK) transformation and discusses how to generate CCA-secure Public-Key Encryption (PKE) from the CPA-secure Identity-Based Encryption (IBE) and CCA-secure Binary Tree Encryption (BTE) from CPA-secure BTE. It discusses how to generate CCA-secure PKE from the CPA-secure IBE and CCA-secure BTE from CPA-secure BTE. Canetti-Halevi-Katz proposed a simple and efficient construction of a CCA-secure public-key encryption scheme from any CPA-secure IBE scheme. A BTE is secure against selective-node, chosen-plaintext attacks if for all polynomially-bounded functions. Making a CPA-secure IBE scheme is considered to be easier than CCA-secure one. The construction is quite efficient so that it allows cryptographers to focus on making CPA-secure schemes and then transform it to CCA-secure schemes easily.
