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

DOI10.1016/j.tcs.2022.12.035OpenAlexW4313478502MaRDI QIDQ2682918

Shigang Liu, Jiehui Nan, Haiming Zhu, Hong Gang Hu

Publication date: 1 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.035

zbMATH Keywords

secure multi-party computationprivate set intersectioncode-correlation robustnessOT extensions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Practical and malicious private set intersection with improved efficiency

Uses Software

• ChaCha
• spongent
• Keccak
• libOTe

Cites Work

• Unnamed Item
• Private set intersection in the internet setting from lightweight oblivious PRF
• PSI from PaXoS: fast, malicious private set intersection
• How to build pseudorandom functions from public random permutations
• SpOT-light: lightweight private set intersection from sparse OT extension
• Improved OT Extension for Transferring Short Secrets
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
• Tweaking Even-Mansour Ciphers
• The “Coefficients H” Technique
• Cuckoo hashing
• Keccak
• Tight Security Bounds for Key-Alternating Ciphers
• Advances in Cryptology - CRYPTO 2003
• Improved Private Set Intersection Against Malicious Adversaries

This page was built for publication: Adaptively code-correlation robustness functions and its applications to private set intersection