Approximating Private Set Union/Intersection Cardinality with Logarithmic Complexity
- Submitting institution
-
King's College London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 87311436
- 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
-
-
- 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)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper proposes approximate protocols for the problem of Private Set Union CArdinality (PSUCA) and Private-Set Intersection CArdinality (PSI-CA). The new protocols are the first with logarithmic computation and communication complexity; the previous protocols have at least linear computational or communication complexity, which makes them too costly to be practical. The achieved low complexity of our protocols is important because PSU-CA and PSI-CA are fundamental problems in privacy-preserving data mining (e.g., they are essential building blocks in distributed frequent pattern mining algorithms). [Yu et al. J. Med. Internet Res. 2020] integrated building blocks of our protocols into their solution.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -