An efficient toolkit for computing private set operations

DOI10.1007/978-3-319-59870-3_15zbMATH Open1426.94093OpenAlexW2617299507MaRDI QIDQ2014617FDOQ2014617

Authors: Alex Davidson, Carlos Cid 

Publication date: 25 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59870-3_15

Recommendations

• Privately computing set-union and set-intersection cardinality via Bloom filters
• Scalable private set union from symmetric-key techniques
• Private set operations from oblivious switching
• Efficient scalable multiparty private set-intersection via garbled Bloom filters
• Privacy-Preserving Set Operations

zbMATH Keywords

data miningsecure computationBloom filtersadditively homomorphic encryptionprivate set operations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (18)

• Hiding the input-size in multi-party private set intersection
• Privacy-Preserving Set Operations
• Scalable multi-party private set union from multi-query secret-shared private membership test
• Secure and efficient multiparty private set intersection cardinality
• Linear Complexity Private Set Intersection for Secure Two-Party Protocols
• Privacy-preserving disjunctive normal form operations on distributed sets
• Invertible polynomial representation for private set operations
• Privately computing set-union and set-intersection cardinality via Bloom filters
• Private set operations from multi-query reverse private membership test
• Efficient scalable multiparty private set-intersection via garbled Bloom filters
• Private set operations from oblivious switching
• Scalable private set union from symmetric-key techniques
• Efficient Concurrent Covert Computation of String Equality and Set Intersection
• Mixed-technique multi-party computations composed of two-party computations
• Privacy-preserving mixed set operations
• Efficient private set intersection cardinality protocol in the reverse unbalanced setting
• Enabling privacy-preserving non-interactive computation for Hamming distance
• Constant-round privacy preserving multiset union

This page was built for publication: An efficient toolkit for computing private set operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014617)