Pub Date : 2014-08-01DOI: 10.1109/ISBAST.2014.7013104
Rong-Jian Chen, Jhen-Wun Fan, Chin-Hao Liao
Galois Field has received a lot of attention because of their important and particular applications in cryptography, channel coding, etc. This paper presents the Reconfigurable Galois Field multiplier used to calculate the Galois field multiplication of different lengths which consists of AND gates and special cells. The special cell makes multiplier architecture easier to extend and calculate arbitrarily length multiplication. The Reconfigurable Galois Field multiplier only uses combinational logic circuits which have been implemented on Xilinx FPGA. The results prove that this work has better performances than other previous similar works.
{"title":"Reconfigurable Galois Field multiplier","authors":"Rong-Jian Chen, Jhen-Wun Fan, Chin-Hao Liao","doi":"10.1109/ISBAST.2014.7013104","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013104","url":null,"abstract":"Galois Field has received a lot of attention because of their important and particular applications in cryptography, channel coding, etc. This paper presents the Reconfigurable Galois Field multiplier used to calculate the Galois field multiplication of different lengths which consists of AND gates and special cells. The special cell makes multiplier architecture easier to extend and calculate arbitrarily length multiplication. The Reconfigurable Galois Field multiplier only uses combinational logic circuits which have been implemented on Xilinx FPGA. The results prove that this work has better performances than other previous similar works.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122428581","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013118
W. Halboob, A. Mamat, R. Mahmod
Several access control policy languages have been proposed for specifying access control policies for push-based XML access control systems. This paper investigates the scalability of the current XML-based policy languages. It starts by introducing the well-known general access control models with more focus on their scalability. Then, the XML-based policy languages are presented followed by evaluating their management and system scalability. This paper founds that there is a need for using decentralized trusted management concept for addressing the scalability issue in XML access control. Also, using IBE will help in providing several access control features as temporal and delegable access.
{"title":"Push-based XML access control policy languages: A review","authors":"W. Halboob, A. Mamat, R. Mahmod","doi":"10.1109/ISBAST.2014.7013118","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013118","url":null,"abstract":"Several access control policy languages have been proposed for specifying access control policies for push-based XML access control systems. This paper investigates the scalability of the current XML-based policy languages. It starts by introducing the well-known general access control models with more focus on their scalability. Then, the XML-based policy languages are presented followed by evaluating their management and system scalability. This paper founds that there is a need for using decentralized trusted management concept for addressing the scalability issue in XML access control. Also, using IBE will help in providing several access control features as temporal and delegable access.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127444690","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013142
Arafat Al-dhaqm, S. H. Othman, S. Razak, Md. Asri Ngadi
Threats which come from database insiders or database outsiders have formed a big challenge to the protection of integrity and confidentiality in many database systems. To overcome this situation a new domain called a Database Forensic (DBF) has been introduced to specifically investigate these dynamic threats which have posed many problems in Database Management Systems (DBMS) of many organizations. DBF is a process to identify, collect, preserve, analyse, reconstruct and document all digital evidences caused by this challenge. However, until today, this domain is still lacks having a standard and generic knowledge base for its forensic investigation methods / tools due to many issues and challenges in its complex processes. Therefore, this paper will reveal an approach adapted from a software engineering domain called metamodelling which will unify these DBF complex knowledge processes into an artifact, a metamodel (DBF Metamodel). In future, the DBF Metamodel could benefit many DBF investigation users such as database investigators, stockholders, and other forensic teams in offering various possible solutions for their problem domain.
{"title":"Towards adapting metamodelling technique for database forensics investigation domain","authors":"Arafat Al-dhaqm, S. H. Othman, S. Razak, Md. Asri Ngadi","doi":"10.1109/ISBAST.2014.7013142","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013142","url":null,"abstract":"Threats which come from database insiders or database outsiders have formed a big challenge to the protection of integrity and confidentiality in many database systems. To overcome this situation a new domain called a Database Forensic (DBF) has been introduced to specifically investigate these dynamic threats which have posed many problems in Database Management Systems (DBMS) of many organizations. DBF is a process to identify, collect, preserve, analyse, reconstruct and document all digital evidences caused by this challenge. However, until today, this domain is still lacks having a standard and generic knowledge base for its forensic investigation methods / tools due to many issues and challenges in its complex processes. Therefore, this paper will reveal an approach adapted from a software engineering domain called metamodelling which will unify these DBF complex knowledge processes into an artifact, a metamodel (DBF Metamodel). In future, the DBF Metamodel could benefit many DBF investigation users such as database investigators, stockholders, and other forensic teams in offering various possible solutions for their problem domain.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134380414","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013135
Mohammed Faez Al-Jaberi, A. Zainal
Cloud computing is the future of computing industry and it is believed to be the next generation of computing technology. Among the major concern in cloud computing is data integrity and privacy. Clients require their data to be safe and private from any tampering or unauthorized access. Various algorithms and protocols (MD5, AES, and RSA-based PHE) are implemented by the various components of this model to provide the maximum levels of integrity management and privacy preservation for data stored in public cloud such as Amazon S3. The impact of algorithms and protocols, used to ensure data integrity and privacy, is studied to test the performance of the proposed model. The prototype system showed that data integrity and privacy are ensured against unauthorized parties. This model reduces the burden of checking the integrity of data stored in cloud storage by utilizing a third party, integrity checking service, and applies security mechanism that ensure privacy and confidentiality of data stored in cloud computing. This paper proposes an architecture based model that provides data integrity verification and privacy preserving in cloud computing.
{"title":"Data integrity and privacy model in cloud computing","authors":"Mohammed Faez Al-Jaberi, A. Zainal","doi":"10.1109/ISBAST.2014.7013135","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013135","url":null,"abstract":"Cloud computing is the future of computing industry and it is believed to be the next generation of computing technology. Among the major concern in cloud computing is data integrity and privacy. Clients require their data to be safe and private from any tampering or unauthorized access. Various algorithms and protocols (MD5, AES, and RSA-based PHE) are implemented by the various components of this model to provide the maximum levels of integrity management and privacy preservation for data stored in public cloud such as Amazon S3. The impact of algorithms and protocols, used to ensure data integrity and privacy, is studied to test the performance of the proposed model. The prototype system showed that data integrity and privacy are ensured against unauthorized parties. This model reduces the burden of checking the integrity of data stored in cloud storage by utilizing a third party, integrity checking service, and applies security mechanism that ensure privacy and confidentiality of data stored in cloud computing. This paper proposes an architecture based model that provides data integrity verification and privacy preserving in cloud computing.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129381684","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013105
S. Kumari, M. Khan, Xiong Li, Rahul Kumar
Recently, Chen et al. proposed a remote user authentication scheme for non-tamper-proof storage devices like Universal Serial Bus (USB) stick. A little later, He et al. found that Chen et al.'s scheme suffers from device stolen attack, insider attack and lack of forward secrecy. He et al. improved the scheme by Chen et al. by presenting another scheme. Nonetheless, we detect some security problems in the scheme by He et al.. We show that He et al.'s scheme is vulnerable to off-line password guessing attack. Besides, an attacker can not only impersonate the user impersonation but can also establish a session key with the server, as a result, the scheme lacks proper mutual authentication. Further, the scheme does not protect user's privacy and a user cannot freely change his password at his will as password updating requires interaction with the server.
{"title":"Notes on “a password-based remote user authentication scheme without smart card”","authors":"S. Kumari, M. Khan, Xiong Li, Rahul Kumar","doi":"10.1109/ISBAST.2014.7013105","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013105","url":null,"abstract":"Recently, Chen et al. proposed a remote user authentication scheme for non-tamper-proof storage devices like Universal Serial Bus (USB) stick. A little later, He et al. found that Chen et al.'s scheme suffers from device stolen attack, insider attack and lack of forward secrecy. He et al. improved the scheme by Chen et al. by presenting another scheme. Nonetheless, we detect some security problems in the scheme by He et al.. We show that He et al.'s scheme is vulnerable to off-line password guessing attack. Besides, an attacker can not only impersonate the user impersonation but can also establish a session key with the server, as a result, the scheme lacks proper mutual authentication. Further, the scheme does not protect user's privacy and a user cannot freely change his password at his will as password updating requires interaction with the server.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128170849","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013106
Xiong Li, M. Khan, S. Kumari, Junguo Liao, W. Liang
User authentication is an important security issue for network based services. Multi-server authentication scheme resolves the repeated registration problem of single-server authentication scenario where the user has to register at different servers to access different types of network services. Recently, Pippal et al. proposed a smart card authentication scheme for multi-server architecture. They claimed that their scheme has some advantages and can resist kinds of attacks. In this paper, we analyze the weaknesses of Pippal et al.'s scheme, and point out that their scheme cannot provide correct authentication, cannot resist impersonation attack, stolen smart card attack, and insider attack. Besides, their scheme is non-extensible when a new server added into the system.
{"title":"Cryptanalysis of a robust smart card authentication scheme for multi-server architecture","authors":"Xiong Li, M. Khan, S. Kumari, Junguo Liao, W. Liang","doi":"10.1109/ISBAST.2014.7013106","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013106","url":null,"abstract":"User authentication is an important security issue for network based services. Multi-server authentication scheme resolves the repeated registration problem of single-server authentication scenario where the user has to register at different servers to access different types of network services. Recently, Pippal et al. proposed a smart card authentication scheme for multi-server architecture. They claimed that their scheme has some advantages and can resist kinds of attacks. In this paper, we analyze the weaknesses of Pippal et al.'s scheme, and point out that their scheme cannot provide correct authentication, cannot resist impersonation attack, stolen smart card attack, and insider attack. Besides, their scheme is non-extensible when a new server added into the system.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126667873","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013132
M. Saleh, A. Manaf
Nowadays, the most distinct threat to the web applications is HTTP-based Denial of Service (DoS) and Distributed Denial of Service (DDoS) attack, which it causes a massive damage to them and corrupt their works completely. Up to now, various researches are accomplished in this field for the sake of identifying and determining the most convenientrequired specifications for a protective solution that helps to protect web applications from HTTP-based DoS and DDoS attacks. Unfortunately, despite of that,the optimal specifications of the protective solution have not been identified, and therefore this paper comes out to state and identify these missing specifications. In this paper, a comprehensive survey to all sorts of HTTP-based DoS and DDoS attacks is conducted in order to figure out and identify the optimal specifications for a protective framework against HTTP-based DoS and DDoS attacks.
{"title":"Optimal specifications for a protective framework against HTTP-based DoS and DDoS attacks","authors":"M. Saleh, A. Manaf","doi":"10.1109/ISBAST.2014.7013132","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013132","url":null,"abstract":"Nowadays, the most distinct threat to the web applications is HTTP-based Denial of Service (DoS) and Distributed Denial of Service (DDoS) attack, which it causes a massive damage to them and corrupt their works completely. Up to now, various researches are accomplished in this field for the sake of identifying and determining the most convenientrequired specifications for a protective solution that helps to protect web applications from HTTP-based DoS and DDoS attacks. Unfortunately, despite of that,the optimal specifications of the protective solution have not been identified, and therefore this paper comes out to state and identify these missing specifications. In this paper, a comprehensive survey to all sorts of HTTP-based DoS and DDoS attacks is conducted in order to figure out and identify the optimal specifications for a protective framework against HTTP-based DoS and DDoS attacks.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126703042","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013102
A. Farra, E. Zahedi
In this paper, a practical educational tool based on Java programming is described. The approach is based on using a fully interactive graphical user interface for teaching cipher algorithms. As an example, a transposition cipher is covered, where students can try different keys and observe the effect of parameters such as key length, choice of letters for the key on the ciphertext. At the same time, the process of breaking the cipher algorithm (cryptanalysis) is rendered possible by students injecting known plaintext. The developed program offers an option where it tries systematically all keys (brute force) to break the cipher. Being extendable, the platform is thought to be able to play a very positive role in the assimilation of abstract concepts encountered during cryptography.
{"title":"Interactive educational tool for teaching a simple cipher","authors":"A. Farra, E. Zahedi","doi":"10.1109/ISBAST.2014.7013102","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013102","url":null,"abstract":"In this paper, a practical educational tool based on Java programming is described. The approach is based on using a fully interactive graphical user interface for teaching cipher algorithms. As an example, a transposition cipher is covered, where students can try different keys and observe the effect of parameters such as key length, choice of letters for the key on the ciphertext. At the same time, the process of breaking the cipher algorithm (cryptanalysis) is rendered possible by students injecting known plaintext. The developed program offers an option where it tries systematically all keys (brute force) to break the cipher. Being extendable, the platform is thought to be able to play a very positive role in the assimilation of abstract concepts encountered during cryptography.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130949613","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013119
S. Ghoreishi, S. Razak, I. Isnin, Hassan Chizari
Recently, various pairing-based and pairing-free two party Key Agreement protocols in the context of Identity-Based and Certificateless cryptosystems have been published. The pairing-free Key Agreement protocols could improve the efficiency by eliminating the high expense of pairing maps. In this paper, we proposed several secure and efficient Identity-Based and Certificateless pairing-free two party Key Agreement protocols. In compare with related works, our protocols require less computational cost.
{"title":"New secure identity-based and certificateless authenticated Key Agreement protocols without pairings","authors":"S. Ghoreishi, S. Razak, I. Isnin, Hassan Chizari","doi":"10.1109/ISBAST.2014.7013119","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013119","url":null,"abstract":"Recently, various pairing-based and pairing-free two party Key Agreement protocols in the context of Identity-Based and Certificateless cryptosystems have been published. The pairing-free Key Agreement protocols could improve the efficiency by eliminating the high expense of pairing maps. In this paper, we proposed several secure and efficient Identity-Based and Certificateless pairing-free two party Key Agreement protocols. In compare with related works, our protocols require less computational cost.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132566858","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 : 2014-08-01DOI: 10.1109/ISBAST.2014.7013126
Taegyu Kim, Woomin Hwang, Ki-Woong Park, Kyungoh Park
As the number of malware variants has grown rapidly, classification speed has become crucial in security issues. While several techniques for malware variant classification have been proposed, they involve a speed-accuracy trade-off. In an attempt to achieve a speedy and accurate malware variant classification, we thoroughly analyze previously proposed methods and identify a critical performance bottleneck in string-to-string matching. This paper presents and evaluates a technique called I-Filter that enhances the performance of the previous approach, approximate matching. I-Filter has the following novel mechanism, the hash-based equivalent procedure matching technique. Our performance evaluation confirms that a performance improvement of on average 1,043 times through I-Filtering.
{"title":"I-Filter: Identical Structured Control Flow String filter for accelerated malware variant classification","authors":"Taegyu Kim, Woomin Hwang, Ki-Woong Park, Kyungoh Park","doi":"10.1109/ISBAST.2014.7013126","DOIUrl":"https://doi.org/10.1109/ISBAST.2014.7013126","url":null,"abstract":"As the number of malware variants has grown rapidly, classification speed has become crucial in security issues. While several techniques for malware variant classification have been proposed, they involve a speed-accuracy trade-off. In an attempt to achieve a speedy and accurate malware variant classification, we thoroughly analyze previously proposed methods and identify a critical performance bottleneck in string-to-string matching. This paper presents and evaluates a technique called I-Filter that enhances the performance of the previous approach, approximate matching. I-Filter has the following novel mechanism, the hash-based equivalent procedure matching technique. Our performance evaluation confirms that a performance improvement of on average 1,043 times through I-Filtering.","PeriodicalId":292333,"journal":{"name":"2014 International Symposium on Biometrics and Security Technologies (ISBAST)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121706020","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
扫码关注我们
求助内容：
应助结果提醒方式：