{"title":"A Mechanism for Handling Internal Threats of IMS Based Push to Talk and Push to Multimedia Service","authors":"Zeeshan Shafi Khan, Aneel Rahim, F. B. Muhaya","doi":"10.1109/FUTURETECH.2010.5482694","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482694","url":null,"abstract":"Capabilities like Instant Messaging (IM), real-time video transfer and file transfer converts the Push to Talk (PTT) Service into a new one, known as Push to Multimedia (PTM). In PTT and PTM an authenticated user can be deleted from the session by the session administrator (initiator). Deletion of an authenticated user by a single authority may results in dispute among the remaining authenticated members. So in this paper we present a distributed mechanism to delete an authenticated user (who starts to act maliciously after authentication) from an ongoing session. Moreover a user may use the floor for the long period of time. No mechanism is defined to preset the maximum time for the floor use in a single turn. In this paper we also give a mechanism to define the maximum time for floor use at the start of the session. This time can vary from user to user. These features on one side secure the PTT and PTM service and on the other side enrich these services.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131590251","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}
S. Hsieh, Chao-Wen Huang, Yi-Ling Huang, Ying-Chi Yang
{"title":"A Novel Dynamic Router-Tables Design for IP Lookup and Update","authors":"S. Hsieh, Chao-Wen Huang, Yi-Ling Huang, Ying-Chi Yang","doi":"10.1109/FUTURETECH.2010.5482735","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482735","url":null,"abstract":"IP lookup affects the speed of an incoming packet and the time required to determine which output port the packet should be sent to; hence, it plays an important role in the design of router-tables. In this paper, we propose a new data structure, called a multi-prefix trie, for use in designing dynamic router-tables. One key feature of our data structure is that each node can store more than one prefix, which reduces the number of memory accesses. When performing lookup, the structure can search more prefixes in one node and may find the longest matching prefix in an internal node rather than on a leaf. Moreover, when updating the router-table, it does not need to reconstruct the table. As a by-product, the proposed data structure minimizes the time required for dynamic router-table operations, including lookup, insertion, and deletion, and also reduces the number of memory accesses. We report the results of experiments conducted to compare the proposed data structure with other structures using the benchmark IPv4 prefix database AS4637 with 219,581 prefixes. end{abstract}","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134645177","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}
{"title":"Lip Reading Based Surveillance System","authors":"H. Mahmoud, F. B. Muhaya, Alaaeldin M. Hafez","doi":"10.1109/FUTURETECH.2010.5482688","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482688","url":null,"abstract":"In this paper we propose a lip reading recognition technique designed to be a part of a surveillance system and will be used for physical security. The proposed technique would be used for security issues using motion estimation analysis, applying a new five step search block matching algorithm.. The proposed technique is characterized by high speed performance suitable for real time applications. The three-step search (TSS) algorithm has been widely used as the motion estimation technique in some low bit-rate video compression applications, owing to its simplicity and effectiveness. However, TSS uses a uniformly allocated checking point pattern in its first step, which becomes inefficient for the estimation of small motions. The lip recognition technique deemed valuable in fast recognition of lip reading that can be used in security paradigm for real time applications like password entries that are shoulder surfing resilient.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130146955","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}
{"title":"Multimedia Information Security Architecture Framework","authors":"H. Susanto, F. B. Muhaya","doi":"10.1109/FUTURETECH.2010.5482696","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482696","url":null,"abstract":"This paper presents a state-of-the-art overview of distinguishable approaches, overview of some writings that have themes and a similar discussion, with the background to provide an overview to the readers of control and things related to multimedia information security, all attempting to define multimedia information security architecture, followed by a proposition of requirements for multimedia integrated security architecture. There is no standardized and comprehensive of multimedia information security architecture currently exists. Multimedia information security as part of Information security has holistic approach towards the implementation of information security by introducing the concept and model of multimedia security architecture.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115278158","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}
M. Salehi, A. Azarpeyvand, F. Firouzi, A. Yazdanbakhsh
{"title":"Reliability Analysis of Embedded Applications in Non-Uniform Fault Tolerant Processors","authors":"M. Salehi, A. Azarpeyvand, F. Firouzi, A. Yazdanbakhsh","doi":"10.1109/FUTURETECH.2010.5482675","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482675","url":null,"abstract":"Soft error analysis has been greatly aided by the concept of Architectural vulnerability Factor (AVF) and Architecturally Correct Execution (ACE). The AVF of a processor is defined as the probability that a bit flip in the processor architecture will result in a visible error in the final output of a program. In this work, we exploit the techniques of AVF analysis to introduce a software-level vulnerability analysis. This metric allows insight into the vulnerability of instruction and software to hardware faults with a micro-architectural involved fault injection method. The proposed metric can be used to make judgments about the reliability of different programs on different processors with regard to architectural and compiler guidelines for improving the processor reliability.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132917786","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}
M. Khalil, Dzulkifli Muhammad, M. Khan, K. Alghathbar
{"title":"Fingerprint Verification Based on Statistical Analysis","authors":"M. Khalil, Dzulkifli Muhammad, M. Khan, K. Alghathbar","doi":"10.1109/FUTURETECH.2010.5482771","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482771","url":null,"abstract":"In this paper, we have statistically analyzed biometric-fingerprint images for personal identification. A sub-image of 129 x 129 was extracted from the original image and transformed into a co-occurrence matrix. Four different type of relative position distances were used to generate the matrices. The results have been analyzed by the Program for Rate Estimation and Statistical Summaries (PRESS). The efficiency of the proposed method has been demonstrated by the experimental results and that the further the distances of the relative position the lower the error equal rate.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116209772","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}
M. Santhi, G. Seetharaman, R. Silwal, G. Lakshminarayanan
{"title":"A Novel Online Clock Skew Scheme for FPGA Based Asynchronous Wave-Pipelined Circuits","authors":"M. Santhi, G. Seetharaman, R. Silwal, G. Lakshminarayanan","doi":"10.1109/FUTURETECH.2010.5482689","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482689","url":null,"abstract":"A new online clock skew scheme is proposed in this paper to improve the performance of the asynchronous wave-pipelined circuits. Previous papers implemented on wave-pipelining circuits used complex circuitry for adjusting the clock period and clock skews in offline condition. The proposed low complexity control circuit generates enable signal for enabling the output latch(s) during stable period depending on the clock speed in online condition. The proposed technique is evaluated by implementing filters using Distributed Arithmetic Algorithm (DAA) by using 3 different schemes: non-pipelining, pipelining and wave-pipelining on Altera Stratix II and Cyclone II FPGAs; 4-tap FIR filter on Stratix II and 8-tap FIR filter on Cyclone II FPGA. For the 4-tap filter implemented in Stratix II, wave-pipelined DA filter is faster by a factor of 1.36 compared to the non-pipelined one. The pipelined filter is faster by a factor of 1.38 compared to wave-pipelined one but at the cost of increased logic utilization by 115.69%. For the 8-tap filter implemented in Cyclone II, wave-pipelined DA filters is faster by a factor of 1.40 compared to the non-pipelined one. The pipelined filter is faster by a factor of 2.14 compared to wave-pipelined one but at the cost of increased registers by 569.69% and LEs by 74.9%. The dynamic power for the 4-tap DA wave-pipelined filter implemented in Stratix II is less by approx. 8% compared to pipelined and greater by approx. 28% compared to non-pipelined circuits.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124597617","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}
{"title":"On Usage Control of Multimedia Content in and through Cloud Computing Paradigm","authors":"T. Ali, M. Nauman, Fazl e Hadi, F. B. Muhaya","doi":"10.1109/FUTURETECH.2010.5482751","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482751","url":null,"abstract":"Multimedia content dissemination is a complex problem because of the multitude of policy types that providers may wish to associate with their content. There have been quite a few efforts at defining security policies and models which can cater to these types of requirements. Usage control models are the new breed of access control models that allow description of comprehensive policies for usage of protected content. In this paradigm, decisions regarding access to objects is not limited to request time only. It is coupled with the usage of the protected objects and becomes a continuous process carried out in parallel to the usage. The realization of usage control has been a long standing research problem to overcome the issue of loss of control in secure document dissemination. With the emergence of cloud computing, documents are stored in the cloud, the document viewers and editors themselves reside in the cloud and are accessed from thin clients such as browsers. We note that such scenarios provide an ideal opportunity for the realization of usage control for securing the usage of documents based on the stakeholders' policies. In this paper, we argue for a better realization of different features of the UCON model in the cloud based applications. We propose a robust architecture to provide fine-grained control over usage of protected objects through the use of emerging cloud computing paradigm. We present the design principles for this realization and discuss our prototype implementation of the proposed architecture.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115999714","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}
{"title":"An Efficient Ear Identification System","authors":"D. Kisku, Sandesh Gupta, Phalguni Gupta, J. Sing","doi":"10.1109/FUTURETECH.2010.5482749","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482749","url":null,"abstract":"This paper proposes a robust ear identification system which is developed by fusing SIFT features of color segmented slice regions of an ear. It makes use of Gaussian mixture model (GMM) to build ear model with mixture of Gaussian using vector quantization algorithm and K-L divergence is applied to the GMM framework for recording the color similarity in the specified ranges by comparing color similarity between a pair of reference ear and probe ear. SIFT features are extracted from each color slice region as a part of invariant feature extraction. The extracted keypoints are then fused separately by the two fusion approaches, namely concatenation and the Dempster-Shafer theory. Finally, the fusion approaches generate two independent augmented feature vectors for identification of individuals separately. The proposed technique is tested on IIT Kanpur ear database of 400 individuals and is found to achieve 98.25% accuracy for identification of top 5 best matches.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129133789","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}
{"title":"Towards Fraud Detection Methodologies","authors":"Tareq Z. Allan, J. Zhan","doi":"10.1109/FUTURETECH.2010.5482631","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482631","url":null,"abstract":"Fraud and abuse have led to significant additional expense in the banking and financial system of the United States. This paper aims to provide a comprehensive survey of the statistical methods applied to banking and financial fraud detection, with focuses on classifying fraudulent behaviors, identifying the major sources and characteristics of the data based on which fraud detection has been conducted, discussing the key steps in data preprocessing, as well as summarizing, categorizing, and comparing statistical fraud detection methods.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132091179","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}