2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)最新文献

{"title":"Single-round Lattice-based Multisignatures","authors":"Kittiphon Phalakarn, Vorapong Suppakitpaisarn, Moaraj Hasan","doi":"10.1109/CANDARW53999.2021.00068","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00068","url":null,"abstract":"This work presents a provably-secure lattice-based multisignature scheme which requires only a single round of communication, whereas the existing works need two or three rounds. The reduction in the number of rounds for the proposed scheme is achieved by utilizing lattice trapdoors. In order to generate multisignatures securely, our scheme however requires an honest centralized server that maintains the trapdoor of a shared matrix used in the scheme.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115367794","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":"Consideration of the side-channel attack to SIMON implemented on Arduino Uno","authors":"Harunobu Enami, Yuta Kodera, Takuya Kusaka, Y. Nogami","doi":"10.1109/CANDARW53999.2021.00075","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00075","url":null,"abstract":"In this research, the authors conducted the side-channel attack (SCA)for the XOR in the final round of \"SIMON.\" As of 2021, there is no research about side-channel attacks against SIMON, which makes this paper more worthwhile. As a result, the authors could attack with little computational resources and time, which means that \"SIMON\" can be weak against side-channel attacks. Furthermore, the authors checked the relationship between the hamming-weight of the round key and the easiness of attacking. The authors confirmed that there was no relationship between them.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129347176","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":"GANs with Suppressed Mode Collapse Using Intrinsic Rewards","authors":"Toi Tsuneda, Taro Kiriyama, Kousuke Shintani, Satoshi Yamane","doi":"10.1109/CANDARW53999.2021.00037","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00037","url":null,"abstract":"In recent years, generative adversarial net-works (GANs) have attracted much attention because it can generate new data and information by taking advantage of the characteristics of samples. However, there are many problems with GANs, such as difficulty in learning well and instability. In this paper, we proposed a method to suppress mode collapse, which is one of the problems that often occur in GANs, by utilizing intrinsic rewards used in deep reinforcement learning. We have conducted comparative experiments between the pro-posed method and the original GANs in several ways to show the performance of the proposed method.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127513433","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":"Applying The Attacks Tracer on Advanced Persistent Threats to Real Networks","authors":"Yuya Tajima, Hiroshi Koide","doi":"10.1109/CANDARW53999.2021.00072","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00072","url":null,"abstract":"In this paper, we improve and expand the attacks tracer to receive information from real networks and to simulate advanced persistent threats in the networks based on it. Our improvement of the proposed system helps administrators to correctly recognize the status of the system and to expect near future events. Advanced persistent threats are cyber attacks that mainly target the information systems of organizations such as governments, research institutes, and enterprises. The attacks are characterized by long-lasting and continuous attacks that eventually result in the seizure of confidential information. In the past, system administrators and/or designers conducted digital forensic analysis. However the analysis is difficult because the number of communication traffic and connected devices are increasing now. The attacks tracer is a software that uses the actor model to simulate the behavior of an information system by modeling networked devices such as routers and servers abstractly. The abstract model and the actor model give the attacks tracer a scalable concurrency. Therefore the attacks tracer simulates a lot of attack scenarios of advanced persistent threats. However the attacks tracer before improvement we have implemented can only simulate specific scenarios in virtual spaces, and cannot analyze actual attacks. Therefore, in this proposal, we implemented the interface of gRPC, which is a high performance remote procedure call framework, in the attacks tracer. This allows attacks tracer to receive and analyze events that occur on the network immediately, thus the attacks tracer can simulate actual attacks. For example, if a system such as a firewall detects that an attack has occurred from a PC in the network, the attacks tracer can use that information to determine that the PC has been infected with malware and then indicate what kind of attack will occur. As a result of applying the attacks tracer to a real network, we found that the attacks tracer can get feedback from a real system and simulate advanced persistent threats based on it. The overview of the attacks tracer before improvement, the implementation method for applying to real environments and the case study are presented in this paper.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129826570","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":"Arranging resource amount after automatic GPU offloading","authors":"Y. Yamato","doi":"10.1109/CANDARW53999.2021.00087","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00087","url":null,"abstract":"Heterogeneous hardware other than a small-core central processing unit (CPU) such as a graphics processing unit (GPU), field-programmable gate array (FPGA), or many-core CPU is increasingly being used. However, to use heterogeneous hardware, programmers must have sufficient technical skills to utilize OpenMP, CUDA, and OpenCL. On the basis of this, we have proposed environment-adaptive software that enables automatic conversion, configuration, and high performance operation of once written code, in accordance with the hardware to be placed. However, although it has been considered to convert the code according to the offload devices, there has been no study to set the amount of resources appropriately after automatic conversion. In this paper, as a new element of environment-adapted software, we examine a method of optimizing the amount of resources of the CPU and offload device in order to operate the application with high cost-performance. Through the offloading of multiple existing applications, we confirm that the proposed method can meet the user’s request and set an appropriate amount of resources.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114968550","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":"Tip the Balance: Improving Exploration of Balanced Crossover Operators by Adaptive Bias","authors":"L. Manzoni, L. Mariot, Eva Tuba","doi":"10.1109/CANDARW53999.2021.00046","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00046","url":null,"abstract":"The use of balanced crossover operators in Genetic Algorithms (GA) ensures that the binary strings generated as offsprings have the same Hamming weight of the parents, a constraint which is sought in certain discrete optimization problems. Although this method reduces the size of the search space, the resulting fitness landscape often becomes more difficult for the GA to explore and to discover optimal solutions. This issue has been studied in this paper by applying an adaptive bias strategy to a counter-based crossover operator that introduces unbalancedness in the offspring with a certain probability, which is decreased throughout the evolutionary process. Experiments show that improving the exploration of the search space with this adaptive bias strategy is beneficial for the GA performances in terms of the number of optimal solutions found, even if these benefits are not reflected in the resulting fitness distributions.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127775884","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":"Message from the Organizers","authors":"Stéphane Ducasse, Michele Lanza, Jonathan I. Maletic, Andrian Marcus, M. Storey","doi":"10.1109/VISSOF.2005.1684291","DOIUrl":"https://doi.org/10.1109/VISSOF.2005.1684291","url":null,"abstract":"ISAMR is being held every year and intends to provide a platform for the exchange and networking between top scientists, emerging young researchers, and students across a wide spectrum of materials science and engineering. We would like to invite you to participate in ISAMR 2015. Your active participation is the key to the success of this conference.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626497","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}