Dissemin is shutting down on January 1st, 2025

Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Information Forensics and Security, 11(12), p. 2792-2806, 2017

DOI: 10.1109/tifs.2017.2721360

Links

Tools

Export citation

Search in Google Scholar

Approximating Private Set Union/Intersection Cardinality With Logarithmic Complexity

Journal article published in 2017 by Changyu Dong ORCID, Grigorios Loukides
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO