Universal-2 HPS ⇒ CCA-secure PKE

Fully-black-box reduction · standard model · CS02 · security loss: additive: twice the subset-membership advantage, plus statistical terms in the smoothness and universal-2 errors, one of them linear in the number of decryption queries, the key approximation errors of both hash proof systems, and the instance and subset errors

Statement

Let be a universal-2 hash proof system for a hard subset membership problem : is smooth with functions , and is extended universal-2 with functions . The scheme with message space , , , ciphertexts for drawn by the sampler of , and , both hash values computed from the projections and the witness of , and decryption that outputs unless and and otherwise , is IND-CCA2-secure in the standard model — CS02. Both properties are meant up to the approximation of CS02, Definition 7, and the proof goes through the ideal families, at a cost of the key approximation errors — CS02. The construction uses no primitive besides the hash proof systems — CS02.

Notes