An algebraic approach to maliciously secure private set intersection

DOI10.1007/978-3-030-17659-4_6MaRDI QIDQ2292691zbMATH OpenOpenAlexFDO

Authors Satrajit Ghosh, Tobias Nilges

Publication date 4 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17659-4_6

Mathematics Subject Classification ID

Privacy of data (68P27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Linear-complexity private set intersection protocols secure in malicious model
• Efficient private set intersection cardinality in the presence of malicious adversaries
• Private set intersection: new generic constructions and feasibility results
• Improved private set intersection against malicious adversaries
• Private set intersection in the internet setting from lightweight oblivious PRF

Cited in

(31)

• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Finite interval-time transition system for real-time actors
• VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
• Multiparty cardinality testing for threshold private intersection
• Multi-party threshold private set intersection with sublinear communication
• Two-sided malicious security for private intersection-sum with cardinality
• Private set intersection in the internet setting from lightweight oblivious PRF
• PSI from PaXoS: fast, malicious private set intersection
• Oblivious key-value stores and amplification for private set intersection
• Polynomial representation is tricky: maliciously secure private set intersection revisited
• A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
• Linear-complexity private set intersection protocols secure in malicious model
• Efficient private set intersection cardinality in the presence of malicious adversaries
• Private intersection of certified sets
• Two-round oblivious linear evaluation from learning with errors
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Improved private set intersection against malicious adversaries
• Multi-party updatable delegated private set intersection
• Hiding the input-size in multi-party private set intersection
• Actively secure arithmetic computation and VOLE with constant computational overhead
• Improved private set intersection for sets with small entries
• Streaming and unbalanced PSI from function secret sharing
• An algebraic framework for silent preprocessing with trustless setup and active security
• Malicious secure, structure-aware private set intersection
• Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
• Linear Complexity Private Set Intersection for Secure Two-Party Protocols
• Element distinctness and bounded input size in private set intersection and related protocols
• Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
• Fast secure computations on shared polynomials and applications to private set operations
• Fast private set intersection from polynomial multiplication triples
• Amortizing Circuit-PSI in the multiple sender/receiver setting

This page was built for publication: An algebraic approach to maliciously secure private set intersection

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