Privacy-Preserving Set Operations

DOI10.1007/11535218_15zbMATH Open1145.94471OpenAlexW2143824669MaRDI QIDQ5451029FDOQ5451029

Authors: Lea Kissner, Dawn Song 

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_15

Recommendations

• Privacy-preserving mixed set operations
• Privacy-Preserving Set Union
• An efficient toolkit for computing private set operations
• Constant-round privacy preserving multiset union
• Efficient robust private set intersection

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (69)

• Hiding the input-size in multi-party private set intersection
• Privacy-Preserving Set Union
• ANALYSIS OF PRIVACY-PRESERVING ELEMENT REDUCTION OF A MULTISET
• Scalable multi-party private set-intersection
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
• Fair Threshold Decryption with Semi-Trusted Third Parties
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
• Efficient set intersection with simulation-based security
• A communication-efficient private matching scheme in client-server model
• Private set intersection: new generic constructions and feasibility results
• Privacy-preserving subgraph matching protocol for two parties
• Providing accurate models across private partitioned data: secure maximum likelihood estimation
• Applying secure multi-party computation in practice
• Multi-party updatable delegated private set intersection
• An efficient toolkit for computing private set operations
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Analysis of Gong et al.'s CCA2-secure homomorphic encryption
• Applied Cryptography and Network Security
• Provably secure fair mutual private set intersection cardinality utilizing Bloom filter
• New realizations of efficient and secure private set intersection protocols preserving fairness
• Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups
• Efficient set operations in the presence of malicious adversaries
• Secure and efficient multiparty private set intersection cardinality
• Polynomial representation is tricky: maliciously secure private set intersection revisited
• Attribute-based fine-grained access control for outscored private set intersection computation
• Lightweight delegated subset test with privacy protection
• Implementing secure reporting of sexual misconduct -- revisiting WhoToo
• Private set-intersection with common set-up
• Improved private set intersection for sets with small entries
• PRUB: A privacy protection friend recommendation system based on user behavior
• Privacy-preserving disjunctive normal form operations on distributed sets
• Privacy Preserving Data Mining within Anonymous Credential Systems
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
• A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
• Privately computing set-union and set-intersection cardinality via Bloom filters
• Multiparty cardinality testing for threshold private intersection
• Multi-party threshold private set intersection with sublinear communication
• Private set operations from oblivious switching
• Server-aided private set intersection based on reputation
• Two-sided malicious security for private intersection-sum with cardinality
• Oblivious key-value stores and amplification for private set intersection
• Quantum secure multi-party private set intersection cardinality
• Secure set intersection with untrusted hardware tokens
• Laconic private set intersection and applications
• Privacy-preserving mixed set operations
• Threshold private set intersection with better communication complexity
• Provably secure threshold paillier encryption based on hyperplane geometry
• Zero-Knowledge Accumulators and Set Algebra
• Efficient Disjointness Tests for Private Datasets
• Confidential gossip
• Constant-round privacy preserving multiset union
• Quantum private set intersection cardinality and its application to anonymous authentication
• Finding one common item, privately
• Width-based search for multi agent privacy-preserving planning
• Linear-time 2-party secure merge from additively homomorphic encryption
• Scalable multi-party private set union from multi-query secret-shared private membership test
• Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
• Malicious secure, structure-aware private set intersection
• Private computations on set intersection
• Complementary set encryption for privacy-preserving data consolidation
• Quantum multi-party private set union protocol based on least common multiple and Shor’s algorithm
• Private set operations from multi-query reverse private membership test
• Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
• Structure-aware private set intersection, with applications to fuzzy matching
• Computation efficient structure-aware PSI from incremental function secret sharing
• Mixed-technique multi-party computations composed of two-party computations
• Practical and malicious private set intersection with improved efficiency
• Element distinctness and bounded input size in private set intersection and related protocols

This page was built for publication: Privacy-Preserving Set Operations

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