Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856669
A. Rafique, Shoaib Azam, M. Jeon, Sangwook Lee
In this work, we discuss utility of Restricted Boltzmann Machine (RBM) in face-deidentification challenge. GRBM is a generative modeling technique and its unsupervised learning provides vantage of using raw faces data. Faces are deidentified by reconstructed face images from the trained GRBM model. The reconstructed image uses random information from the stochastic units which makes it hard to re-identify from the deidentified face. Experiments show the proposed technique maintain emotions in the test face, which is intrinsic to the modeling capacity of RBM.
{"title":"Face-deidentification in images using Restricted Boltzmann Machines","authors":"A. Rafique, Shoaib Azam, M. Jeon, Sangwook Lee","doi":"10.1109/ICITST.2016.7856669","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856669","url":null,"abstract":"In this work, we discuss utility of Restricted Boltzmann Machine (RBM) in face-deidentification challenge. GRBM is a generative modeling technique and its unsupervised learning provides vantage of using raw faces data. Faces are deidentified by reconstructed face images from the trained GRBM model. The reconstructed image uses random information from the stochastic units which makes it hard to re-identify from the deidentified face. Experiments show the proposed technique maintain emotions in the test face, which is intrinsic to the modeling capacity of RBM.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200478","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856711
Tomas Marques-Arpa, Jordi Serra-Ruiz
One of the main problems in the analysis of Digital Chain of Custody (CoC) in computer forensics is the traceability of the procedure of evidence. Generally, it is obtained by Corps and Forces of State Security and later it is examined and analyzed by forensic information experts. Therefore, the maximum guarantees both judicial and procedural are imperative for information sharing. However, the moment of capturing the proof has been cited as the most critical moment in the CoC. Consequently, in order to meet the exact capture place and right time, Global Positioning Satellite (GPS) has been proposed to be used by some authors. Another problem is created then: the possibility of attacks to capture system, based on jamming (interference) and spoofing (wrong place and time transmission) threats. To prevent the latter, this research work has been developed: the proposal for using encrypted signal of Public Regulated Service (PRS) which it is one of the signals of Galileo satellites. Thereby, the metadata of evidence will contain right and secure geolocation and time.
{"title":"PRS signal in acquiring evidence of Digital Chain of Custody","authors":"Tomas Marques-Arpa, Jordi Serra-Ruiz","doi":"10.1109/ICITST.2016.7856711","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856711","url":null,"abstract":"One of the main problems in the analysis of Digital Chain of Custody (CoC) in computer forensics is the traceability of the procedure of evidence. Generally, it is obtained by Corps and Forces of State Security and later it is examined and analyzed by forensic information experts. Therefore, the maximum guarantees both judicial and procedural are imperative for information sharing. However, the moment of capturing the proof has been cited as the most critical moment in the CoC. Consequently, in order to meet the exact capture place and right time, Global Positioning Satellite (GPS) has been proposed to be used by some authors. Another problem is created then: the possibility of attacks to capture system, based on jamming (interference) and spoofing (wrong place and time transmission) threats. To prevent the latter, this research work has been developed: the proposal for using encrypted signal of Public Regulated Service (PRS) which it is one of the signals of Galileo satellites. Thereby, the metadata of evidence will contain right and secure geolocation and time.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125007893","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856716
Madeline Little, Aspen Olmsted
This paper examines the process used in scheduling limited resources for blocks of time. The paper compares a complex algorithm current used to a random assignment system on scheduling equity. This research involved scheduling contracted guides with non-regular schedules to tours in advance or the day of the scheduling process. The random assignment algorithm, which is analyzed by equity, replaces a more complex algorithm that includes a ratio to prioritize guide assignment. Data from the Gettysburg Foundation was used to compare equity between the two assignment algorithms.
{"title":"Temporal resource scheduling equity","authors":"Madeline Little, Aspen Olmsted","doi":"10.1109/ICITST.2016.7856716","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856716","url":null,"abstract":"This paper examines the process used in scheduling limited resources for blocks of time. The paper compares a complex algorithm current used to a random assignment system on scheduling equity. This research involved scheduling contracted guides with non-regular schedules to tours in advance or the day of the scheduling process. The random assignment algorithm, which is analyzed by equity, replaces a more complex algorithm that includes a ratio to prioritize guide assignment. Data from the Gettysburg Foundation was used to compare equity between the two assignment algorithms.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115856215","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856666
Y. Hu, D. Sulek, Anthony Carella, Joshua Cox, Allyson Frame, Karen Cipriano
Vulnerability assessment is the practice of testing a computer system, network or application to identify, measure and rank vulnerabilities within the system. This project's goal is to create a distributed vulnerability assessment architecture utilizing multiple miniaturized computers such as Raspberry Pi 2 Model B. The scheme delegates scanning tasks to low-cost and self-contained miniaturized devices for pursuing vulnerability assessment to achieve load balancing and enhanced performance. A cloud based dashboard application allows each miniaturized computer to register itself and controls the vulnerability assessment process for multiple networks. This allows the security professional to conduct assessment process and view vulnerability reports remotely. This paper describes the detailed design and implementation of the proposed architecture. The performance and assessment results prove the viability of automated vulnerability assessment using miniaturized computers.
漏洞评估是对计算机系统、网络或应用程序进行测试，以识别、测量和排列系统内的漏洞。本项目的目标是利用多台小型化计算机(如Raspberry Pi 2 Model b)创建分布式漏洞评估架构，方案将扫描任务委托给低成本、自包含的小型化设备进行漏洞评估，实现负载均衡和性能提升。基于云的仪表板应用程序允许每个小型化计算机注册自己并控制多个网络的漏洞评估过程。这允许安全专业人员远程执行评估过程并查看漏洞报告。本文描述了所提出的体系结构的详细设计和实现。性能和评估结果证明了利用小型化计算机进行自动化漏洞评估的可行性。
{"title":"Employing miniaturized computers for distributed vulnerability assessment","authors":"Y. Hu, D. Sulek, Anthony Carella, Joshua Cox, Allyson Frame, Karen Cipriano","doi":"10.1109/ICITST.2016.7856666","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856666","url":null,"abstract":"Vulnerability assessment is the practice of testing a computer system, network or application to identify, measure and rank vulnerabilities within the system. This project's goal is to create a distributed vulnerability assessment architecture utilizing multiple miniaturized computers such as Raspberry Pi 2 Model B. The scheme delegates scanning tasks to low-cost and self-contained miniaturized devices for pursuing vulnerability assessment to achieve load balancing and enhanced performance. A cloud based dashboard application allows each miniaturized computer to register itself and controls the vulnerability assessment process for multiple networks. This allows the security professional to conduct assessment process and view vulnerability reports remotely. This paper describes the detailed design and implementation of the proposed architecture. The performance and assessment results prove the viability of automated vulnerability assessment using miniaturized computers.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122379955","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856676
Leandro Ordoñez-Ante, Thomas Vanhove, Gregory van Seghbroeck, T. Wauters, F. Turck
Big Data technologies have traditionally operated in an offline setting, collecting large batches of information on clusters of commodity machines and performing complex and time-consuming computations over it. While frameworks following this approach served well for most applications involving big data analysis during the last decade, other use cases have recently emerged posing challenging requirements on latency and demanding real-time data processing, querying and visualization. That is the case for applications aiming at detecting threatening behaviors in social network platforms, where timely action is required to avoid adverse consequences. In this sense, more and more attention has been drawn towards online data processing systems claiming to address the limitations of batch-oriented frameworks. This paper reports a work in progress on distributed data processing for enabling low-latency querying over big data sets. Two software architectures are discussed for addressing the problem and an experimental evaluation is performed on a proof of concept implementation showing how an approach based on query pre-processing and stateful distributed stream computation can meet the requirements for supporting interactive querying on large and continuously generated data.
{"title":"Interactive querying and data visualization for abuse detection in social network sites","authors":"Leandro Ordoñez-Ante, Thomas Vanhove, Gregory van Seghbroeck, T. Wauters, F. Turck","doi":"10.1109/ICITST.2016.7856676","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856676","url":null,"abstract":"Big Data technologies have traditionally operated in an offline setting, collecting large batches of information on clusters of commodity machines and performing complex and time-consuming computations over it. While frameworks following this approach served well for most applications involving big data analysis during the last decade, other use cases have recently emerged posing challenging requirements on latency and demanding real-time data processing, querying and visualization. That is the case for applications aiming at detecting threatening behaviors in social network platforms, where timely action is required to avoid adverse consequences. In this sense, more and more attention has been drawn towards online data processing systems claiming to address the limitations of batch-oriented frameworks. This paper reports a work in progress on distributed data processing for enabling low-latency querying over big data sets. Two software architectures are discussed for addressing the problem and an experimental evaluation is performed on a proof of concept implementation showing how an approach based on query pre-processing and stateful distributed stream computation can meet the requirements for supporting interactive querying on large and continuously generated data.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123427069","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856715
Emad Al-Mohammed, N. Linge
Television viewing is changing with a growing trend towards online consumption of content and a proliferation of providers. This is now starting to bring into question the future of the traditional television channel as the program itself becomes more dominant. However, this, in turn, poses a problem for the viewer in that it will become increasingly difficult to locate those programs of interest across such a broad range of providers. While broadcasters and content providers currently offer an Electronic Program Guide (EPG) to allow viewers to browse through their offerings, these are limited in scope. This is warranting an EPG that can truly work across all online providers. This paper introduces a new architecture for EPGs that has been developed to meet this challenge. A key feature of this architecture is the way in which it can access content from multiple providers and be personalized depending on viewer's preferences and interests, viewing device, internet connection speed and their social network interactions. The results that have been included shows that the system is able to communicate with different content sources and recommend a list of programs that match the user viewing pattern and their friends' recommendations within the social networks.
{"title":"A generic, personalized electronic program guide system for accessing multiple online TV providers","authors":"Emad Al-Mohammed, N. Linge","doi":"10.1109/ICITST.2016.7856715","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856715","url":null,"abstract":"Television viewing is changing with a growing trend towards online consumption of content and a proliferation of providers. This is now starting to bring into question the future of the traditional television channel as the program itself becomes more dominant. However, this, in turn, poses a problem for the viewer in that it will become increasingly difficult to locate those programs of interest across such a broad range of providers. While broadcasters and content providers currently offer an Electronic Program Guide (EPG) to allow viewers to browse through their offerings, these are limited in scope. This is warranting an EPG that can truly work across all online providers. This paper introduces a new architecture for EPGs that has been developed to meet this challenge. A key feature of this architecture is the way in which it can access content from multiple providers and be personalized depending on viewer's preferences and interests, viewing device, internet connection speed and their social network interactions. The results that have been included shows that the system is able to communicate with different content sources and recommend a list of programs that match the user viewing pattern and their friends' recommendations within the social networks.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"18 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125782083","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856703
Gozde Ozcan, Ş. Öğüdücü
In this paper, a reciprocal job recommendation system, CCRS (Classification - Candidate Reciprocal Recommendation), is proposed. With this proposed system, offering job advertisements in a sequence for candidates that they can get feedback reciprocally by using the user's profile, interaction and preference information is aimed all together. An approach has been used based on the preference information of the candidates to determine the jobs' order in the proposed list and the success of different classification methods has been compared to estimate the feedback rate of the advertisements for the target candidate. CCRS also addresses the cold start problem of new candidates joining the site by providing recommendations based on their profiles. The performance of the proposed method was evaluated by using various performance measurements on an actual data set received from an online recruiting website. Evaluation results show that the proposed method outperforms the compared methods for the top 10 ranked recommendations.
{"title":"Applying different classification techniques in reciprocal job recommender system for considering job candidate preferences","authors":"Gozde Ozcan, Ş. Öğüdücü","doi":"10.1109/ICITST.2016.7856703","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856703","url":null,"abstract":"In this paper, a reciprocal job recommendation system, CCRS (Classification - Candidate Reciprocal Recommendation), is proposed. With this proposed system, offering job advertisements in a sequence for candidates that they can get feedback reciprocally by using the user's profile, interaction and preference information is aimed all together. An approach has been used based on the preference information of the candidates to determine the jobs' order in the proposed list and the success of different classification methods has been compared to estimate the feedback rate of the advertisements for the target candidate. CCRS also addresses the cold start problem of new candidates joining the site by providing recommendations based on their profiles. The performance of the proposed method was evaluated by using various performance measurements on an actual data set received from an online recruiting website. Evaluation results show that the proposed method outperforms the compared methods for the top 10 ranked recommendations.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127692206","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856698
C. V. Neu, A. Zorzo, Alex M. S. Orozco, Regio A. Michelin
Data traffic on the Internet is growing continuously due to the high number of connected devices and increased number of applications and transactions performed online. To ensure information security, integrity and confidentiality, cryptography is applied over transmitted or stored data. Hence, even if an attacker capture data packets, its reading is hampered or not even possible. However, an attacker can also use cryptography to mask an attack in order to avoid detection, for example, by an Intrusion Detection System (IDS). Recent studies in network technologies introduced a new paradigm called Software Defined Networking (SDN). By decoupling data and control plans, the SDN architecture allows centralizing the network management, intelligence and control into a single point, called Controller. The OpenFlow protocol, widely adopted in SDN, provides specific messages to get statistical information of an OpenFlow switch. A Controller can request this information, which enables the development of new IDS models to detect encrypted attacks. In this work, we intend to identify encrypted insider attacks in SDN by developing a new IDS approach that can detect encrypted attacks.
{"title":"An approach for detecting encrypted insider attacks on OpenFlow SDN Networks","authors":"C. V. Neu, A. Zorzo, Alex M. S. Orozco, Regio A. Michelin","doi":"10.1109/ICITST.2016.7856698","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856698","url":null,"abstract":"Data traffic on the Internet is growing continuously due to the high number of connected devices and increased number of applications and transactions performed online. To ensure information security, integrity and confidentiality, cryptography is applied over transmitted or stored data. Hence, even if an attacker capture data packets, its reading is hampered or not even possible. However, an attacker can also use cryptography to mask an attack in order to avoid detection, for example, by an Intrusion Detection System (IDS). Recent studies in network technologies introduced a new paradigm called Software Defined Networking (SDN). By decoupling data and control plans, the SDN architecture allows centralizing the network management, intelligence and control into a single point, called Controller. The OpenFlow protocol, widely adopted in SDN, provides specific messages to get statistical information of an OpenFlow switch. A Controller can request this information, which enables the development of new IDS models to detect encrypted attacks. In this work, we intend to identify encrypted insider attacks in SDN by developing a new IDS approach that can detect encrypted attacks.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131454504","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856740
Regio A. Michelin, A. Zorzo, M. B. Campos, C. V. Neu, Alex M. S. Orozco
Authentication is a crucial solution to be considered for securing an application or user's personal data. It is a mechanism that plays a role to allow only the rightful user to access an application and the corresponding data, without allowing any kind of impersonation. To avoid this impersonation, biometric mechanisms have been used to read some biological characteristic from the user. However, the extra hardware needed for reading the biometric feature is usually a problem. Besides, in some scenarios, this will definitely avoid its adoption. Nonetheless, nowadays, this problem may be reduced since almost every adult person possesses a smartphone, which contains several sensors that can be used to read biometric information from a user. This work proposes a mechanism to allow a smartphone to act as a biometric reader for different levels of task/data available in a web application. In order to bind a smartphone to a web application, we use QR-Code sent from a web server to a web client, which will have to be read by a smartphone and then be sent back to the web server, so the web server knows that the actual user is close to the web client. This paper also provides a discussion on how to evaluate the usability of the proposed mechanism.
{"title":"Smartphone as a biometric service for web authentication","authors":"Regio A. Michelin, A. Zorzo, M. B. Campos, C. V. Neu, Alex M. S. Orozco","doi":"10.1109/ICITST.2016.7856740","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856740","url":null,"abstract":"Authentication is a crucial solution to be considered for securing an application or user's personal data. It is a mechanism that plays a role to allow only the rightful user to access an application and the corresponding data, without allowing any kind of impersonation. To avoid this impersonation, biometric mechanisms have been used to read some biological characteristic from the user. However, the extra hardware needed for reading the biometric feature is usually a problem. Besides, in some scenarios, this will definitely avoid its adoption. Nonetheless, nowadays, this problem may be reduced since almost every adult person possesses a smartphone, which contains several sensors that can be used to read biometric information from a user. This work proposes a mechanism to allow a smartphone to act as a biometric reader for different levels of task/data available in a web application. In order to bind a smartphone to a web application, we use QR-Code sent from a web server to a web client, which will have to be read by a smartphone and then be sent back to the web server, so the web server knows that the actual user is close to the web client. This paper also provides a discussion on how to evaluate the usability of the proposed mechanism.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131910698","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 : 2016-12-01DOI: 10.1109/ICITST.2016.7856674
Abdullateef Rabab'ah, M. Al-Ayyoub, M. Shehab, Y. Jararweh, B. Jansen
In what has been described as the WikiLeaks of the financial world, the release of millions of documents (known as the “Panama Papers”) have placed at the center of global media attention the elaborate ways used by some of the elite to hide their financial assets leading to serious allegation of financial corruption. In this work, we explore the information contained in these documents using social network analytics. Due to the large size of the network constructed from the Panama Papers, we limit our attention to a specific region, which is the Middle East. The analysis reveals that while the constructed network enjoys some typical characteristics, there are many interesting observations and properties worth discussing. Specifically, using the extracted network consisting of 37,442 nodes and 79,544 edges, our social network analysis finding show that, perhaps surprisingly, the nodes or the social network are not necessarily directly correlation with perceived financial influence.
{"title":"Using the Panama Papers to explore the financial networks of the Middle East","authors":"Abdullateef Rabab'ah, M. Al-Ayyoub, M. Shehab, Y. Jararweh, B. Jansen","doi":"10.1109/ICITST.2016.7856674","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856674","url":null,"abstract":"In what has been described as the WikiLeaks of the financial world, the release of millions of documents (known as the “Panama Papers”) have placed at the center of global media attention the elaborate ways used by some of the elite to hide their financial assets leading to serious allegation of financial corruption. In this work, we explore the information contained in these documents using social network analytics. Due to the large size of the network constructed from the Panama Papers, we limit our attention to a specific region, which is the Middle East. The analysis reveals that while the constructed network enjoys some typical characteristics, there are many interesting observations and properties worth discussing. Specifically, using the extracted network consisting of 37,442 nodes and 79,544 edges, our social network analysis finding show that, perhaps surprisingly, the nodes or the social network are not necessarily directly correlation with perceived financial influence.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133014874","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
扫码关注我们
求助内容：
应助结果提醒方式：