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...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2023-02, Vol.945, p.113685, Article 113685
Main Authors: Nan, Jiehui, Zhu, Haiming, Liu, Shigang, Hu, Honggang
Format: Article
Language:English
Subjects:
Code-correlation robustness
OT extensions
Private set intersection
Secure multi-party computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. We also give a one-sided malicious private set intersection (PSI) protocol in Universal Composability (UC) framework without random oracle model (ROM) assumption based on the adaptively CCRFs. In the high bandwidth setting, our implementation is nearly as fast as state-of-the-art semi-honest KKRT protocol, and sometimes even faster than it, owing to the efficiency of our instantiation of adaptively CCRFs, which may be of independent interest used in other secure protocols.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2022.12.035