Approximating Private Set Union/Intersection Cardinality with Logarithmic Complexity - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Changyu Dong, Grigorios Loukides. Approximating Private Set Union/Intersection Cardinality with Logarithmic Complexity. IACR Cryptology ePrint Archive, 2018:495, 2018. [doi]

The following publications are possibly variants of this publication:

Approximating Private Set Union/Intersection Cardinality With Logarithmic ComplexityChangyu Dong, Grigorios Loukides. tifs, 12(11):2792-2806, 2017. [doi]

EMPSI: Efficient multiparty private set intersection (with cardinality)Yunbo Yang, Xiaolei Dong, Zhenfu Cao, Jiachen Shen, Ruofan Li, Yihao Yang, Shangmin Dou. fcsc, 18(1):181804, February 2024. [doi]

runs on WebDSL