IND-CPA statically approximate HE ⇒ IND-CPA-D approximate HE (LMSS22)

Standard model · LMSS22

Statement

Every IND-CPA-secure statically approximate HE scheme can be transformed into one that is IND-CPA-secure for a number of decryption queries fixed in advance. LMSS22’s transformation tags each fresh ciphertext with the bound and each evaluated one with ‘s bound computed from its circuit and the tags of its inputs, and post-processes the output of decryption with a differential-privacy mechanism that adds noise scaled to the tag; every efficient adversary’s advantage against the result in the IND-CPA game is negligible — LMSS22 (Definitions 11 and 15, Algorithm 2, Theorem 2). Applied with called on one addition or multiplication at a time, with the original scheme run at a precision , every tag of a computation of depth at most is or one of the bounds the hypothesis caps, all at most , so the transformed scheme is correct at precision once is large enough for the tag plus the added noise to stay below except with negligible probability, and its tags have polynomial length — folklore. Its advantage in the IND-CPA game stays negligible, since an adversary’s query on a circuit is a sequence of admissible single-gate queries to the scheme of Algorithm 2, with the same decryption queries; with the correctness above, it is IND-CPA-secure — folklore. LMSS22 instantiate the mechanism for CKKS, adding Gaussian noise to the output of decryption — LMSS22.

Notes

  • Tags that computes for whole circuits can be large on computations that are in range: does not see the messages, so for rounds of , in range at , its bound must also cover inputs near , where the circuit’s derivative exceeds for — folklore.
  • Without such noise IND-CPA does not suffice: a passive attack recovers the key of CKKS from decryption results — LM21.