Efficient robust private set intersection

DOI10.1504/IJACT.2012.048080zbMath1271.94017OpenAlexW2138684280MaRDI QIDQ1758883

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Mordechai M. 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 protocolsset intersectionsecure two-party computationprivacy-preserving data mining

Mathematics Subject Classification ID

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

Related Items (10)

Efficient set intersection with simulation-based security ⋮ Private set intersection: new generic constructions and feasibility results ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Cryptanalysis and improvement of a quantum private set intersection protocol ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Quantum secure two-party computation for set intersection with rational players ⋮ 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 ⋮ Bounded Size-Hiding Private Set Intersection

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