Approximating Private Set Union/Intersection Cardinality with Logarithmic Complexity
- Submitting institution
-
University of Newcastle upon Tyne
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 239376-210297-1292
- Type
- D - Journal article
- DOI
-
10.1109/TIFS.2017.2721360
- Title of journal
- IEEE Transactions on Information Forensics and Security
- Article number
- -
- First page
- 2792
- Volume
- 12
- Issue
- 11
- ISSN
- 1556-6013
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2017
- URL
-
https://doi.org/10.1109/TIFS.2017.2721360
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
E - Secure and Resilient Systems
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper presents the first sublinear (logarithmic) complexity protocol that for the PSI/PSU cardinality problem, and a novel data structural approach for secure computation makes protocol extremely scalable. The fact that the protocols are the first with logarithmic computation and communication complexity is important because PSU-CA and PSI-CA are fundamental problems in privacy-preserving data mining and because the existing protocols are too expensive to be practical. The paper was published in a leading journal for security and cryptography (Google Scholar).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -