发布求助
文献互助 智能选刊 最新文献

2017 Fifth International Symposium on Computing and Networking (CANDAR)最新文献

筛选
英文 中文
Mocha: Automatically Applying Content Security Policy to HTML Hybrid Application on Android Device Mocha:为Android设备上的HTML混合应用自动应用内容安全策略
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.48
Toshiki Takeuchi, Koichi Mouri, S. Saito
{"title":"Mocha: Automatically Applying Content Security Policy to HTML Hybrid Application on Android Device","authors":"Toshiki Takeuchi, Koichi Mouri, S. Saito","doi":"10.1109/CANDAR.2017.48","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.48","url":null,"abstract":"An HTML hybrid application is a type of application running on mobile devices. It is popular but may have Cross Site Scripting(XSS) vulnablitiy risks. Content Security Policy(CSP) is a security mechanism that can prevent XSS attacks. Developers can only apply CSP to applications, therefore user's safety depends on them. In this paper, we propose Mocha, automatically applying CSP to applications on the Android device. Mocha uses static analysis to automatically infer CSP policies, and modifies HTML and JavaScript source code for applying CSP. Mocha can protect users and their HTML hybrid applications from XSS. We confirmed that Mocha is effective with real applications.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639073","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
HDR Image Acquisition Using Integrated Mobile Device Camera 基于集成移动设备相机的HDR图像采集
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.12
A. Mihalik, Pavol Kunovsky, R. Durikovic
{"title":"HDR Image Acquisition Using Integrated Mobile Device Camera","authors":"A. Mihalik, Pavol Kunovsky, R. Durikovic","doi":"10.1109/CANDAR.2017.12","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.12","url":null,"abstract":"This work is focused on capturing the radiance map using a common mobile device. More specifically, we focus on a reconstruction of spherical panoramas sky-dome in high dynamic range (HDR) quality and save it to a usable data format. We have attached the cheap fish-eye lens to capture spherical panoramas and the proposed calibration technique, implement selected tone mapping operator (TMO) allowing satisfactory display of HDR images on the mobile device. To capture the HDR image we utilize a camera embedded in smart-phone devices. Built-in cameras on mobile devices do not generally capture the HDR image. In our work, we describe an algorithm for capturing an HDR image on the Android platform. Using the optimization method we are able to construct a camera response curve in order to reconstruct the HDR image. Later the captured panoramas containing HDR data can be used to produce radiance sphere-maps useful in realistic image synthesis for illuminating the objects in the 3D scene.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121625171","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}
引用次数: 2
A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction 具有严格安全缩减的类galindo - garcia身份签名
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.79
Masayuki Fukumitsu, Shingo Hasegawa
{"title":"A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction","authors":"Masayuki Fukumitsu, Shingo Hasegawa","doi":"10.1109/CANDAR.2017.79","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.79","url":null,"abstract":"Galindo and Garcia proposed an identity-based signature based on the Schnorr signature. Although their scheme is proven to be secure in the random oracle model, the security reduction is loose. Later, the security reduction is improved by Chatterjee, Kamath and Kumar, however, the reduction is still loose. In this paper, we propose an identity-based signature scheme which is based on the Schnorr signature. Our scheme follows the idea of the construction of the Galindo and Garcia's one. The security of our scheme is proven to be tightly secure under the DDH assumption in the random oracle model.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132466313","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}
引用次数: 2
GUNREAL: GPU-accelerated UNsupervised REinforcement and Auxiliary Learning gpu加速无监督强化和辅助学习
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.27
Youri Coppens, Koichi Shirahata, Takuya Fukagai, Y. Tomita, A. Ike
{"title":"GUNREAL: GPU-accelerated UNsupervised REinforcement and Auxiliary Learning","authors":"Youri Coppens, Koichi Shirahata, Takuya Fukagai, Y. Tomita, A. Ike","doi":"10.1109/CANDAR.2017.27","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.27","url":null,"abstract":"Recent state-of-the-art Deep Reinforcement Learning algorithms, such as A3C and UNREAL, are designed to train on a single device with only CPU's. Using GPU acceleration for these algorithms results in low GPU utilization, which means the full performance of the GPU is not reached. Motivated by the architecture changes made by the GA3C algorithm, which gave A3C better GPU acceleration, together with the high learning efficiency of the UNREAL algorithm, this paper extends GA3C with the auxiliary tasks from UNREAL to create a Deep Reinforcement Learning algorithm, GUNREAL, with higher learning efficiency and also benefiting from GPU acceleration. We show that our GUNREAL system reaches higher scores on several games in the same amount of time than GA3C.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131237906","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}
引用次数: 6
Topological Properties and Routing Algorithm for the Static K-ary N-tree Interconnection Network 静态K-ary N-tree互连网络的拓扑特性和路由算法
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.78
Masahiro Tozaki, Yamin Li
{"title":"Topological Properties and Routing Algorithm for the Static K-ary N-tree Interconnection Network","authors":"Masahiro Tozaki, Yamin Li","doi":"10.1109/CANDAR.2017.78","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.78","url":null,"abstract":"This paper proposes a static k-ary n-tree interconnection network. Different from the traditional k-ary n-tree network which contains compute nodes only in the leaf nodes at the lowest layer and the rest of layers contains only switches, our network consists of identical nodes that contain both the switches and compute nodes. In other words, the traditional k-ary n-tree is an indirect dynamic network and the static k-ary n-tree is a direct static network.We describe the structure of the static k-ary n-tree, derive its topological properties, give a formal shortestpath routing algorithm, and evaluate the cost/performance of the static k-ary n-tree with the comparisons to other networks.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132181855","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
Implementation of High Speed Hash Function Keccak Using CUDA on GTX 1080 高速散列函数Keccak在GTX 1080上的CUDA实现
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.47
T. N. Dat, Keisuke Iwai, T. Kurokawa
{"title":"Implementation of High Speed Hash Function Keccak Using CUDA on GTX 1080","authors":"T. N. Dat, Keisuke Iwai, T. Kurokawa","doi":"10.1109/CANDAR.2017.47","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.47","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. In this paper, the implementation of high speed hash function Keccak (SHA3-512) using the integrated development environment CUDA for GPU is proposed. The following three techniques are proposed in order to speed up its implementation. The first is improvement of constant values at step ρ and π of the algorithm. The second is using constant memory and shared memory for constant values. And the last one is the finding out the optimal configuration of blocks-threads. As the result, the implemented Keccak on GTX 1080 achieved up to maximum 20.5 GB/s for its throughput. It is about 4.4 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, the special program is also developed for passwords up to 71 characters. Moreover, the throughput of 2-time hash is also evaluated. It is proved that there is no effect when using multiple hashes to increase the security level of Keccak with password management.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128856158","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}
引用次数: 2
A Practical Collision Avoidance Method for an Inter-Chip Bus with Wireless Inductive through Chip Interface 一种实用的带无线感应芯片接口的芯片间总线避碰方法
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.15
A. Nomura, J. Kadomoto, T. Kuroda, H. Amano
{"title":"A Practical Collision Avoidance Method for an Inter-Chip Bus with Wireless Inductive through Chip Interface","authors":"A. Nomura, J. Kadomoto, T. Kuroda, H. Amano","doi":"10.1109/CANDAR.2017.15","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.15","url":null,"abstract":"One of the benefits of wireless inductive through chip interface is that it allows to build a shared bus just by placing a coil on the same location in each chip. Since providing dedicated channels for arbitration is expensive, carrier sense multiple access with collision detection (CSMA/CD) is hopeful as the bus control method. Here, a rotationpersistent collision avoidance algorithm dedicated for the wireless inter-chip bus is proposed. In the method, after the carrier sense, only a specific chip can instantly send the data, and others must wait for a random time interval. It improved the throughput of 1-persistent CSMA/CD by 33% on average.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128867477","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
The Entering and Exiting Management System by Person Specification Using Deep-CNN 基于深度cnn的人员规范进出管理系统
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.40
Hiroto Kizuna, Hiroyuki Sato
{"title":"The Entering and Exiting Management System by Person Specification Using Deep-CNN","authors":"Hiroto Kizuna, Hiroyuki Sato","doi":"10.1109/CANDAR.2017.40","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.40","url":null,"abstract":"We developed a system to manage time when students stayed at a laboratory. In order to eliminate the cumbersome authentication operation at the time of entering and exiting a laboratory, the duration that students stayed is collected by facial detection, facial recognition using the Deep-CNN, and entering and exiting detection. We narrowed the range of the facial image, increased the speed of facial detection processing, and transformed geometrically to improve facial recognition accuracy. As a result, the success rate of the facial recognition of five target people was about 97%. Further, the entering and exiting detection rate was about 84% by insertion of an entering and exiting end and by scoring using the recognition result of images. Thus, we could confirm that our system is practical.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117325772","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}
引用次数: 6
An Asynchronous P System Using Branch and Bound for the Satisfiability Problem 可满足性问题的分支定界异步P系统
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.71
Yuki Jimen, A. Fujiwara
{"title":"An Asynchronous P System Using Branch and Bound for the Satisfiability Problem","authors":"Yuki Jimen, A. Fujiwara","doi":"10.1109/CANDAR.2017.71","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.71","url":null,"abstract":"Membrane computing, which is a computational model based on cell activity, has considerable attention as one of new paradigms of computations. In the general membrane computing, computationally hard problems have been solved in a polynomial number of steps using an exponential number of membranes. However, reduction of the number of membranes must be considered to make P system more realistic model. In the paper, we propose an asynchronous P system using branch and bound, which is a well known optimization technique, to reduce the number of membranes. The proposed P system solves the satisfiability problem (SAT) with n variables and m clauses, and works in O(m2^n) sequential steps or O(mn) parallel steps. The number of membranes used in the proposed P system is evaluated using a computational simulation. The experimental result shows the effectiveness of the proposed P system.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129330764","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
Performance Evaluation for the Signature Algorithm of ISDSR on Raspberry Pi 树莓派上ISDSR签名算法的性能评估
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.68
Hideharu Kojima, Naoto Yanai
{"title":"Performance Evaluation for the Signature Algorithm of ISDSR on Raspberry Pi","authors":"Hideharu Kojima, Naoto Yanai","doi":"10.1109/CANDAR.2017.68","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.68","url":null,"abstract":"Infrastructure monitoring systems, such as bridge, tunnel, railway, and so on, are applications which adopt wireless sensor networks (WSNs). Generally, a typical WSN consists of one sink node and sensor nodes. Each sensor node creates a route between itself and the sink node to send sensing data. If attackers succeed to inject fake data or fake route information during a process to create its route, critical problems may occur. For example, the sink node cannot collect sensing data, sensor nodes cannot receive commands from the sink node, and looped routes might be created. To prevent attackers from injecting fake route information, secure routing protocols with authentication tools, such as digital signatures, have been proposed. In this paper, we focus on ISDSR that is a multi hop secure routing protocol. ISDSR guarantees route information that contains a collection of nodes storing a travel path of the received packet. Sensor nodes need more computational processes to generate signatures and to verify signatures comparing with standard multi hop routing protocols, such as AODV and DSR, by applying secure routing protocols to WSNs. In order to run secure routing protocols on a sensor node, developers have to evaluate performances on low performance devices. How long do calculation times take to generate a signature and to verify a signature? How many length of a generated signature does a packet need? To evaluate these performances on real devices, we implement both the signature algorithm of ISDSR as a multi-signature scheme and an RSA-based signature algorithm as a standard signature scheme on a Raspberry Pi. Then, we conduct experiments to measure round trip times including calculation times between two nodes and packet sizes.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130100757","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书