On the computational complexities of three problems related to a privacy measure for large networks under active attack-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the computational complexities of three problems related to a privacy measure for large networks under active attack

Published:2019-07 Issue: Volume:775 Page:53-67
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chatterjee Tanima,DasGupta Bhaskar^ORCID,Mobasheri Nasim,Srinivasan Venkatkumar,Yero Ismael G.^ORCID

Funder

NSF

Ministerio de Educación, Cultura y Deporte

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography;Backstrom,2007

2. Privacy, additional information, and communication;Bar-Yehuda;IEEE Trans. Inform. Theory,1993

3. On communication protocols that compute almost privately;Comi;Theoret. Comput. Sci.,2012

4. Introduction to Algorithms;Cormen,2001

5. Differential privacy;Dwork,2006

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the $$(k,\ell )$$-anonymity of networks via their k-metric antidimension;Scientific Reports;2023-11-04

2. A Comparison of Four Notions of Isomorphism-Based Security for Graphs;IEEE Transactions on Dependable and Secure Computing;2022

3. k , l -Anonymity in Wheel-Related Social Graphs Measured on the Base of k -Metric Antidimension;Journal of Mathematics;2021-09-16

4. A Review of Several Privacy Violation Measures for Large Networks under Active Attacks;Security and Privacy From a Legal, Ethical, and Technical Perspective;2020-09-09

5. K-metric antidimension of some generalized Petersen graphs;Filomat;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3