Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085912
Guillaume-Jean Herbiet, P. Bouvry, F. Guinand
In this article, we investigate the social relevance of dynamic community structures that can be determined on dynamic communication networks. We first present and validate SAND/SHARC (Stability And Network Dynamics over Sharper Heuristic for Assignment of Robust Communities), a distributed algorithm for community detection. Then, based on real-world communication traces and social information, we evaluate how the structures found by SAND/SHARC can be translated to social links and favor interaction between users with similar social characteristics. Such a study is important to envision community detection algorithm in the design of ubiquitous social interaction protocols, like those used in mobile social networks (MoSoNets).
在本文中，我们研究动态社区结构的社会相关性，动态社区结构可以在动态通信网络上确定。我们首先提出并验证了SAND/SHARC (Stability and Network Dynamics over Sharper Heuristic for Assignment of Robust Communities)，这是一种用于社区检测的分布式算法。然后，基于现实世界的交流痕迹和社会信息，我们评估了SAND/SHARC发现的结构如何转化为社会链接，并有利于具有相似社会特征的用户之间的互动。这样的研究对于设想社区检测算法在无处不在的社交交互协议的设计中是很重要的，就像那些在移动社交网络(MoSoNets)中使用的那样。
{"title":"Social relevance of topological communities in ad hoc communication networks","authors":"Guillaume-Jean Herbiet, P. Bouvry, F. Guinand","doi":"10.1109/CASON.2011.6085912","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085912","url":null,"abstract":"In this article, we investigate the social relevance of dynamic community structures that can be determined on dynamic communication networks. We first present and validate SAND/SHARC (Stability And Network Dynamics over Sharper Heuristic for Assignment of Robust Communities), a distributed algorithm for community detection. Then, based on real-world communication traces and social information, we evaluate how the structures found by SAND/SHARC can be translated to social links and favor interaction between users with similar social characteristics. Such a study is important to envision community detection algorithm in the design of ubiquitous social interaction protocols, like those used in mobile social networks (MoSoNets).","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115146872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085920
Alexis Papadimitriou, P. Symeonidis, Y. Manolopoulos
Online social networks (OSNs) like Facebook, Myspace, and Hi5 have become popular, because they allow users to easily share content or expand their social circle. OSNs recommend new friends to registered users based on local graph features (i.e. based on the number of common friends that two users share). However, OSNs do not exploit all different length paths of the network. Instead, they consider only pathways of maximum length 2 between a user and his candidate friends. On the other hand, there are global approaches, which detect the overall path structure in a network, being computationally prohibitive for huge-size social networks. In this paper, we provide friend recommendations, also known as the link prediction problem, by traversing all paths of a bounded length, based on the “algorithmic small world hypothesis”. As a result, we are able to provide more accurate and faster friend recommendations. We perform an extensive experimental comparison of the proposed method against existing link prediction algorithms, using two real data sets (Hi5 and Epinions). Our experimental results show that our FriendLink algorithm outperforms other approaches in terms of effectiveness and efficiency in both real data sets.
{"title":"Friendlink: Link prediction in social networks via bounded local path traversal","authors":"Alexis Papadimitriou, P. Symeonidis, Y. Manolopoulos","doi":"10.1109/CASON.2011.6085920","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085920","url":null,"abstract":"Online social networks (OSNs) like Facebook, Myspace, and Hi5 have become popular, because they allow users to easily share content or expand their social circle. OSNs recommend new friends to registered users based on local graph features (i.e. based on the number of common friends that two users share). However, OSNs do not exploit all different length paths of the network. Instead, they consider only pathways of maximum length 2 between a user and his candidate friends. On the other hand, there are global approaches, which detect the overall path structure in a network, being computationally prohibitive for huge-size social networks. In this paper, we provide friend recommendations, also known as the link prediction problem, by traversing all paths of a bounded length, based on the “algorithmic small world hypothesis”. As a result, we are able to provide more accurate and faster friend recommendations. We perform an extensive experimental comparison of the proposed method against existing link prediction algorithms, using two real data sets (Hi5 and Epinions). Our experimental results show that our FriendLink algorithm outperforms other approaches in terms of effectiveness and efficiency in both real data sets.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116639900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085948
H. Tavante, M. P. Coutinho
Since the concept of “social networks” has got widespread among people from all countries, few users focused on profiting them under different areas. In this paper it is proposed a separation of types of social networks and a tool with the function of a web-meter for measuring people's social status on these networks after applying some resources that could help them to get satisfactory results in business, marketing and even at relations with other people in social networks.
{"title":"Web social networks meters and business usage analisys","authors":"H. Tavante, M. P. Coutinho","doi":"10.1109/CASON.2011.6085948","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085948","url":null,"abstract":"Since the concept of “social networks” has got widespread among people from all countries, few users focused on profiting them under different areas. In this paper it is proposed a separation of types of social networks and a tool with the function of a web-meter for measuring people's social status on these networks after applying some resources that could help them to get satisfactory results in business, marketing and even at relations with other people in social networks.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125937735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085938
F. Amblard, A. Casteigts, P. Flocchini, Walter Quattrociocchi, N. Santoro
In this paper we approach the definition of new methodologies for the visualization and the exploration of social networks and their dynamics. We present a recently introduced formalism called TVG (for time-varying graphs), which was initially developed to model and analyze highly-dynamic and infrastructure-less communication networks, and TVG derived metrics. As an application context, we chose the case of scientific communities by analyzing a portion of the arXiv repository (ten years of publications in physics). We discuss the dataset by means of both static and temporal analysis of citations and co-authorships networks. Afterward, as we consider that scientific communities are at the same time communities of practice (through co-authorship) and that a citation represents a deliberative selection of a work among others, we introduce a new transformation to capture the co-existence of citations' effects and collaboration behaviors.
{"title":"On the temporal analysis of scientific network evolution","authors":"F. Amblard, A. Casteigts, P. Flocchini, Walter Quattrociocchi, N. Santoro","doi":"10.1109/CASON.2011.6085938","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085938","url":null,"abstract":"In this paper we approach the definition of new methodologies for the visualization and the exploration of social networks and their dynamics. We present a recently introduced formalism called TVG (for time-varying graphs), which was initially developed to model and analyze highly-dynamic and infrastructure-less communication networks, and TVG derived metrics. As an application context, we chose the case of scientific communities by analyzing a portion of the arXiv repository (ten years of publications in physics). We discuss the dataset by means of both static and temporal analysis of citations and co-authorships networks. Afterward, as we consider that scientific communities are at the same time communities of practice (through co-authorship) and that a citation represents a deliberative selection of a work among others, we introduce a new transformation to capture the co-existence of citations' effects and collaboration behaviors.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116572699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085949
B. Silva, C. Costa, D. Zaupa, Gustavo Freitas
With the latest technological advancements and the popularization of mobile devices nowadays, software development has evolved towards mobility. One of the main uses of mobile devices is to access social networks. They are becoming important tools in people's life. In this context, the Mingle project has the objective of creating a spontaneous social networks that is mainly accessed by mobile devices, such as smartphones. Mingle uses the concepts of ubiquitous computing to create a notion of spontaneity, i.e, providing a social network adapted to the persons specific location. This article has the goal of presenting an ontology and the persistence model for managing the information inside a specific location (called “Cell” in our model). To evaluate our proposal, two technics were applied: lexical evaluation and application-level evaluation. The first assessment employs the Levenshtein edit distance and compares Mingle with other popular ontologies in the field, while the second one evaluates if we deal with all Mingle requirements.
{"title":"An ontology-based repository for a spontaneous social network","authors":"B. Silva, C. Costa, D. Zaupa, Gustavo Freitas","doi":"10.1109/CASON.2011.6085949","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085949","url":null,"abstract":"With the latest technological advancements and the popularization of mobile devices nowadays, software development has evolved towards mobility. One of the main uses of mobile devices is to access social networks. They are becoming important tools in people's life. In this context, the Mingle project has the objective of creating a spontaneous social networks that is mainly accessed by mobile devices, such as smartphones. Mingle uses the concepts of ubiquitous computing to create a notion of spontaneity, i.e, providing a social network adapted to the persons specific location. This article has the goal of presenting an ontology and the persistence model for managing the information inside a specific location (called “Cell” in our model). To evaluate our proposal, two technics were applied: lexical evaluation and application-level evaluation. The first assessment employs the Levenshtein edit distance and compares Mingle with other popular ontologies in the field, while the second one evaluates if we deal with all Mingle requirements.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114384936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085953
R. Marques, A. Zúquete
Anonymous communication systems have been around for sometime, providing anonymity, enhanced privacy, and censorship circumvention. A lot has been done, since Chaum's seminal paper on mix networks, in preventing attacks able to undermine the anonymity provided by these systems. This, however, is goal difficult to achieve due to the de-centralized nature of these systems. In the end it boils down to finding a subset of trusted nodes to be placed in critical positions of the communication path. But the question remains: “How to know if a given node can be trusted?”. In this paper we present a survey of a new research area which goal is to exploit trust in social links to solve some of the shortcomings of anonymous communication systems. Recent research shows that by using social networking features it is possible to prevent traffic analysis attacks and even detect Sybil attacks.
{"title":"Social networking for anonymous communication systems: A survey","authors":"R. Marques, A. Zúquete","doi":"10.1109/CASON.2011.6085953","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085953","url":null,"abstract":"Anonymous communication systems have been around for sometime, providing anonymity, enhanced privacy, and censorship circumvention. A lot has been done, since Chaum's seminal paper on mix networks, in preventing attacks able to undermine the anonymity provided by these systems. This, however, is goal difficult to achieve due to the de-centralized nature of these systems. In the end it boils down to finding a subset of trusted nodes to be placed in critical positions of the communication path. But the question remains: “How to know if a given node can be trusted?”. In this paper we present a survey of a new research area which goal is to exploit trust in social links to solve some of the shortcomings of anonymous communication systems. Recent research shows that by using social networking features it is possible to prevent traffic analysis attacks and even detect Sybil attacks.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"120 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128487222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085959
Afsaneh Madani, Saed Rezayi, Hossein Gharaee
With the widespread use of information, variety of security logs have increased greatly, which due need for security log management. Organizations requirements have imposed to collect, store, and analyze tremendous volumes of log data across entire infrastructure for extended durations and at increasingly granular levels. It is the process of generating, transmitting, storing, analyzing, and disposing security log data from network to databases. Due to the wide variety of logs, storing comprises different methods. Recorded events in collection module are processed, normalized and classified. Logs are stored in storage module in order to use in forensic, reviewing, auditing and providing further necessities of correlation module. Routine log correlation analysis is beneficial for identifying security incidents, policy violations, fraudulent activities, troubleshooting and operational network problems. So log management is an important and efficient activity in network monitoring. Finding an effective log management functional architecture for network events analysis is the main goal of this paper. In this paper, we aim to suggest log management architecture with more common functions that are used by vendors. By studying logging architectures the main functions are administration of log collection, normalizing, categorization, queuing prioritizing and storing logged events/alarms by sensors. Log functions are different but the suitable architecture must justify the functions to send a normative, synchronized and prioritized log in an efficient way. The mentioned functions are gathered from SIEM products characteristics. Suggested architecture includes functions and activities in log collection server and storage server.
{"title":"Log management comprehensive architecture in Security Operation Center (SOC)","authors":"Afsaneh Madani, Saed Rezayi, Hossein Gharaee","doi":"10.1109/CASON.2011.6085959","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085959","url":null,"abstract":"With the widespread use of information, variety of security logs have increased greatly, which due need for security log management. Organizations requirements have imposed to collect, store, and analyze tremendous volumes of log data across entire infrastructure for extended durations and at increasingly granular levels. It is the process of generating, transmitting, storing, analyzing, and disposing security log data from network to databases. Due to the wide variety of logs, storing comprises different methods. Recorded events in collection module are processed, normalized and classified. Logs are stored in storage module in order to use in forensic, reviewing, auditing and providing further necessities of correlation module. Routine log correlation analysis is beneficial for identifying security incidents, policy violations, fraudulent activities, troubleshooting and operational network problems. So log management is an important and efficient activity in network monitoring. Finding an effective log management functional architecture for network events analysis is the main goal of this paper. In this paper, we aim to suggest log management architecture with more common functions that are used by vendors. By studying logging architectures the main functions are administration of log collection, normalizing, categorization, queuing prioritizing and storing logged events/alarms by sensors. Log functions are different but the suitable architecture must justify the functions to send a normative, synchronized and prioritized log in an efficient way. The mentioned functions are gathered from SIEM products characteristics. Suggested architecture includes functions and activities in log collection server and storage server.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124650484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085917
J. Kawash
In this paper, we model social networks from a memory-consistency perspective, which is based on partial order constraints of interaction histories. Unlike previous research which focuses on studying social interaction, our modelling is targeted for virtual community application designers. An intuitive collaboration model (post-reply) is formally defined, where social network participants interact through a collection of shared objects. Then, two distribution models for these shared objects are formally defined, one is based on replication and the other is based on partitioning of the shared objects. We prove that if interaction is limited to three operations: POST, REPLY, and QUERY, then these distribution models passively admit post-reply. However, if the social network allows UPDATE actions, then the social network implementation requires additional synchronization measures between the replicas or partitions in order to correctly support post-reply collaboration.
{"title":"Distributed collaboration models for social networks","authors":"J. Kawash","doi":"10.1109/CASON.2011.6085917","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085917","url":null,"abstract":"In this paper, we model social networks from a memory-consistency perspective, which is based on partial order constraints of interaction histories. Unlike previous research which focuses on studying social interaction, our modelling is targeted for virtual community application designers. An intuitive collaboration model (post-reply) is formally defined, where social network participants interact through a collection of shared objects. Then, two distribution models for these shared objects are formally defined, one is based on replication and the other is based on partitioning of the shared objects. We prove that if interaction is limited to three operations: POST, REPLY, and QUERY, then these distribution models passively admit post-reply. However, if the social network allows UPDATE actions, then the social network implementation requires additional synchronization measures between the replicas or partitions in order to correctly support post-reply collaboration.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132883869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085925
M. Takaffoli, Justin Fagnan, Farzad Sangi, Osmar R Zaiane
Social network analysis is a discipline that has emerged to analyze social structures and information networks to uncover patterns of interaction among the vertices in the network. Most social networks are dynamic, and studying the evolution of these networks over time could provide insight into the behavior of individuals expressed by the nodes in the graph and the flow of information among them. In a dynamic network, communities, which are groups of densely interconnected nodes, are affected by changes in the underlying population. The analysis of communities and their evolutions can help determine the shifting structural properties of the networks. We present a framework for modeling and detecting community evolution over time. First, our proposed community matching algorithm efficiently identifies and tracks similar communities over time. Then, a series of significant events and transitions are defined to characterize the evolution of networks in terms of its communities and individuals. We also propose two metrics called stability and influence metrics to describe the active behavior of the individuals. We present experiments to explore the dynamics of communities on the Enron email and DBLP datasets. Evaluating the events using topics extracted from the detected communities demonstrates that we can successfully track communities over time in real datasets.
{"title":"Tracking changes in dynamic information networks","authors":"M. Takaffoli, Justin Fagnan, Farzad Sangi, Osmar R Zaiane","doi":"10.1109/CASON.2011.6085925","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085925","url":null,"abstract":"Social network analysis is a discipline that has emerged to analyze social structures and information networks to uncover patterns of interaction among the vertices in the network. Most social networks are dynamic, and studying the evolution of these networks over time could provide insight into the behavior of individuals expressed by the nodes in the graph and the flow of information among them. In a dynamic network, communities, which are groups of densely interconnected nodes, are affected by changes in the underlying population. The analysis of communities and their evolutions can help determine the shifting structural properties of the networks. We present a framework for modeling and detecting community evolution over time. First, our proposed community matching algorithm efficiently identifies and tracks similar communities over time. Then, a series of significant events and transitions are defined to characterize the evolution of networks in terms of its communities and individuals. We also propose two metrics called stability and influence metrics to describe the active behavior of the individuals. We present experiments to explore the dynamics of communities on the Enron email and DBLP datasets. Evaluating the events using topics extracted from the detected communities demonstrates that we can successfully track communities over time in real datasets.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129588737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1109/CASON.2011.6085941
Antoine Fressacourt, Colombe Hérault, Marie Blin, Stéphane Cauchie
In this article, we suggest a mechanism to ease privacy management in social networks. This mechanism is based on a relationship model which renders the asymmetry and the diversity of real-life relationships between peers. This model defines attributes that are used in an attribute-based encryption system which protects both user information and exchanged data within the social network. This project is currently a work in progress and the ideas developed here will be confirmed during an extensive implementation and testing phase.
{"title":"Enabling fine-tuned relationship and privacy in social networks","authors":"Antoine Fressacourt, Colombe Hérault, Marie Blin, Stéphane Cauchie","doi":"10.1109/CASON.2011.6085941","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085941","url":null,"abstract":"In this article, we suggest a mechanism to ease privacy management in social networks. This mechanism is based on a relationship model which renders the asymmetry and the diversity of real-life relationships between peers. This model defines attributes that are used in an attribute-based encryption system which protects both user information and exchanged data within the social network. This project is currently a work in progress and the ideas developed here will be confirmed during an extensive implementation and testing phase.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"22 6S 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133133343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：