Efficient robust private set intersection

DOI10.1504/IJACT.2012.048080MaRDI QIDQ1758883zbMATH OpenOpenAlexFDO

Authors Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung

Publication date 16 November 2012

Published in International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijact.2012.048080

zbMATH Keywords

cryptographic protocolsprivacy-preserving data miningsecure two-party computationset intersection

Mathematics Subject Classification ID

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

Review text

Summary: Computing set intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work, the first solution to this problem is presented.

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• Private intersection of certified sets
• Private set operations from oblivious switching
• Efficient set intersection with simulation-based security
• Scalable multi-party private set-intersection

Cited in

(16)

• Cryptanalysis and improvement of a quantum private set intersection protocol
• A black-box construction of non-malleable encryption from semantically secure encryption
• 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
• Quantum secure two-party computation for set intersection with rational players
• Server-aided private set intersection based on reputation
• SpOT-light: lightweight private set intersection from sparse OT extension
• Private set intersection: new generic constructions and feasibility results
• Improved, black-box, non-malleable encryption from semantic security
• Efficient set intersection with simulation-based security
• Bounded size-hiding private set intersection
• Privacy-Preserving Set Union
• Private intersection of certified sets
• Advances in Cryptology - EUROCRYPT 2004
• Privacy-Preserving Set Operations

This page was built for publication: Efficient robust private set intersection

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