2016 Fourth International Symposium on Computing and Networking (CANDAR)最新文献_第5页

Information Dissemination Scheme Using Mobile Agents in Autonomous Clustering-Based Heterogeneous Wireless Networks 基于自主聚类的异构无线网络中基于移动代理的信息传播方案

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0057

Takeshi Hashimoto, Ryota Ito, T. Ohta, Y. Kakuda

引用次数: 0

Impact of Fluctuating Goals on Adaptability of Evolvable VNF Placement Method 波动目标对可进化VNF布局方法适应性的影响

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0061

Mari Otokura, K. Leibnitz, Y. Koizumi, D. Kominami, T. Shimokawa, M. Murata

引用次数: 2

Tight Bounds for Two-Hop Delivery in Homogeneous P2P Video Streaming Systems 同构P2P视频流系统中两跳传输的紧密边界

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0018

Hironori Ando, S. Fujita

引用次数: 7

Cellular Automaton Modeling of SDP System and its Applications in 1D Traffic Flow 元胞自动机SDP系统建模及其在一维交通流中的应用

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0050

A. Tomoeda

引用次数: 0

Performance Evaluation of VM-based Intrusion Tolerant Systems with Poisson Arrivals 基于泊松到达的虚拟机入侵容忍系统性能评估

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0041

Junjun Zheng, H. Okamura, T. Dohi

引用次数: 3

A Mapping Heuristic for Minimizing Message Latency in Massively Distributed MCTS 大规模分布式MCTS中最小化消息延迟的映射启发式算法

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0100

Alonso Gragera, Vorapong Suppakitpaisarn

引用次数: 1

Automatic Generation of Temporal Feature Vectors with Application to Tourism Recommender Systems 时间特征向量的自动生成及其在旅游推荐系统中的应用

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0121

Guan-Shen Fang, S. Kamei, S. Fujita

引用次数: 5

On Availability and Energy Consumption of the Fast Connection Establishment Method by Using Bluetooth Classic and Bluetooth Low Energy 经典蓝牙和低功耗蓝牙快速连接建立方法的可用性和能耗研究

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0058

Nobuhiro Kajikawa, Yuya Minami, Eitaro Kohno, Y. Kakuda

{"title":"On Availability and Energy Consumption of the Fast Connection Establishment Method by Using Bluetooth Classic and Bluetooth Low Energy","authors":"Nobuhiro Kajikawa, Yuya Minami, Eitaro Kohno, Y. Kakuda","doi":"10.1109/CANDAR.2016.0058","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0058","url":null,"abstract":"Bluetooth is a low-energy consumption communication technology and a prospective communication method for emergency situations. A Classic Bluetooth communication network has been proposed and designed to establish an emergency mobile ad hoc network (hereinafter referred to as Classic Bluetooth MANETs). In Classic Bluetooth MANETs, a terminal can cause an excess of connection retries and connection conflicts. These problems can slow down the time it takes to establish connections. Therefore, time-consuming connection establishment causes the degradation of the operation rate in Bluetooth MANETs. In this paper, we propose a new fast connection establishment method by using both Bluetooth Classic and Bluetooth Low Energy (BLE) technologies. We have also implemented and evaluated our proposed method through real terminal experiments. As a result, we have confirmed that the connection latency of our proposed method is almost 75 percent lower than that of Classic Bluetooth MANETs and the energy consumption of our proposed method is less than that of Classic Bluetooth MANETs.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116350087","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}

引用次数: 28

Decryption of Frequent Password Hashes in Rainbow Tables 彩虹表中频繁密码哈希的解密

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0117

Hwei-Ming Ying, N. Kunihiro

{"title":"Decryption of Frequent Password Hashes in Rainbow Tables","authors":"Hwei-Ming Ying, N. Kunihiro","doi":"10.1109/CANDAR.2016.0117","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0117","url":null,"abstract":"Time-memory trade-off methods provide means to invert one way functions. Such attacks offer a flexible trade-off between running time and memory cost in accordance to users' computational resources. In particular, they can be applied to hash values of passwords in order to recover the plaintext. They were introduced by Martin Hellman and later improved by Philippe Oechslin with the introduction of rainbow tables. The drawbacks of rainbow tables are that they do not always guarantee a successful inversion. We address this issue in this paper. In the context of passwords, it is pertinent that frequently used passwords are incorporated in the rainbow table. It has been known that up to 4 given passwords can be incorporated into a chain but it is an open problem if more than 4 passwords can be achieved. We solve this problem by showing that it is possible to incorporate more of such passwords along a chain. Furthermore, we prove that this results in faster recovery of such passwords during the online running phase as opposed to assigning them at the beginning of the chains. For large chain lengths, the average improvement translates to 3 times the speed increase during the online recovery time.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"476 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134376274","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

An Estimate of the Complexity of the Section Finding Problem on Algebraic Surfaces 代数曲面上截面求出问题的复杂度估计

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0021

Shinya Okumura, K. Akiyama, T. Takagi

{"title":"An Estimate of the Complexity of the Section Finding Problem on Algebraic Surfaces","authors":"Shinya Okumura, K. Akiyama, T. Takagi","doi":"10.1109/CANDAR.2016.0021","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0021","url":null,"abstract":"Researching post-quantum cryptography has been an important task in cryptography. The section finding problem on algebraic surfaces (AS-SFP) is considered to be intractable also after building quantum computers. Thus AS-SFP is used as a basis of the security of the Algebraic Surface Cryptosystem (ASC), which is a candidate of post-quantum cryptosystems, and it is important for designing parameters which make ASC secure to estimate the complexity of AS-SFP. Solving AS-SFP is reduced to solving certain multivariate equation systems (section equation systems) of high degrees, and one can solve such equation systems by using the Grobner basis technique. Although estimating the complexity of computing a Grobner basis associated with an equation system is difficult in general, it becomes easy if the equation system is semi-regular. In this paper, we experimentally estimate the complexity of AS-SFP. From our experimental results, although we see that section equation systems do not become semi-regular in most cases for small parameters, we can infer parameters closely related to the difficulty of computing Grobner bases associated with section equation systems. According to our inference, we estimate the complexity of AS-SFP and parameters which make ASC 128-bit security against the attack by the Grobner basis technique. We also consider a brute-force attack against AS-SFP and conjecture that the brute-force attack is more efficient than the attack by the Grobner basis technique. Finally, we estimate parameters and sizes of public keys such that ASC has 128-bit security against the brute-force attack. Its size (876 bits) is much smaller than sizes of public keys in other efficient candidates of PQC.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133158436","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