机译:Fundamental Privacy Limits in Bipartite Networks Under Active Attacks
Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA;
Department of Electrical and Computer Engineering, New York University Tandon School of Engineering, Brooklyn, NY, USA;
Social networking (online); Noise measurement; History; Browsers; Upper bound; Random variables; Indexes; Privacy; social network; bipartite graph; information thresholds; active attack; deanonymization;