Fuzzy vault can be used as an encryption framework to protect the user's identity key using the biometric. This framework can provide a balance between fuzzy biometric and the accuracy of cryptography system. In this paper, we propose a method to fuse multi-biometrics and encrypt the key of users based on fuzzy vault. We test this method using the multibiometrics from the same source database made by Shandong University, and the results show the proposed method is more effective.
{"title":"A Dual-Mode Fingerprint Fusion Encryption Method Based on Fuzzy Vault","authors":"Xiaolei Li, Dongmei Sun","doi":"10.1109/CyberC.2012.42","DOIUrl":"https://doi.org/10.1109/CyberC.2012.42","url":null,"abstract":"Fuzzy vault can be used as an encryption framework to protect the user's identity key using the biometric. This framework can provide a balance between fuzzy biometric and the accuracy of cryptography system. In this paper, we propose a method to fuse multi-biometrics and encrypt the key of users based on fuzzy vault. We test this method using the multibiometrics from the same source database made by Shandong University, and the results show the proposed method is more effective.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"7 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":"116758605","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, we investigate the simulation time and wall clock time synchronization problem for High Level Architecture (HLA). We first identify and analyze two drawbacks in the traditional HLA-based time synchronization algorithm. A novel time synchronization algorithm based on synchronization events is then proposed to address these two drawbacks. To verify the proposed algorithm, experiment are conducted in the HLA based distributed and hardware-in-the-loop simulation systems. The experimental result shows that our approach significantly outperforms the traditional algorithms.
{"title":"A Novel Simulation Time and Wall Clock Time Synchronization Algorithm for HLA","authors":"Zexin Jiang","doi":"10.1109/CyberC.2012.50","DOIUrl":"https://doi.org/10.1109/CyberC.2012.50","url":null,"abstract":"In this paper, we investigate the simulation time and wall clock time synchronization problem for High Level Architecture (HLA). We first identify and analyze two drawbacks in the traditional HLA-based time synchronization algorithm. A novel time synchronization algorithm based on synchronization events is then proposed to address these two drawbacks. To verify the proposed algorithm, experiment are conducted in the HLA based distributed and hardware-in-the-loop simulation systems. The experimental result shows that our approach significantly outperforms the traditional algorithms.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"84 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":"117067652","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 multiprocessor environment, resource reservation technology will split the continuous idle resources and generate resource fragments which would reduce resource utilization and job acceptance rate. In this paper, we defined resource fragments produced by resource reservation and proposed scheduling algorithms based on fragment-aware, the designs of which focus on improve acceptance ability of following-up jobs. Based on resource fragment-aware, we proposed two algorithms, Occupation Rate Best Fit and Occupation Rate Worst Fit, and in combination with heuristic algorithms, PE Worst Fit - Occupation Rate Best Fit and PE Worst Fit - Occupation Rate Worst Fit are put forward. We not only realized and analyzed algorithms in simulation, but also studied relationship between task properties and algorithms' performance. Experiments proved that PE Worst Fit - Occupation Worst Fit provides the best job acceptance rate and Occupation Rate Worst Fit has the best performance on average slowdown.
{"title":"Fragment Aware Scheduling for Advance Reservations in Multiprocessor Systems","authors":"Bo Li, Enwei Zhou, Hao Wu, Yijian Pei, Bin Shen","doi":"10.1109/CyberC.2012.54","DOIUrl":"https://doi.org/10.1109/CyberC.2012.54","url":null,"abstract":"In multiprocessor environment, resource reservation technology will split the continuous idle resources and generate resource fragments which would reduce resource utilization and job acceptance rate. In this paper, we defined resource fragments produced by resource reservation and proposed scheduling algorithms based on fragment-aware, the designs of which focus on improve acceptance ability of following-up jobs. Based on resource fragment-aware, we proposed two algorithms, Occupation Rate Best Fit and Occupation Rate Worst Fit, and in combination with heuristic algorithms, PE Worst Fit - Occupation Rate Best Fit and PE Worst Fit - Occupation Rate Worst Fit are put forward. We not only realized and analyzed algorithms in simulation, but also studied relationship between task properties and algorithms' performance. Experiments proved that PE Worst Fit - Occupation Worst Fit provides the best job acceptance rate and Occupation Rate Worst Fit has the best performance on average slowdown.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"120 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":"115757364","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}
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}
The demerits of the texture image retrieval algorithm based on sparse coding are found expression in the low recall and inconspicuous serial priority of qualified images. Several methods are presented in this paper to improve the performance of the image retrieval algorithm. Firstly, Brodatz texture image filter basis function is used for processing the texture images, thereafter, the kurtosis is added to generate the eigenvector, finally, the joint-scale filter basis is utilized to advance the filter effect. Experimental results indicate that the performance of the proposed methods is positive.
{"title":"Improvement of Texture Image Retrieval Algorithm Based on Sparse Coding","authors":"Yansi Yang, Yingyun Yang, Xuan Zeng","doi":"10.1109/CyberC.2012.92","DOIUrl":"https://doi.org/10.1109/CyberC.2012.92","url":null,"abstract":"The demerits of the texture image retrieval algorithm based on sparse coding are found expression in the low recall and inconspicuous serial priority of qualified images. Several methods are presented in this paper to improve the performance of the image retrieval algorithm. Firstly, Brodatz texture image filter basis function is used for processing the texture images, thereafter, the kurtosis is added to generate the eigenvector, finally, the joint-scale filter basis is utilized to advance the filter effect. Experimental results indicate that the performance of the proposed methods is positive.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 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":"121227510","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}
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
扫码关注我们
求助内容：
应助结果提醒方式：