Int. J. Netw. Comput.最新文献_第3页

Implementation of high speed hash function Keccak on GPU 高速哈希函数Keccak在GPU上的实现

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_370

T. N. Dat, Keisuke Iwai, T. Matsubara, T. Kurokawa

{"title":"Implementation of high speed hash function Keccak on GPU","authors":"T. N. Dat, Keisuke Iwai, T. Matsubara, T. Kurokawa","doi":"10.15803/IJNC.9.2_370","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_370","url":null,"abstract":"Nowadays, a hash function is used for password management. The hash function is desired to possess the following three characteristics: Pre-Image Resistance, Second Pre-Image Resistance, and Collision Resistance. They are set on the assumption that it is computationally difficult to find the original message from a given hash value. However, the security level of the password management will be further reduced by implementing a high speed hash function on GPU. In this paper, the implementation of high speed hash function Keccak-512 using the integrated development environment CUDA for GPU is proposed. The following four techniques are used in order to speed up its implementation. The first one is reforming lookup tables from 2 dimensional arrays to 1 dimensional arrays at step rho and pi. The second is an investigation into the effect of using constant memory and shared memory for constant values. The third is the finding out the optimal configuration of blocks-threads, then evaluate the implementation according to the occupancy. And the last one is using CUDA streams with overlapping to hide the overhead of data transfer and GPU processing. As the result, the throughput of implemented Keccak on GeForce GTX 1080 achieved up to maximum 64.58 GB/s. It is about 14.0 times faster than the previous research result. In addition, the safety level of Keccak is also discussed at the point of Pre-Image Resistance especially. In order to implement a high speed hash function for password cracking, we developed a special program for passwords up to 71 characters. Moreover, the throughputs of 2 times as well as 3 times hash are also evaluated. It is proved that multiple times hash is possible to greatly improved the security level of Keccak with password management. The throughput of hashing password with a large number of iterations confirmed the effect was about 90%. That is the time required to hash one password for 1000 times was almost the same as the total time to sequentially hash 900 passwords.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115998392","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}

引用次数: 5

Analyzing the Effect of Moving Target Defense for a Web System Web系统移动目标防御效果分析

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_188

Wai Kyi Kyi Oo, Hiroshi Koide, K. Sakurai

引用次数: 2

Evaluation of Ad-hoc Secure Device Pairing Method with Accelerometer and Camera Using Marker 基于标记的加速度计与相机自组织安全设备配对方法评价

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_318

M. Nagatomo, K. Aburada, N. Okazaki, Mirang Park

{"title":"Evaluation of Ad-hoc Secure Device Pairing Method with Accelerometer and Camera Using Marker","authors":"M. Nagatomo, K. Aburada, N. Okazaki, Mirang Park","doi":"10.15803/IJNC.9.2_318","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_318","url":null,"abstract":"Currently, devices with wireless technologies often communicate each other ad hoc. For example, a presenter wirelessly distributes ad-hoc meeting materials from a PC to mobile device in a meeting room. However, there is a problem of spoofing by an impersonator outside the room. Hence, devices must conduct secure pairing, which is exchange of key necessary for encrypting communication contents, before the communication. As a pairing method between devices, there are pairing methods using RSS from access point as features. However, RSS changes significantly due to environmental factors. On the other hand, there are the pairing methods which compare acceleration data from devices with displacement data of devices from camera of a server. However, these methods have problems that it is necessary to use infrared camera and difficult to recognize inclination of devices. Thus, these methods cannot perform accurate device pairing. Therefore, in this paper, we propose a method that perform pairing using devices' accelerometers and markers displayed on devices, and a camera of authentication server. This method performs pairing by calculating similarity between velocity data from acceleration data from devices and displacement data of the marker from camera after comparing marker sequence displayed on the device. This method has advantage that can detect devices' inclination by recognizing markers' inclination. We performed three types of experiments to confirm the similarity of displacement data and acceleration data, whether an impersonator outside camera range can perform pairing, and possibility of several devices pairing together. As a result, we founded that the larger the device's display is, the higher the similarity, the proposed method can distinguish legitimate user from impersonator outside camera range by average similarity, and three devices succeeded pairing at rate of 71.8%.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127870410","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}

引用次数: 1

Integration of TicToc Concurrency Control Protocol with Parallel Write Ahead Logging Protocol TicToc并发控制协议与并行提前写日志协议的集成

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_339

Yasuhiro Nakamura, H. Kawashima, O. Tatebe

引用次数: 3

Implementation and Evaluation of Communication-Hiding Method by System Call Proxy 基于系统调用代理的通信隐藏方法的实现与评价

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_217

Y. Okuda, Masaya Sato, H. Taniguchi

{"title":"Implementation and Evaluation of Communication-Hiding Method by System Call Proxy","authors":"Y. Okuda, Masaya Sato, H. Taniguchi","doi":"10.15803/IJNC.9.2_217","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_217","url":null,"abstract":"Essential services, such as security software or logging software, are considered important because of an increase in attacks on computers. These essential services are provided by processes that sometimes involve file manipulation and communication. Moreover, these essential services can be a target of attacks and become disabled, as they can be an obstacle to attackers. Attackers can speculate essential services by monitoring the behavior of the processes. To avoid such attacks on essential services, methods for hiding their behavior are proposed. The methods use a virtual machine (VM) monitor to make it difficult for attackers to identify essential services by hiding process information and file manipulation. However, the communication information remains visible to attackers. To address this problem, this study proposes a method for hiding the communication of essential services by using a system call proxy. We assume that a process providing essential services (essential process) runs on a protection target VM and a proxy process runs on a proxy VM. In the proposed method, the system calls in the communication invoked by the essential process are executed by the proxy process. The system calls invoked by the proxy process are not executed on the protection target VM; therefore, attackers cannot identify the communication of essential services by monitoring their communication. This paper presents the design, implementation, and evaluation of the proposed method.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187021","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}

引用次数: 1

A Constraint Programming Approach to Scheduling of Malleable Tasks 可塑任务调度的约束规划方法

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_131

Hiroki Nishikawa, Kaname Shimada, Ittetsu Taniguchi, H. Tomiyama

{"title":"A Constraint Programming Approach to Scheduling of Malleable Tasks","authors":"Hiroki Nishikawa, Kaname Shimada, Ittetsu Taniguchi, H. Tomiyama","doi":"10.15803/IJNC.9.2_131","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_131","url":null,"abstract":"With the increasing demand for high-performance computing, multicore architectures became appealing in various application domains. In order to exploit the parallelism of the multicore architectures, task scheduling has become more important than ever. Classical multicore task scheduling assumes that each task is executed on one of the cores. However, many tasks in modern applications have inherent parallelism and can be multi-threaded. A task is partitioned into threads which can be executed on multiple cores in a fork-join fashion. A multi-threaded task is called malleable if the number of threads is flexible and is determined at the same time as task scheduling. This paper proposes multicore scheduling methods for malleable tasks. Given a set of dependent tasks in the form of directed acyclic graph and homogeneous multiple cores, the proposed methods decide the number of threads for each task and schedule the threads on the multicores simultaneously, with the goal of minimizing the overall schedule length. The proposed scheduling methods are based on constraint programming. Experimental results show that the proposed methods outperform state-of-the-art work which is based on integer linear programming.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127517124","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}

引用次数: 4

Critical Node Identification based on Articulation Point Detection for Uncertain Network 基于结合点检测的不确定网络关键节点识别

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_201

K. Ohara, Kazumi Saito, M. Kimura, H. Motoda

{"title":"Critical Node Identification based on Articulation Point Detection for Uncertain Network","authors":"K. Ohara, Kazumi Saito, M. Kimura, H. Motoda","doi":"10.15803/IJNC.9.2_201","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_201","url":null,"abstract":"The problem of efficiently identifying critical nodes that substantially degrade network performance if they do not function is crucial and essential in analyzing a large complex network such as social networks on the Web and road network in the real world, and it is still challenging. In this paper, we tackle this problem under a realistic situation where each link is probabilistically disconnected as assumed in studies in uncertain graphs. This reflects that in case of a social network an information path between two persons is not always open and may not pass on any information from one to the other and in case of a road network a road between two intersections is not always travelable and may be blocked by a traffic accident, a road repair, a nearby construction, etc. To solve this problem, we focus on the articulation point and utilize the bridge detection technique in graph theory to efficiently identify critical nodes when the node reachability is taken as the performance measure. In case of a social network disfunction of a node causes loss of the total number of people receiving information and in case of a road network it causes loss of the total number of people movable to other places. Using two real-world social networks and one road network, we empirically show that the proposed method has a good scalability with respect to the network size and the nodes our method identified possesses unique properties and they are difficult to be identified by using conventional centrality measures.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131464172","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}

引用次数: 4

Relation between spatio-temporal patterns generated by two-dimensional cellular automata and a singular function 二维元胞自动机生成的时空模式与奇异函数的关系

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_354

Akane Kawaharada, Takao Namiki

引用次数: 4

Evaluations of CMA with Error Corrector in Image Processing Circuit 图像处理电路中带误差校正的CMA评估

Int. J. Netw. Comput. Pub Date : 2019-07-08 DOI: 10.15803/IJNC.9.2_301

Tomoaki Ukezono

引用次数: 0

Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2018 前言:2018年并行和分布式计算模型进展研讨会特刊

Int. J. Netw. Comput. Pub Date : 2019-01-10 DOI: 10.15803/IJNC.9.1_1

A. Fujiwara, Susumu Matsumae

{"title":"Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2018","authors":"A. Fujiwara, Susumu Matsumae","doi":"10.15803/IJNC.9.1_1","DOIUrl":"https://doi.org/10.15803/IJNC.9.1_1","url":null,"abstract":"The 20th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), which was held in conjunction with the International Parallel and Distributed Processing Symposium (IPDPS) on May 21--May 25, 2018, in Vancouver, Canada, aims to provide a timely forum for the exchange and dissemination of new ideas, techniques and research in the field of the parallel and distributed computational models. The APDCM workshop has a history of attracting participation from reputed researchers worldwide. The program committee has encouraged the authors of accepted papers to submit full-versions of their manuscripts to the International Journal of Networking and Computing (IJNC) after the workshop. After a thorough reviewing process, with extensive discussions, five articles on various topics have been selected for publication on the IJNC special issue on APDCM. On behalf of the APDCM workshop, we would like to express our appreciation for the large efforts of reviewers who reviewed papers submitted to the special issue. Likewise, we thank all the authors for submitting their excellent manuscripts to this special issue. We also express our sincere thanks to the editorial board of the International Journal of Networking and Computing, in particular, to the Editor-in-chief Professor Koji Nakano. This special issue would not have been possible without his support.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122138712","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}

引用次数: 0