Privacy-Preserving Group Discovery with Linear Complexity

DOI10.1007/978-3-642-13708-2_25zbMath1443.94095OpenAlexW1533736547MaRDI QIDQ3575059

Mark Manulis, Bertram Poettering, Benny Pinkas

Publication date: 6 July 2010

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13708-2_25

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Oblivious key-value stores and amplification for private set intersection ⋮ Match me if you can: matchmaking encryption and its applications

This page was built for publication: Privacy-Preserving Group Discovery with Linear Complexity