Zero-Knowledge-Private Counting of Group Triangles in Social Networks

نویسندگان

  • Maryam Shoaran
  • Alex Thomo
چکیده

We introduce a general notion of maturity in social networks that is based on the number of triangles between groups/communities. In order to protect individual privacy upon possible release of such information, we propose privacy mechanisms using zero-knowledge privacy (ZKP), a recently proposed privacy scheme that provides stronger protection than differential privacy (DP) for socialgraph data. We present techniques to compute the parameters required to design ZKP methods and finally evaluate the practicality of the proposed methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast counting of triangles in real-world networks: proofs, algorithms and observations

How can we quickly find the number of triangles in a large graph, without actually counting them?Triangles are important for real world social networks, lying at the heart of the clustering coefficient and of the transitivity ratio. However, straight-forward and even approximate counting algorithms can be slow, trying to execute or approximate the equivalent of a 3-way database join. In this pa...

متن کامل

Fast Counting of Triangles in Large Real Networks: Algorithms and Laws

How can we quickly find the number of triangles in a large graph, without actually counting them? Triangles are important for real world social networks, lying at the heart of the clustering coefficient and of the transitivity ratio. However, straight-forward and even approximate counting algorithms can be slow, trying to execute or approximate the equivalent of a 3-way database join. In this p...

متن کامل

Counting triangles, tunable clustering and the small-world property in random key graphs (Extended version)

Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse as recommender systems, social network modeling, and clustering and classification analysis. This paper is devoted to analyzing various properties of random k...

متن کامل

Knowledge Sharing Behavior Model of Iranian Professionals in experts’ social networks: exploring indexes

Background and Aim: Due to the extensive use of knowledge intelligence, the future of countries depend on the application of specialized knowledge-based social networks. Thus, it is noteworthy to highlight the important role of the professionals. The key indicators of a model for knowledge sharing of Iranian experts, in experts’ social networks has been identified. Methods: For this purpose, ex...

متن کامل

Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study

In the past, the fundamental graph problem of triangle counting and listing has been studied intensively from a theoretical point of view. Recently, triangle counting has also become a widely used tool in network analysis. Due to the very large size of networks like the Internet, WWW, or social networks, the efficiency of algorithms for triangle counting and listing is an important issue. The m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. J.

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2017