Anonymization is a widely used technique for the private publication of social network data. However, since the existing social network anonymization methods consider only one-time releases, they only reserve the static utility of the anonymized data. As social network evolves, these methods have posed severe challenges to the emerging requirement of dynamic social network analysis, which requires the dynamic utility of an evolving social network to be reserved for analysis. Instead of proposing a new anonymization method to handle dynamics, in this paper, we address these challenges by rebuilding connections between the sequentially published, anonymized data. By doing so, we have enabled a broad range of dynamic analysis to be applied to those already anonymized data without re-generating them. This suggests that our method is transparent to both the existing anonymization methods and the anonymized data. We adopt a combination of data-mining and graph-matching techniques to accomplish this task. The effectiveness of our method has been demonstrated on a series of real, dynamic social network data.
{"title":"Enabling Dynamic Analysis of Anonymized Social Network Data","authors":"Xuan Ding, Wei Wang","doi":"10.1109/CyberC.2012.13","DOIUrl":"https://doi.org/10.1109/CyberC.2012.13","url":null,"abstract":"Anonymization is a widely used technique for the private publication of social network data. However, since the existing social network anonymization methods consider only one-time releases, they only reserve the static utility of the anonymized data. As social network evolves, these methods have posed severe challenges to the emerging requirement of dynamic social network analysis, which requires the dynamic utility of an evolving social network to be reserved for analysis. Instead of proposing a new anonymization method to handle dynamics, in this paper, we address these challenges by rebuilding connections between the sequentially published, anonymized data. By doing so, we have enabled a broad range of dynamic analysis to be applied to those already anonymized data without re-generating them. This suggests that our method is transparent to both the existing anonymization methods and the anonymized data. We adopt a combination of data-mining and graph-matching techniques to accomplish this task. The effectiveness of our method has been demonstrated on a series of real, dynamic social network data.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125968557","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}
This paper presents arithmetic operations on elliptic curves defined over an un-conventional number system character digit element finite field. A high speed elliptic curve scalar multiplication algorithm in this special field domain is also presented. The heuristically-obtained results show the efficient nature of the proposed elliptic curve arithmetic operations.
{"title":"Arithmetic Operations on Elliptic Curves Defined over Un-conventional Element Finite Fields","authors":"M. N. Daikpor, O. Adegbenro","doi":"10.1109/CyberC.2012.29","DOIUrl":"https://doi.org/10.1109/CyberC.2012.29","url":null,"abstract":"This paper presents arithmetic operations on elliptic curves defined over an un-conventional number system character digit element finite field. A high speed elliptic curve scalar multiplication algorithm in this special field domain is also presented. The heuristically-obtained results show the efficient nature of the proposed elliptic curve arithmetic operations.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130237984","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}
A trust-based intrusion detection scheme for hybrid cloud computing is proposed. We consider a trust metric based on honesty, cooperation and efficiency for detecting malicious machines. We use Perron-Frobenius theorem to detect intrusion based on trust and observations. By statistically analyzing pair trust distributed results, the portal of the application applies trust-based intrusion detection to assess the trustworthiness and maliciousness. An analytical model and simulation for performance are developed. We analyze the sensitivity of false alarms with respect to the minimum trust threshold below which a node is considered malicious. Results confirm that our proposal is flexible enough to detect malicious behaviours considering various parameters. This work can guide future execution in the cloud resource.
{"title":"Enforcing Trust-Based Intrusion Detection in Cloud Computing Using Algebraic Methods","authors":"Amira Bradai, H. Afifi","doi":"10.1109/CyberC.2012.38","DOIUrl":"https://doi.org/10.1109/CyberC.2012.38","url":null,"abstract":"A trust-based intrusion detection scheme for hybrid cloud computing is proposed. We consider a trust metric based on honesty, cooperation and efficiency for detecting malicious machines. We use Perron-Frobenius theorem to detect intrusion based on trust and observations. By statistically analyzing pair trust distributed results, the portal of the application applies trust-based intrusion detection to assess the trustworthiness and maliciousness. An analytical model and simulation for performance are developed. We analyze the sensitivity of false alarms with respect to the minimum trust threshold below which a node is considered malicious. Results confirm that our proposal is flexible enough to detect malicious behaviours considering various parameters. This work can guide future execution in the cloud resource.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115002683","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}
In traditional research on task scheduling algorithms based on user satisfaction, all users can only have the same satisfaction function that means system assumes all users have the same scheduling motivation. But in real distributed system, different users usually have different motivations. To solve this problem, in this paper, we propose a genetic scheduling algorithm based on user overall satisfaction, which is the sum of the value of every user satisfaction. This algorithm supports different satisfaction functions for different users, which meets the requirements of real distributed environment well.
{"title":"A Genetic Algorithm for Task Scheduling Based on User Overall Satisfaction","authors":"Xiaoguang Wang","doi":"10.1109/CyberC.2012.97","DOIUrl":"https://doi.org/10.1109/CyberC.2012.97","url":null,"abstract":"In traditional research on task scheduling algorithms based on user satisfaction, all users can only have the same satisfaction function that means system assumes all users have the same scheduling motivation. But in real distributed system, different users usually have different motivations. To solve this problem, in this paper, we propose a genetic scheduling algorithm based on user overall satisfaction, which is the sum of the value of every user satisfaction. This algorithm supports different satisfaction functions for different users, which meets the requirements of real distributed environment well.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128596662","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}
As the expansion of Internet, the recommender system is attracting the attention of many industry engineers and researcher, especially the collaborating filtering recommender system. However, there are still some challenges. For example, the sparse feature and large scale system degrades the recommendation accuracy and efficiency. In this paper, we propose implied-similarity and filled-default-value methods to improve the denseness of the preference matrix and use GPU to parallel the process. Our experiments show that the accuracy can improve 20% and efficiency can speed up 4 times.
{"title":"Improving the Collaborative Filtering Recommender System by Using GPU","authors":"Gao Zhanchun, Li Yuying","doi":"10.1109/CYBERC.2012.62","DOIUrl":"https://doi.org/10.1109/CYBERC.2012.62","url":null,"abstract":"As the expansion of Internet, the recommender system is attracting the attention of many industry engineers and researcher, especially the collaborating filtering recommender system. However, there are still some challenges. For example, the sparse feature and large scale system degrades the recommendation accuracy and efficiency. In this paper, we propose implied-similarity and filled-default-value methods to improve the denseness of the preference matrix and use GPU to parallel the process. Our experiments show that the accuracy can improve 20% and efficiency can speed up 4 times.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128050510","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}
Reusable anonymous return channels proposed by Golle and Jakobsson allow any recipient of one of the anonymous messages in a mix net to send back one or more replies directly. Yet their protocol has an obvious efficiency problem caused by multiple rounds of message processing. In this paper, we introduce a technique which is based on universal re-encryption and increases the total efficiency of reusable anonymous return channels. Our protocol retains all the significant attributes of the reusable channels, known as compos ability, reusability, transferability and compatibility. And it reduces the processing rounds of a message so as to increase efficiency. Moreover, it produces some new important properties. When using our protocol, even if all the servers in our system are corrupted, they can not gain the information of message content and our system can not be easily used as a decryption oracle. We also improve the efficiency of our original protocol when processing long messages and present a hybrid construction for it. Using Pohlig-Hellman, a message is much shorter in our hybrid construction than it is in our primary construction. As a result, the larger a message is, the more efficient our hybrid construction becomes.
{"title":"An Improved Construction for Reusable Anonymous Return Channels Based on Universal Re-encryption","authors":"Chengqiang Huang, Longhai Li, Shaofeng Fu","doi":"10.1109/CyberC.2012.33","DOIUrl":"https://doi.org/10.1109/CyberC.2012.33","url":null,"abstract":"Reusable anonymous return channels proposed by Golle and Jakobsson allow any recipient of one of the anonymous messages in a mix net to send back one or more replies directly. Yet their protocol has an obvious efficiency problem caused by multiple rounds of message processing. In this paper, we introduce a technique which is based on universal re-encryption and increases the total efficiency of reusable anonymous return channels. Our protocol retains all the significant attributes of the reusable channels, known as compos ability, reusability, transferability and compatibility. And it reduces the processing rounds of a message so as to increase efficiency. Moreover, it produces some new important properties. When using our protocol, even if all the servers in our system are corrupted, they can not gain the information of message content and our system can not be easily used as a decryption oracle. We also improve the efficiency of our original protocol when processing long messages and present a hybrid construction for it. Using Pohlig-Hellman, a message is much shorter in our hybrid construction than it is in our primary construction. As a result, the larger a message is, the more efficient our hybrid construction becomes.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114674802","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}
With the development of the smart grid, power line communications (PLC) is becoming more and more important. Compared with traditional modulation, Orthogonal Frequency Division Multiplexing (OFDM) has the advantages of the full use of spectrum, inherent robustness against narrowband interference, and excellent robustness in multi-path environments. This article is devoted to compare FFT-based OFDM in Broadband-PLC (BB-PLC) with in Narrowband-PLC (NB-PLC), conduct experiments to get the PLC channel characteristics and give some advice to the standard in progress.
{"title":"FFT-Based OFDM in Broadband-PLC and Narrowband-PLC","authors":"Tongfei Zhang, Wenjing Liu","doi":"10.1109/CyberC.2012.86","DOIUrl":"https://doi.org/10.1109/CyberC.2012.86","url":null,"abstract":"With the development of the smart grid, power line communications (PLC) is becoming more and more important. Compared with traditional modulation, Orthogonal Frequency Division Multiplexing (OFDM) has the advantages of the full use of spectrum, inherent robustness against narrowband interference, and excellent robustness in multi-path environments. This article is devoted to compare FFT-based OFDM in Broadband-PLC (BB-PLC) with in Narrowband-PLC (NB-PLC), conduct experiments to get the PLC channel characteristics and give some advice to the standard in progress.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133337607","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}
In recent years, Peer to Peer system has shown tremendous growth enabling millions of concurrent users exchange information seamlessly. Kad is a Kademlia-based Distributed Hash Table implementation in real P2P applications which has millions of simultaneous users as to date. However, it comes with several vulnerable features which allow attacks, especially DDoS attacks. In this paper, we proposed a new DDoS attack caused by changing source IP address in response message of source search. In the proposed attack, there are two types of attackers, which change their KadID as KeywordID for keyword search and File Hash for source search as well. When a normal user selects the keyword and file as target, the user generates unintentionally traffics to a victim. To verify the effectiveness of our attack and its dangerousness, we test our scheme in Kad network. Our results show the potential risk of DDoS attack caused by the weakness of the Kad network.
{"title":"DDoS Attack by File Request Redirection in Kad P2P Network","authors":"Yeonju Lee, Kwangsoo Kim, B. Roh","doi":"10.1109/CyberC.2012.91","DOIUrl":"https://doi.org/10.1109/CyberC.2012.91","url":null,"abstract":"In recent years, Peer to Peer system has shown tremendous growth enabling millions of concurrent users exchange information seamlessly. Kad is a Kademlia-based Distributed Hash Table implementation in real P2P applications which has millions of simultaneous users as to date. However, it comes with several vulnerable features which allow attacks, especially DDoS attacks. In this paper, we proposed a new DDoS attack caused by changing source IP address in response message of source search. In the proposed attack, there are two types of attackers, which change their KadID as KeywordID for keyword search and File Hash for source search as well. When a normal user selects the keyword and file as target, the user generates unintentionally traffics to a victim. To verify the effectiveness of our attack and its dangerousness, we test our scheme in Kad network. Our results show the potential risk of DDoS attack caused by the weakness of the Kad network.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133460355","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}
Software Communication Architecture (SCA) is an open architecture specification for the development of Software Defined Radios (SDRs). OSSIE (Open Source SCA Implementation: Embedded) is an SCA-compliant SDR framework which provides additional tools for experimentation and rapid prototype development. OSSIE framework has stabilized and reached a level of maturity for desktop environment. Therefore there is a need to target new devices and hardware platforms because ultimately SDR's will find most of their applications in embedded forms. In this work OSSIE and its dependencies have been ported to a custom designed embedded SDR platform, based on Texas Instrument's DAVINCI technology System on Chip (SoC). Open Embedded has been used for this port which is a complete build system for embedded platforms. Successful OSSIE port has been verified by building and executing a test waveform on this SDR platform.
{"title":"Porting of OSSIE on Texas Instrument's DAVINCI SoC Based SDR Platform","authors":"Saleh Usman, Asad Mahmood, Muhammad Rehan Ashraf","doi":"10.1109/CyberC.2012.58","DOIUrl":"https://doi.org/10.1109/CyberC.2012.58","url":null,"abstract":"Software Communication Architecture (SCA) is an open architecture specification for the development of Software Defined Radios (SDRs). OSSIE (Open Source SCA Implementation: Embedded) is an SCA-compliant SDR framework which provides additional tools for experimentation and rapid prototype development. OSSIE framework has stabilized and reached a level of maturity for desktop environment. Therefore there is a need to target new devices and hardware platforms because ultimately SDR's will find most of their applications in embedded forms. In this work OSSIE and its dependencies have been ported to a custom designed embedded SDR platform, based on Texas Instrument's DAVINCI technology System on Chip (SoC). Open Embedded has been used for this port which is a complete build system for embedded platforms. Successful OSSIE port has been verified by building and executing a test waveform on this SDR platform.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"26 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133754215","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}
In this paper, a new method to improve system performance is presented. In Het-Net of LTE-Advanced system different cells are loaded with difference number of User Equipment (UE). This is because the different transmission powers between macro cell and pico cell are used and the UE moves randomly in the network. Sometimes, a cell could be overloading to server many UEs such that the frequency resource is used up. Due to overload, the throughput of each US is significantly reduced. However, other cells may still be lightly loaded while serving a small number of UEs. The imblanance of the resource degrades the network performance. In this paper, we analyze the load balance problem and an approach is proposed to improve the system performance.
{"title":"Analysis and Simulation of New Method in LTE-Advanced System to Improve System Performance","authors":"Gao Qiang, Yunjie Yuan","doi":"10.1109/CyberC.2012.85","DOIUrl":"https://doi.org/10.1109/CyberC.2012.85","url":null,"abstract":"In this paper, a new method to improve system performance is presented. In Het-Net of LTE-Advanced system different cells are loaded with difference number of User Equipment (UE). This is because the different transmission powers between macro cell and pico cell are used and the UE moves randomly in the network. Sometimes, a cell could be overloading to server many UEs such that the frequency resource is used up. Due to overload, the throughput of each US is significantly reduced. However, other cells may still be lightly loaded while serving a small number of UEs. The imblanance of the resource degrades the network performance. In this paper, we analyze the load balance problem and an approach is proposed to improve the system performance.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123983078","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
扫码关注我们
求助内容：
应助结果提醒方式：