Privacy-preserving group discovery with linear complexity

DOI10.1007/978-3-642-13708-2_25MaRDI QIDQ3575059zbMATH OpenOpenAlexFDO

Authors Mark Manulis, Benny Pinkas, Bertram Poettering

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)

Recommendations

• Affiliation-hiding key exchange with untrusted group authorities
• Affiliation-hiding authentication with minimal bandwidth consumption
• Group Secret Handshakes Or Affiliation-Hiding Authenticated Group Key Agreement
• Taming Big Brother Ambitions: More Privacy for Secret Handshakes
• Beyond Secret Handshakes: Affiliation-Hiding Authenticated Key Exchange

Cited in

(9)

• Oblivious key-value stores and amplification for private set intersection
• Attribute-based on-demand multicast group setup with membership anonymity
• Secure Top-k Subgroup Discovery
• Private discovery of common social contacts
• Affiliation-hiding authentication with minimal bandwidth consumption
• Affiliation-hiding key exchange with untrusted group authorities
• Match me if you can: matchmaking encryption and its applications
• Short concurrent covert authenticated key exchange (short cAKE)
• Amortizing Circuit-PSI in the multiple sender/receiver setting

This page was built for publication: Privacy-preserving group discovery with linear complexity

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