Approximating Private Set Union/Intersection Cardinality With Logarithmic Complexity (2017)

First Author: Dong C
Attributed to:  Practical Data-intensive Secure Computation: a Data Structural Approach funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1109/tifs.2017.2721360

Publication URI: http://dx.doi.org/10.1109/tifs.2017.2721360

Type: Journal Article/Review

Parent Publication: IEEE Transactions on Information Forensics and Security

Issue: 11