Pub Date : 2023-02-28DOI: 10.58346/jisis.2023.i1.008
Rahama Salman
A vision-based human computer interface is used to automatically recognize human mood. Image processing techniques used include a web camera for eye detection. Appearance tracking method (ABT) is measured face identification and K means Nearest Neighbor (K-NN) is used for eye detection. DWT - Discrete Wavelet Transform and DCT - Discrete Cosine Transform are suitable to extract features of eye and SVM is used to classify eye expressions. Classification of eye expressions includes anger, fear, happiness, disgust, neutral and sad. Experimental results confirm that the proposed method recognized facial expressions with higher accuracy.
{"title":"DeepQ Residue Analysis of Computer Vision Dataset using Support Vector Machine","authors":"Rahama Salman","doi":"10.58346/jisis.2023.i1.008","DOIUrl":"https://doi.org/10.58346/jisis.2023.i1.008","url":null,"abstract":"A vision-based human computer interface is used to automatically recognize human mood. Image processing techniques used include a web camera for eye detection. Appearance tracking method (ABT) is measured face identification and K means Nearest Neighbor (K-NN) is used for eye detection. DWT - Discrete Wavelet Transform and DCT - Discrete Cosine Transform are suitable to extract features of eye and SVM is used to classify eye expressions. Classification of eye expressions includes anger, fear, happiness, disgust, neutral and sad. Experimental results confirm that the proposed method recognized facial expressions with higher accuracy.","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43068795","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 : 2023-02-28DOI: 10.58346/jisis.2023.i1.005
Latifah Alamer
{"title":"DDoS Attack Detection using Long-short Term Memory with Bacterial Colony Optimization on IoT Environment","authors":"Latifah Alamer","doi":"10.58346/jisis.2023.i1.005","DOIUrl":"https://doi.org/10.58346/jisis.2023.i1.005","url":null,"abstract":"","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42020877","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 : 2023-02-28DOI: 10.58346/jisis.2023.i1.009
Muthusundari S
{"title":"A Mathematical based Divide and Conquer Approach to a New Sorting Algorithm with Min Max Index Value","authors":"Muthusundari S","doi":"10.58346/jisis.2023.i1.009","DOIUrl":"https://doi.org/10.58346/jisis.2023.i1.009","url":null,"abstract":"","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42362497","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 : 2022-12-01DOI: 10.58346/jisis.2022.i4.005
{"title":"\"Smart Mobile Civic\" based on the Project Citizen Model as an Effort to Optimize Citizenship Learning in the Independent Campus Era","authors":"","doi":"10.58346/jisis.2022.i4.005","DOIUrl":"https://doi.org/10.58346/jisis.2022.i4.005","url":null,"abstract":"","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43428035","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 : 2022-11-30DOI: 10.58346/jisis.2022.i4.003
H. Lee
{"title":"Robotics 4.0 : Challenges and Opportunities in the 4th Industrial Revolution","authors":"H. Lee","doi":"10.58346/jisis.2022.i4.003","DOIUrl":"https://doi.org/10.58346/jisis.2022.i4.003","url":null,"abstract":"","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48035084","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 : 2022-11-30DOI: 10.58346/jisis.2022.i4.002
Luís Pinto
{"title":"Assessing the Relevance of Cybersecurity Training and Policies to Prevent and Mitigate the Impact of Phishing Attacks","authors":"Luís Pinto","doi":"10.58346/jisis.2022.i4.002","DOIUrl":"https://doi.org/10.58346/jisis.2022.i4.002","url":null,"abstract":"","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46831787","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 : 2022-11-30DOI: 10.58346/jisis.2022.i4.001
Tom Meurs
Recent leaks (such as Conti) have provided greater insights on the working of cybercriminal organisations. Just like any other business, these malicious actors strategically manage their processes in order to maximise their revenues. Coordinating different types of cybercrimes as part of a single attack campaign provides another opportunity to these criminal groups to improve the efficiency of their attacks. To investigate the promise of this “coordination” between cybercrimes in improving the financial gains realised by cybercriminals, we take a two-step approach. First, we perform a bibliometric analysis of past scientific literature discussing the concept of “coordination” w.r.t to cybercrime. Second, as a case study, analysing the attack chains of DDoS, phishing and ransomware attacks, we identify vantage points for potential coordination from an attacker’s perspective. Based on our findings, we propose a model (COORDINATE) to identify the types of potential cybercrime “coordinations”. COORDINATE considers three relevant types of coordination: direct collaborated coordination, indirect collaborated coordination, and opportunistic coordination. Given the advantages of coordinated attacks, our results suggest that one crime may provide opportunities for the next one. Coordinated attacks will become more prevalent, and that we may witness the development of a dynamic that leads to more online crime.
{"title":"COORDINATE: A model to analyse the benefits and costs of coordinating cybercrime","authors":"Tom Meurs","doi":"10.58346/jisis.2022.i4.001","DOIUrl":"https://doi.org/10.58346/jisis.2022.i4.001","url":null,"abstract":"Recent leaks (such as Conti) have provided greater insights on the working of cybercriminal organisations. Just like any other business, these malicious actors strategically manage their processes in order to maximise their revenues. Coordinating different types of cybercrimes as part of a single attack campaign provides another opportunity to these criminal groups to improve the efficiency of their attacks. To investigate the promise of this “coordination” between cybercrimes in improving the financial gains realised by cybercriminals, we take a two-step approach. First, we perform a bibliometric analysis of past scientific literature discussing the concept of “coordination” w.r.t to cybercrime. Second, as a case study, analysing the attack chains of DDoS, phishing and ransomware attacks, we identify vantage points for potential coordination from an attacker’s perspective. Based on our findings, we propose a model (COORDINATE) to identify the types of potential cybercrime “coordinations”. COORDINATE considers three relevant types of coordination: direct collaborated coordination, indirect collaborated coordination, and opportunistic coordination. Given the advantages of coordinated attacks, our results suggest that one crime may provide opportunities for the next one. Coordinated attacks will become more prevalent, and that we may witness the development of a dynamic that leads to more online crime.","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43971191","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 : 2011-10-16DOI: 10.22667/JISIS.2011.08.31.107
Jiaxin Pan, Libin Wang
In this paper, we propose an authenticated key exchange (AKE) protocol under the computational Diffie-Hellman (CDH) assumption with respect to the strengthened eCK-security (seCK-security) of Sarr et al.. To date, many AKE protocols either are provably secure under a rather strong and non-standard assumption named as the gap Diffie-Hellman (GDH) assumption, or fall to practical attacks on the intermediate result leakage which can be captured by the seCK model. In order to remove the gap assumption and achieve stronger security requirements, we present the TMQV protocol using the twinning technique and the MQV key derivation method. With the help of trapdoor test theorem, TMQV is provably seCK-secure under the standard CDH assumption in the random oracle model. Compared with the related works, TMQV achieves not only stronger security but also higher implementation efficiency with weaker cryptographic assumptions.
{"title":"TMQV: A Strongly eCK-secure Diffie-Hellman Protocol without Gap Assumption","authors":"Jiaxin Pan, Libin Wang","doi":"10.22667/JISIS.2011.08.31.107","DOIUrl":"https://doi.org/10.22667/JISIS.2011.08.31.107","url":null,"abstract":"In this paper, we propose an authenticated key exchange (AKE) protocol under the computational Diffie-Hellman (CDH) assumption with respect to the strengthened eCK-security (seCK-security) of Sarr et al.. To date, many AKE protocols either are provably secure under a rather strong and non-standard assumption named as the gap Diffie-Hellman (GDH) assumption, or fall to practical attacks on the intermediate result leakage which can be captured by the seCK model. In order to remove the gap assumption and achieve stronger security requirements, we present the TMQV protocol using the twinning technique and the MQV key derivation method. With the help of trapdoor test theorem, TMQV is provably seCK-secure under the standard CDH assumption in the random oracle model. Compared with the related works, TMQV achieves not only stronger security but also higher implementation efficiency with weaker cryptographic assumptions.","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75034557","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 : 2011-10-16DOI: 10.22667/JISIS.2011.08.31.074
Shengli Liu, Junzuo Lai, R. Deng
Lossy trapdoor functions enable black-box construction of public key encryption (PKE) schemes secure against chosen-ciphertext attack [18]. Recently, a more efficient black-box construction of public key encryption was given in [12] with the help of chameleon all-but-one trapdoor functions (ABO-TDFs). In this paper, we propose a black-box construction for transforming any ABO-TDFs into chameleon ABO-TDFs with the help of chameleon hash functions. Instantiating the proposed general black-box construction of chameleon ABO-TDFs, we can obtain the first chameleon ABOTDFs based on the Decisional Diffie-Hellman (DDH) assumption.
{"title":"General Construction of Chameleon All-But-One Trapdoor Functions","authors":"Shengli Liu, Junzuo Lai, R. Deng","doi":"10.22667/JISIS.2011.08.31.074","DOIUrl":"https://doi.org/10.22667/JISIS.2011.08.31.074","url":null,"abstract":"Lossy trapdoor functions enable black-box construction of public key encryption (PKE) schemes secure against chosen-ciphertext attack [18]. Recently, a more efficient black-box construction of public key encryption was given in [12] with the help of chameleon all-but-one trapdoor functions (ABO-TDFs). \u0000 \u0000In this paper, we propose a black-box construction for transforming any ABO-TDFs into chameleon ABO-TDFs with the help of chameleon hash functions. Instantiating the proposed general black-box construction of chameleon ABO-TDFs, we can obtain the first chameleon ABOTDFs based on the Decisional Diffie-Hellman (DDH) assumption.","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79680159","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 : 2011-10-16DOI: 10.22667/JISIS.2011.08.31.089
Kristian Gjøsteen, G. Petrides, Asgeir Steine
We describe a novel reformulation of Canetti's Universal Composability (UC) framework for the analysis of cryptographic protocols. Our framework is different mainly in that it is (a) based on systems of interactive Turing machines with a fixed communication graph and (b) augmented with a global message queue that allows the sending of multiple messages per activation. The first feature significantly simplifies the proofs of some framework results, such as the UC theorem, while the second can lead to more natural descriptions of protocols and ideal functionalities.
{"title":"A Novel Framework for Protocol Analysis","authors":"Kristian Gjøsteen, G. Petrides, Asgeir Steine","doi":"10.22667/JISIS.2011.08.31.089","DOIUrl":"https://doi.org/10.22667/JISIS.2011.08.31.089","url":null,"abstract":"We describe a novel reformulation of Canetti's Universal Composability (UC) framework for the analysis of cryptographic protocols. Our framework is different mainly in that it is (a) based on systems of interactive Turing machines with a fixed communication graph and (b) augmented with a global message queue that allows the sending of multiple messages per activation. The first feature significantly simplifies the proofs of some framework results, such as the UC theorem, while the second can lead to more natural descriptions of protocols and ideal functionalities.","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73515041","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
扫码关注我们
求助内容：
应助结果提醒方式：