Private set intersection: new generic constructions and feasibility results

DOI10.3934/AMC.2017040MaRDI QIDQ2408281zbMATH OpenOpenAlexFDO

Authors Paolo D'Arco, Angel L. Pérez del Pozo, Claudio Soriente, Rainer Steinwandt, María Isabel González Vasco

Publication date 12 October 2017

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2017040

zbMATH Keywords

private set intersectionunconditional securityhomomorphic encryptionoblivious pseudorandom evaluationsize-hiding

Mathematics Subject Classification ID

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

Recommendations

• Size-hiding in private set intersection: existential results and constructions
• (If) size matters: size-hiding private set intersection
• Bounded size-hiding private set intersection
• Private set intersection in the internet setting from lightweight oblivious PRF
• Linear-complexity private set intersection protocols secure in malicious model

Cites work

• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• scientific article; zbMATH DE number 47606 (Why is no real title available?)
• scientific article; zbMATH DE number 1304184 (Why is no real title available?)
• scientific article; zbMATH DE number 2009978 (Why is no real title available?)
• scientific article; zbMATH DE number 747049 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• (If) size matters: size-hiding private set intersection
• Advances in Cryptology - EUROCRYPT 2004
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Efficient robust private set intersection
• Fast secure computation of set intersection
• Foundations of Cryptography
• Hiding the input-size in secure two-party computation
• Introduction to modern cryptography.
• Linear-complexity private set intersection protocols secure in malicious model
• Number-theoretic constructions of efficient pseudo-random functions
• On constructing homomorphic encryption schemes from coding theory
• Privacy-Preserving Set Operations
• Privacy-Preserving Set Union
• Private intersection of certified sets
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• SPHF-friendly non-interactive commitments
• Secure database commitments and universal arguments of quasi knowledge
• Size-hiding in private set intersection: existential results and constructions
• Theory of Cryptography

Cited in

(34)

• Hiding the input-size in multi-party private set intersection
• Private identity agreement for private set functionalities
• How to meet big data when private set intersection realizes constant communication complexity
• Finding one common item, privately
• VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
• The communication complexity of threshold private set intersection
• Practically efficient private set intersection from trusted hardware with side-channels
• Attribute-based fine-grained access control for outscored private set intersection computation
• An algebraic approach to maliciously secure private set intersection
• Nothing refreshes like a RePSI: reactive private set intersection
• (If) size matters: size-hiding private set intersection
• Credibility in private set membership
• Private computations on set intersection
• Faster unbalanced private set intersection
• Private set-intersection with common set-up
• Policy-enhanced private set intersection: sharing information while enforcing privacy policies
• Improved private set intersection for sets with small entries
• Combining private set intersection with secure two-party computation
• Private set intersection in the internet setting from lightweight oblivious PRF
• Size-hiding in private set intersection: existential results and constructions
• Fuzzy private set intersection with large hyperballs
• Private set operations from oblivious switching
• Bounded size-hiding private set intersection
• SpOT-light: lightweight private set intersection from sparse OT extension
• Oblivious key-value stores and amplification for private set intersection
• Scalable private set union from symmetric-key techniques
• Adaptively code-correlation robustness functions and its applications to private set intersection
• Laconic private set intersection and applications
• Structure-aware private set intersection, with applications to fuzzy matching
• Computation efficient structure-aware PSI from incremental function secret sharing
• Financial Cryptography and Data Security
• Streaming and unbalanced PSI from function secret sharing
• PSI-stats: private set intersection protocols supporting secure statistical functions
• Element distinctness and bounded input size in private set intersection and related protocols

This page was built for publication: Private set intersection: new generic constructions and feasibility results

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