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