Adaptively code-correlation robustness functions and its applications to private set intersection

In this paper, we propose a novel concept of adaptively code-correlation robustness functions (CCRFs) and construct this primitive from public random permutation. The security of our construction can be proved by H-Coefficient technique. Furthermore, the public random permutation can be instantiated by some lightweight designs like ChaCha20 512-bit permutation which is faster than SHA-512 and BLAKE2.