2019 Seventh International Symposium on Computing and Networking (CANDAR)最新文献

{"title":"CNN Architecture for Surgical Image Segmentation Systems with Recursive Network Structure to Mitigate Overfitting","authors":"Taito Manabe, Koki Tomonaga, Yuichiro Shibata","doi":"10.1109/CANDAR.2019.00029","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00029","url":null,"abstract":"Laparoscopic surgery, a minimally invasive camera-aided surgery, is performed commonly. However, it requires a camera assistant who holds and maneuvers a laparoscope. If the laparoscope can be controlled automatically using a robot, a surgeon can perform the operation without a camera assistant, which would be beneficial in the areas suffering from lack of surgeons. In this paper, a prototype image segmentation architecture, based on a convolutional neural network, is proposed to realize an automatic laparoscope control for cholecystectomy. Since the learning dataset is annotated manually by a few surgeons, its scale is currently quite limited. Therefore, we devised a recursive network structure, with some sub-networks which are used multiple times, to mitigate overfitting. Furthermore, instead of the common transposed convolution, the flip-based subpixel reconstruction is introduced into upsampling layers. Evaluation results reveal that these improvements bring better classification accuracy without increasing the number of parameters. The system shows a throughput sufficient for real-time laparoscope robot control with a single NVIDIA GTX 1080 GPU.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115382418","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":"Fog-Assisted Virtual Reality MMOG with Ultra Low Latency","authors":"Tsuyoshi Yoshihara, S. Fujita","doi":"10.1109/CANDAR.2019.00022","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00022","url":null,"abstract":"In this paper, we propose a method to realize a virtual reality MMOG with low latency. The basic idea of the proposed method is to introduce an intermediate layer consisting of several fog nodes to offload the rendering of game view from the cloud server which conducts the rendering in conventional cloud games. In addition, we propose three techniques to further reduce the latency: 1) To maintain the overall game space in a consistent manner, the collision detection of virtual objects is conducted by the cloud server in a centralized manner; 2) To reflect subtle changes of the line of sight of a player to the resulting game view, such a change is acquired by the HMD worn by the player, and is directly sent to the corresponding fog node to alleviate the VR sickness; and 3) To overcome the overload of fog nodes concerned with the rendering, we separate the rendering of the background view from that of the foreground view, and offload the former to other nodes including the cloud server. The performance of the proposed method is evaluated through experiments conducted on a prototype system.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117229992","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":"Revised Pulse Algorithm for Elementary Shortest Path Problem with Resource Constraints","authors":"Jiaxin Li, Xin Han","doi":"10.1109/CANDAR.2019.00013","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00013","url":null,"abstract":"In this article, we describe an algorithm to solve elementary shortest path problem (ESPPRC) that improves the method proposed in [Lozano et al., Transportation Science, 2015]. ESPPRC has been the backbone of solving vehicle routing problem (VRP) using the branch-and-price procedure, especially vehicle routing problem with time windows (VRPTW). The main idea of our contribution is splicing two partial paths to get a complete path in order to reduce the search space. We embed our algorithm into a column generation procedure to solve the linear relaxation of VRPTW. Experiment results show that the algorithm proposed in this paper can significantly reduce the search space and the running time. Our algorithm has a shorter average running time in 51 of the 56 instances. All experiment data sets are from Solomon benchmark [Solomon, Operations Research, 1987].","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114958467","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":"Effective Decentralized Energy Restoration by a Mobile Robot","authors":"P. Flocchini, Eman Omar, N. Santoro","doi":"10.1109/CANDAR.2019.00017","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00017","url":null,"abstract":"As most existing sensors are powered by batteries, the coverage provided by a sensor network degrades over time and eventually disappears if energy is not restored. A popular approach to energy restoration is to use a robot acting as a mobile battery charger/changer. The robot decides where to move next according to a predefined on-line energy restoration strategy. Since the goal of an energy restoration strategy is to maintain as much as possible of the network operational at any time, its effectiveness depends on the number of nodes it is able to maintain operational at any given time, as well as on for how long a node battery remains depleted. The ideal optimal on-line strategy (called OPTIMAL) occurs when the robot knows at any time the current status of all sensors, and it computes the best request to satisfy next, based on this information. Although optimal in terms of effectiveness, this centralized strategy constantly requires up-to-date global information; hence its high computational and communication costs make it not feasible. We consider a drastically different on-line strategy (called LIC), which is simple and fully decentralized, uses only local communication, requires no computations, and is highly scalable. In our strategy, the robot visits the sensors in a predefined circular order, moving in a \"clockwise\" direction and only when aware of a pending request. A sensor whose battery is about to become depleted originates a recharging request and waits for the robot; the request is forwarded in a \"counter-clockwise\" direction until it reaches either the robot or another sensor waiting for the robot. We show the perhaps unexpected result that, once the system becomes stable, in most networks the effectiveness of LIC is equivalent to that of OPTIMAL. In other words, in most cases, in spite of its simplicity and its extremely small (communication and computation) costs, the proposed decentralized strategy is as effective as the optimal centralized one. We augment our theoretical results with experimental analysis, showing among other things that the system stabilizes very quickly.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114294799","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":"How to Improve the Cohesion of a Social Network? A Structural Perspective","authors":"Ruochen Jiang, Jiamou Liu, Wu Chen","doi":"10.1109/CANDAR.2019.00025","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00025","url":null,"abstract":"Influence propagation is a significant issue in social network analysis. Existing works that studied this problem usually committed to looking for the important individuals of a social network, while very few study focuses on the overall propagation performance of the network. The overall propagation performance plays a key role in the development of a social network. In this paper, we study the notion of social cohesion that is based on influence propagation. We analyze the structure of the network and identify the key factors that affect the propagation efficiency. In order to improve the propagation efficiency, we further propose an efficient heuristic to improve propagation efficiency via relationships building. Finally we have also conducted experiment and the results demonstrate the superiority of our heuristic.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129161591","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":"Almost Optimal Cheating-Detectable (2,2,n) Ramp Secret Sharing Scheme","authors":"Tomoki Agematsu, Satoshi Obana","doi":"10.1109/CANDAR.2019.00009","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00009","url":null,"abstract":"In this research, we consider a strong ramp secret sharing scheme that can detect cheating. A cheating-detectable (k,L,n) ramp secret sharing scheme has been studied so far, and a strong ramp secret sharing scheme which achieves lower bounds on the size of shares and random number used in encoding (i. e., share generation), and the successful cheating probability of impersonation attack has been presented. Now a challenging task is to achieve the lower bound on the successful cheating probability of substitution attack. In this paper, we present a strong (2,2,n) ramp secret sharing scheme that almost achieves the lower bound on the successful cheating probability of substitution attack. Although the parameter is limited to (2,2,n) type ramp scheme, the proposed scheme is the first to almost achieve the lower bound. Moreover the proposed scheme also achieves other lower bounds such as those on the size of shares and random number used in encoding, and the successful cheating probability of impersonation attack. To achieve the lower bound on the successful cheating probability of substitution attack, we take a unique strategy to construct the scheme. Most existing works present generic type verification functions that can be applied to arbitrary linear and strong (k,L,n) ramp secret sharing schemes. On the other hand, our proposed verification function (one of those which we call limited type verification functions) cannot be applied to arbitrary strong (k,L,n) ramp schemes but applied to a special case of strong (2,2,n) ramp schemes with certain property, which make it possible to (almost) achieve the lower bound on the successful cheating probability of substitution attack. Fortunately, we can prove that, for any secret (S_1,S_2) ∊ GF(p^m)^2, there exist sufficiently many strong (2,2,n) ramp schemes with which the proposed scheme is proven to be secure. Further, we suggest that it is difficult to generalize our strategy to more generalized parameter because of the difficulty to find conditions of strong (k,L,n) ramp schemes with which any limited type verification functions guarantee security against substitution attacks.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114314614","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 with Implementation-Friendly Classes of Quadratic Extension Fields","authors":"Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Y. Nogami","doi":"10.1109/CANDAR.2019.00030","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00030","url":null,"abstract":"It is well-known that the class of binomial extension fields is widely used to construct quadratic extension fields (QEFs) of supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol. There is a possibility to improve the performance of SIDH by employing other classes of QEFs, i.e., extension fields with normal basis and all-one polynomial extension fields, without sacrificing the range of primes. In this paper, the authors confirm that the applicability of the other classes for SIDH and evaluate the computational complexity of the large-degree isogenies required for SIDH. The results of the experiments show that the performances with the classes are comparable to the QEF with a binomial x^2+1.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114748556","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 in the QROM","authors":"Hiroki Furue, D. Duong, T. Takagi","doi":"10.1109/CANDAR.2019.00010","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00010","url":null,"abstract":"At PKC 2018, Chen et al. proposed SOFIA, the first MQ-based digital signature scheme secure in the quantum random oracle model (QROM). SOFIA is constructed by applying an extended version of the Unruh transform (EUROCRYPT 2015) to the 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 secure in the QROM. The signature size with our digital signature scheme decreases by about 30% compared with SOFIA.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116953355","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":"[Title page iii]","authors":"","doi":"10.1109/candar.2019.00002","DOIUrl":"https://doi.org/10.1109/candar.2019.00002","url":null,"abstract":"","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131622113","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 Side-Channel Attack Using Order 8 Rational Points against Curve25519 on an 8-Bit Microcontroller","authors":"Yoshinori Uetake, Keiji Yoshimoto, Yuta Kodera, Léo Weissbart, Takuya Kusaka, Y. Nogami","doi":"10.1109/CANDAR.2019.00037","DOIUrl":"https://doi.org/10.1109/CANDAR.2019.00037","url":null,"abstract":"Among the increasing evolution of IoT devices, practical applications need reliable secure protocols to communicate with each other. A major issue for modern cryptosystems is an implementation of secure and trustworthy mechanisms to rely on. A side-channel attack against these cryptosystems may overturn the guarantee of security against conventional cyber-attacks. Elliptic curve cryptography is public-key cryptography based on elliptic curves, and one of the well-known curves is Curve25519 which is used for TLS protocols as a recommended curve. This curve is mainly implemented on limited resource devices such as microcontrollers. However, this curve poses a weakness for low-order points during a Diffie-Hellman key exchange is employed. This research demonstrates possible exploitation of a threat of order 8 rational points of Curve25519 and shows results of the side-channel attacks using order 8 rational points on an embedded system. The results indicate the order 8 rational points might be applied to key extraction as attacker sides.","PeriodicalId":300306,"journal":{"name":"2019 Seventh International Symposium on Computing and Networking (CANDAR)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128047143","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}