2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing最新文献_第7页

Provable Synthetic Coordinates for Increasing PoWs Effectiveness against DoS and Spam 提高战俘抵抗DoS和垃圾邮件有效性的可证明综合坐标

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.96

Marius Cristea, B. Groza

引用次数: 0

The Ones that Got Away: False Negative Estimation Based Approaches for Gold Farmer Detection 逃跑的人:基于假阴性估计的黄金农民检测方法

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.125

Atanu Roy, M. Ahmad, Chandrima Sarkar, Brian Keegan, J. Srivastava

{"title":"The Ones that Got Away: False Negative Estimation Based Approaches for Gold Farmer Detection","authors":"Atanu Roy, M. Ahmad, Chandrima Sarkar, Brian Keegan, J. Srivastava","doi":"10.1109/SocialCom-PASSAT.2012.125","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.125","url":null,"abstract":"The problem of gold farmer detection is the problem of detecting players with illicit behaviors in massively multiplayer online games (MMOs) and has been studied extensively. Detecting gold farmers or other deviant actors in social systems is traditionally understood as a binary classification problem, but the issue of false negatives is significant for administrators as residual actors can serve as the backbone for subsequent clandestine organizing. In this paper we address this gap in the literature by addressing the problem of false negative estimation for gold farmers in MMOs by employing the capture-recapture technique for false negative estimation and combine it with graph clustering techniques to determine \"hidden\" gold farmers in social networks of farmers and normal players. This paper redefines the problem of gold farming as a false negative estimation problem and estimates the gold farmers in co-extensive MMO networks, previously undetected by the game administrators. It also identifies these undetected gold farmers using graph partitioning techniques and applies network data to address rare class classification problem. The experiments in this research found 53% gold farmers who were previously undetected by the game administrators.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123845890","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}

引用次数: 15

Differential Privacy through Knowledge Refinement 基于知识精化的差分隐私

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.26

Jordi Soria-Comas, J. Domingo-Ferrer

引用次数: 3

Agent Trust Management Based on Human Plausible Reasoning: Application to Web Search 基于人类似是而非推理的代理信任管理:在Web搜索中的应用

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.72

Sadra Abedinzadeh, S. Sadaoui

{"title":"Agent Trust Management Based on Human Plausible Reasoning: Application to Web Search","authors":"Sadra Abedinzadeh, S. Sadaoui","doi":"10.1109/SocialCom-PASSAT.2012.72","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.72","url":null,"abstract":"In open systems, different service providers can join and leave at any time. Multi Agent Systems (MASs) are being used more and more as the basis of open systems. Although openness brings a huge opportunity for different systems to operate in a decoupled and autonomous manner, it can introduce untrustworthy agents into the society. For this purpose, Agent Trust Management (ATM) methods have been proposed to try to eliminate this defect. This paper presents a general framework for managing trust in MASs based on the theory of Human Plausible Reasoning (HPR). The goal of the proposed framework is to determine for each user a ranked list of trusted agents and to find newer possible trust relationships between users and agents. We use the HPR certainty parameters to define how trustworthy each agent is in the list. We measure the agent trust according to two metrics: the direct interaction rating and third-party references. For each user, a third party is any other user with whom a HPR relationship exists. We aggregate the direct interaction rating value and the reputation values of third parties to achieve a single quantitative value for the trust. This value is then used to rank the agents. We apply our HPR-based ATM framework to the domain of Web search. The resulting ATM system provides the user a list of trusted search engines ranked according to the reputation the search engine has gained by interacting with other related users as well as the retrieval precision of pages returned in response to the user's query.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123430561","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}

引用次数: 6

Factors that Influence the Choice of Privacy Settings on Facebook: Freshmen's View at a South African University 影响Facebook隐私设置选择的因素:一所南非大学新生的观点

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.36

P. Ntlatywa, R. Botha, B. Haskins

{"title":"Factors that Influence the Choice of Privacy Settings on Facebook: Freshmen's View at a South African University","authors":"P. Ntlatywa, R. Botha, B. Haskins","doi":"10.1109/SocialCom-PASSAT.2012.36","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.36","url":null,"abstract":"A contradiction between the reported privacy concerns and observed privacy behaviour of users of social networking sites has been reported. To understand this contradiction this paper examines factors that influence privacy behaviour of users on social networking sites. Participants in this study were freshmen studying IT recruited from Nelson Mandela Metropolitan University during the academic year of 2011. A questionnaire was used to study the reported privacy concerns of the participants, followed by observations on the public Facebook profiles of the participants to shed light on their actual behaviour. Interviews exposed factors that negatively influence privacy behaviour, while another questionnaire explored factors that positively influence privacy behaviour. This study shows that the contradiction between privacy concerns and observed privacy behaviour varies according to the type of information in question. Based on the findings, we developed a model that identifies factors that users consider when choosing privacy settings on Facebook.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127505856","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}

引用次数: 4

Privacy Preserving Maximum-Flow Computation in Distributed Graphs 分布式图中保护隐私的最大流计算

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.20

Xiaoyun He, Jaideep Vaidya, Basit Shafiq, N. Adam

{"title":"Privacy Preserving Maximum-Flow Computation in Distributed Graphs","authors":"Xiaoyun He, Jaideep Vaidya, Basit Shafiq, N. Adam","doi":"10.1109/SocialCom-PASSAT.2012.20","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.20","url":null,"abstract":"The maximum-flow problem arises in a wide variety of applications such as financial transactions and logistics collaboration networks, where the data can be modeled as a directed graph. In many such applications, the graph data is actually distributed across several organizations where each owns a portion of the overall graph. Due to privacy concerns, the parties may not wish to disclose their local graphs. However, the computation of maximum-flow over the overall graph brings great benefits to concerned stakeholders. In this paper, we address the privacy preserving maximum-flow computation problem in distributed graphs. We propose a two-stage approach that achieves privacy protection while ensuring the correct maximum flow computation. In the first stage, a novel probabilistic edge expansion process is used to obfuscate the graph structure and prevent node re-identification while preserving the maximum flow, the second stage securely integrates local graphs into a global whole such that any third party can then compute the maximum flow. We provide a thorough correctness and privacy analysis and experimentally evaluate the proposed approach.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125381693","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}

引用次数: 2

Private (t,n) Threshold Searching on Streaming Data Private (t,n)流数据阈值搜索

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.47

X. Yi, C. Xing

引用次数: 8

Social and Emotional Turn Taking for Embodied Conversational Agents 具身会话代理的社会和情感转向

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.29

Merijn Bruijnes

引用次数: 9

Centrality Analysis, Role-Based Clustering, and Egocentric Abstraction for Heterogeneous Social Networks 异构社会网络的中心性分析、基于角色的聚类和自我中心抽象

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.59

Cheng-te Li, Shou-de Lin

{"title":"Centrality Analysis, Role-Based Clustering, and Egocentric Abstraction for Heterogeneous Social Networks","authors":"Cheng-te Li, Shou-de Lin","doi":"10.1109/SocialCom-PASSAT.2012.59","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.59","url":null,"abstract":"The social network is a powerful data structure allowing the depiction of relationship information between entities. Recent researchers have proposed many successful methods on analyzing homogeneous social networks assuming only a single type of node and relation. Nevertheless, real-world complex networks are usually heterogeneous, which presumes a network can be composed of different types of nodes and relations. In this paper, we propose an unsupervised tensor-based mechanism considering higher-order relational information to model the complex semantics of a heterogeneous social network. Based on the model we present solutions to three critical issues in heterogeneous networks. The first concerns identifying central nodes in the heterogeneous network. Second, we propose a role-based clustering method to identify nodes which play similar roles in the network. Finally, we propose an egocentric abstraction mechanism to facilitate further explorations in a complex social network. The evaluations are conducted on a real-world movie dataset and an artificial crime dataset with promising results.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132833123","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}

引用次数: 10

Dimensionality Reduction for Emotional Speech Recognition 情感语音识别的降维方法

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.83

Pouria Fewzee, F. Karray

引用次数: 32