Int. J. Netw. Comput.最新文献

{"title":"A Realization of Real-time Sequence Generator for k-th Powers of Natural Numbers by One-Dimensional Cellular Automata","authors":"N. Kamikawa, H. Umeo","doi":"10.15803/ijnc.10.2_242","DOIUrl":"https://doi.org/10.15803/ijnc.10.2_242","url":null,"abstract":"A cellular automaton (CA) is a well-studied non-linear computational model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. A sequence generation problem on the CA model has been studied for a long time and a lot of generation algorithms has been proposed for a variety of non-regular sequences such as { 2^n | n = 1, 2, 3, ... }, primes, Fibonacci sequences etc. In this paper, we study a real-time sequence generation algorithm for k-th powers of natural numbers on a CA . In the previous studies, Kamikawa and Umeo (2012, 2019) showed that sequences { n^2 | n = 1, 2, 3, ...}, { n^3 | n = 1, 2, 3, ... } and { n^4 | n = 1, 2, 3, ... } can be generated in real-time by one-dimensional CA s. We extend the generation algorithm for { n^4 | n = 1, 2, 3, ... } shown by  Kamikawa and Umeo, and present a generation algorithm for the sequence { n^k | n = 1, 2, 3, ... } implemented.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115168580","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":"ECC Atomic Block with NAF against Strong Side-Channel Attacks on Binary Curves","authors":"Yusuke Takemura, Keisuke Hakuta, N. Shinohara","doi":"10.15803/ijnc.10.2_277","DOIUrl":"https://doi.org/10.15803/ijnc.10.2_277","url":null,"abstract":"Various side-channel attacks against elliptic curve cryptography (ECC) have been proposed so far, including simple power analysis, horizontal collision correlation analysis, improving the Big Mac attack, and differential power analysis.  Developing countermeasures against such attacks is considered as an important research task in cryptography. They are executed by analyzing power consumption while a device implemented in a cryptosystem performs cryptographic processing. To address this problem, we propose using three atomic blocks serving as the countermeasures against such attacks on ECC over finite fields of characteristic two. Two of them are basic atomic blocks, while the third one is an improved version of these two, having lower computational cost.  In this paper, concerning the possibility of more sophisticated side-channel attacks appearing in the future, we propose a threat model based on the atomic blocks that is constructed to be secure for strong side-channel attacks with more powerful abilities.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"407 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116386765","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":"Non-volatile memory driver to drastically reduce input-output response time and maintain Linux device-mapper framework","authors":"Kazuichi Oe, T. Nanri","doi":"10.15803/ijnc.10.2_127","DOIUrl":"https://doi.org/10.15803/ijnc.10.2_127","url":null,"abstract":"Automated tiered storage with fast memory and slow flash storage (ATSMF) is a hybrid storage system located between non-volatile memories (NVMs) and solid state drives (SSDs). ATSMF reduces the average response time for input-output (IO) accesses by migrating concentrated IO-access areas from an SSD to an NVM. However, the current ATSMF implementation cannot sufficiently reduce the average response time because of the bottleneck caused by the Linux brd driver, which is used for the NVM access driver. The response time of the brd driver is more than ten times longer than memory-access speed. To sufficiently reduce the average response time, we developed a block-level driver for an NVM called a \"two-mode (2M) memory driver.\" This driver has a .map-access mode and direct-access mode to reduce the response time while maintaining compatibility with the Linux device-mapper framework. The direct-access mode has a drastically lower response time than the Linux brd driver because the ATSMF driver can directly execute the IO-access function of the 2M memory driver. Experimental results indicate that ATSMF using the 2M memory driver reduced the IO access response time to less than that of ATSMF using the Linux brd driver in most cases.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127867488","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 MQ-based Signature with Tight Security Proof","authors":"Hiroki Furue, D. Duong, T. Takagi","doi":"10.15803/ijnc.10.2_308","DOIUrl":"https://doi.org/10.15803/ijnc.10.2_308","url":null,"abstract":"At PKC 2018, Chen et al. proposed SOFIA, the first MQ-based digital signature scheme having tight security in the quantum random oracle model (QROM). SOFIA is constructed by applying an extended version of the Unruh transform (EUROCRYPT 2015) to the mathcal MQ-based 5-pass identification scheme (IDS) proposed by Sakumoto et al. (CRYPTO 2011). In this paper, we propose an MQ-based 3-pass IDS with impersonation probability of 1/2 and apply the original version of the Unruh transform to it to obtain a more efficient MQ-based digital signature scheme tightly secure in the QROM. The signature size of our digital signature scheme decreases by about 35% compared with SOFIA in the level I of NIST PQC security category, and is supposed to be the shortest among that of MQ-based signatures tightly secure in the QROM.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116556445","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":"A Study on Ad-hoc Network with BLE Advertisement","authors":"Atsushi Ito, Kai Takahashi","doi":"10.15803/ijnc.10.2_94","DOIUrl":"https://doi.org/10.15803/ijnc.10.2_94","url":null,"abstract":"In Japan, there is a high chance of getting damage from earthquakes, tsunamis, and typhoons, so we need to get information about where to evacuate quickly. However, in such situations, communication infrastructures such as base stations of 3G, LTE are broken. Even if they are available, many people try to access the Internet or make a phone call, network congestion occurs. As a result, their ways of communication are limited. Under such a situation, weak people at a disaster, who called CHECT (Children, Handicapped, Elderly people, Chronically ill, Tourists), usually receive a disadvantage. We have been developed a support system for hearing-impaired people in a disaster since 2007 because they are hard to get information because a lot of emergency information is delivered by sound. For them, information by vision is more suitable. Now, we are testing our disaster information delivery system in Miyagi-Prefectural School for the Deaf. The system is constructed by several LED displays and connected by the ad-hoc network. To install our system, we are now trying to use Bluetooth Low Energy (BLE) Advertisement. In this paper, we will explain the outline of our system and the result of the experiment of the performance of the ad-hoc network with BLE Advertisement. The performance includes the reachability of transmitted packets, the routability of the routing protocol we developed. As a result, we can conclude that BLE Advertisement based ad-hoc network is feasible to construct a disaster information system for hearing-impaired people.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125280285","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":"A Performance Analysis and Evaluation of SIDH Applied Several Implementation-Friendly Quadratic Extension Fields","authors":"Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Y. Nogami","doi":"10.15803/ijnc.10.2_227","DOIUrl":"https://doi.org/10.15803/ijnc.10.2_227","url":null,"abstract":"It is well-known that quadratic extension fields (QEFs) based on optimal extension fields (OEFs) are typically used for supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol. On the other hand, there is a possibility of the performance improvement of SIDH by employing other attractive choices of QEFs with efficient performing arithmetics which are based on all-one polynomial extension fields (AOPFs) and extension fields with normal basis representation (EFNs). Thus, the authors confirm that the applicability of the new candidates of QEFs for SIDH and evaluate SIDH applied the possible choices of QEFs. As a result of the experiment, the authors found that the performances of SIDH applied the QEFs based on AOPF and EFN are comparable to that of the previous QEF. Moreover, one of the QEFs based on EFN result in a new efficient implementation of the SIDH with SIDH-friendly prime given as p= 2^{e_A}3^{e_B}f+1 where e_A, e_B and $f$ are positive integers.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123471939","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 Adaptive Connection-Establishment Timeout Configuration Method for Bluetooth MANETs in Control Packet Loss Environments","authors":"Temma Ohtani, Eitaro Kohno, Akifumi Nomasaki, Y. Kakuda","doi":"10.15803/ijnc.10.1_25","DOIUrl":"https://doi.org/10.15803/ijnc.10.1_25","url":null,"abstract":"Bluetooth MANETs, which consist of Bluetooth-enabled terminals, are a prospective methodology for mobile ad hoc networks (MANETs). Since Bluetooth is a connection-oriented and a low-power-consumption communication method, terminals must execute time-consuming connection establishment procedures in advance. We have to solve the following two problems for Bluetooth MANETs: (1) since terminals move within fields, terminals must establish their connection within a limited time. In addition, (2) since Bluetooth has a shorter range than other technologies, established connections are easily disrupted. In order to solve problem (1), a low-latency connection establishment method has been proposed. However, there is no countermeasure for problem (2). Therefore, the possibility of rapid re-establishment for connections ought to be investigated. In this paper, we have proposed a new adaptive connection-establishment timeout configuration method for environments with control packet loss. Our proposed method employs an adjustment mechanism for control packet loss. We have also implemented our proposed method on Raspberry Pi in order to evaluate our proposed method. To design our proposed method, we have conducted preliminary experiments to investigate the effects on varied connection-establishment timeouts. As a result, we have found that the minimum connection-establishment timeout is 2 seconds. At the same time, we have found that connection establishment failure rates increased as connection-establishment timeouts became shorter than 2 seconds. Especially, when connection-establishment timeouts were less than 2 seconds, the latency of the connection establishment became extremely long. This is due to the presence of a race condition between the processing time of control packets and the connection-establishment timeouts. From these results, we have set an adjustable interval of connection-establishment timeouts between 2 to 5 seconds. 5 seconds is the native default value of Bluetooth’s connection-establishment time-out. We have also conducted experiments of our proposed method in varying packet loss rate scenarios, and have confirmed the effectiveness of our proposed method.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128462221","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":"Two Implementations of Real-Time Sequence Generator for {n^3 | n=1, 2, 3, ... } and Their Comparison","authors":"N. Kamikawa, H. Umeo","doi":"10.15803/IJNC.9.2_257","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_257","url":null,"abstract":"A cellular automaton (CA) is a well-studied non-linear computational model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. A sequence generation problem on the CA model has been studied for a long time and a lot of generation algorithms has been proposed for a variety of non-regular sequences such as {2^n | n = 1, 2, 3,...}, prime, and Fibonacci sequences etc. In this paper, we study a real-time sequence generator for {n^3  | n=1, 2, 3, ...}. In the previous studies, Kamikawa and Umeo(2018) showed that sequence {n^3 | n=1, 2, 3, ...} can be generated in real-time by an eight-state CA. We present a new six-state implementation of real-time sequence generator for {n^3 | n=1, 2, 3, ...} rather than reducing the internal state of the Kamikawa and Umeo's sequence generator and give a formal proof of the correctness of the generator. In addition, we show the number of state-changes and number of cells of sequence generators, and compare sequence generators.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"62 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":"132096133","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":"Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages","authors":"Yuta Kodera, M. Kuribayashi, Takuya Kusaka, Y. Nogami","doi":"10.15803/IJNC.9.2_171","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_171","url":null,"abstract":"IoT technologies and cloud storages have been developed remarkably, and many types of data including private information have been gradually outsourced. For such a situation, new convenient functionalities such as arithmetic and a keyword search over ciphertexts are required to allow users to obtain information without leaking queried results, contents of ciphertext, and so on. Especially, searchable encryptions have been paid much attention to realize a keyword search on an encrypted domain. In addition, an architecture of searchable symmetric encryption (SSE) is a suitable and efficient solution for data outsourcing. In this paper, we focus on an SSE scheme which employs a secure index for searching a keyword. In conventional studies, it has been widely considered that the scheme searches whether a queried keyword is contained in encrypted documents or not. On the other hand, we additionally take into account the location of the queried keyword in the documents by targeting a matrix-type data format. The method enables an administrator to search personal information listed per line or column in CSV-like format data.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"43 6 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":"122503315","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":"Design and Evaluation of an Incentive Decision Method for an Agricultural Information Sharing System","authors":"Joji Toshima, T. Suganuma, Akiko Takahashi","doi":"10.15803/IJNC.9.2_276","DOIUrl":"https://doi.org/10.15803/IJNC.9.2_276","url":null,"abstract":"Agriculture in Japan is facing a crisis due to the aging of farmers and a shortage of successors. In addition, much of agriculture depends on know-how that new farmers cannot easily obtain; therefore, new farmers often give up farming after a few years. Consequently, it is necessary to share agricultural know-how with new farmers. However, the difficulty in verbalizing this know-how poses a challenge in sharing it. Therefore, it is necessary to provide incentives to the providers of know-how. In this paper, we propose an incentive decision method using auto-negotiation while considering the intentions of the know-how providers. This method consists of agents that have utility functions, which express the intentions of farmers, and a service. The performance of our method is evaluated by simulation experiments. We verify that our method collects a large amount of high-quality know-how with low incentives. The results indicate that our proposed method performs better than the existing methods considered in the experiments.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"36 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":"131406789","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}