Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a novel approach to k-anonymity in online communication systems through this 19-minute conference talk from USENIX FOCI '14. Delve into the analysis of how sparse aggregate social relations impact network overhead in k-anonymity systems. Discover the concept of "symmetric disclosure," a proposed solution to reduce overhead by having both communicating parties specify origin and target sets. Learn how this approach can offset the negative effects of sparsity in message retrieval. Gain insights into the challenges of balancing anonymity and efficiency in online communication systems.