检索结果-内蒙古大学图书馆

12th EAI International Conference on security and Privacy in Communication Networks, SecureComm 2016

作者： Xue, Nian Liang, Lulu Zhang, Jie Huang, Xin Department of Computer Science and Software Engineering Xi’an Jiaotong-Liverpool University Suzhou China School of Electrical Engineering and Electronics and Computer Science University of Liverpool Liverpool United Kingdom China Information Technology Security Evaluation Center Beijing China

ISBN: (纸本)9783319596075

The OpenFlow protocol, as a fundamental element for Software Defined Networking (SDN) architecture, only supports for packet forwarding across switches in general networks. In this paper, the authors propose Software-Defined Function (SDF) which entitles administrators to manage the Internet of Things (IoT) devices and services through abstraction of the underlying infrastructure. The authors further present OpenFunction, a secure communications protocol stemmed from OpenFlow, which enables the IoT devices to be upgraded or reprogrammed remotely and securely. Finally, the authors implement a preliminary SDF system and evaluate its performance. The experimental results demonstrate that the SDF and OpenFunction can grant programmability, flexibility, centralization and security to the IoT. © ICST Institute for computer Sciences, Social Informatics and Telecommunications engineering 2017.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

MBSA: a lightweight and flexible storage architecture for virtual machines

MBSA: a lightweight and flexible storage architecture for vi...

引用

作者： Chen, Xian Chen, Wenzhi Lu, Zhongyong Zhang, Yu Chang, Rui Hassan, Mohammad Mehedi Alelaiwi, Abdulhameed Xiang, Yang College of Computer Science and Technology Zhejiang University Hangzhou China State Key Laboratory of Mathematic Engineering and Advanced Computing Zhengzhou China College of Computer and Information Sciences King Saud University Riyadh11543 Saudi Arabia Centre for Cyber Security Research Deakin University BurwoodVIC Australia

With the advantages of extremely high access speed, low energy consumption, nonvolatility, and byte addressability, nonvolatile memory (NVM) device has already been setting off a revolution in storage field. Conventional storage architecture needs to be optimized or even redesigned from scratch to fully explore the performance potential of NVM device. However, most previous NVM-related works only explore its low access latency and low energy consumption. Few works have been done to explore the appropriate way to use NVM device for improving virtual machine's storage performance. In this paper, we comprehensively evaluate and analyze conventional virtual machine's storage architecture. We find that, even with cutting-edge optimization technologies, virtual machine can only achieve 30% of NVM device's original performance. Based on this observation, we propose a memory bus–based storage architecture, which we named MBSA. Memory bus–based storage architecture can greatly shorten the length of virtual machine's storage input/output stack and improve NVM device's use flexibility. In addition, an efficient wear-leveling algorithm is proposed to prolong NVM device's lifespan. To evaluate the new architecture, we implement it as well as the wear-leveling algorithm on real hardware and software platform. Experimental results show that MBSA can provide a big performance improvement, about 2.55X, and the wear-leveling algorithm can efficiently balance write operations on NVM device with a negligible performance overhead (no more than 3%). Copyright © 2017 John Wiley & Sons, Ltd.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Password recovery for ZIP files based on ARM-FPGA cluster 10th

Password recovery for ZIP files based on ARM-FPGA cluster

引用

10th International Conference on security, Privacy and Anonymity in Computation, Communication and Storage, SpaCCS 2017

作者： Bai, Xu Jiang, Lei Yang, Jiajia Dai, Qiong Bhuiyan, Md. Zakirul Alam Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security University of Chinese Academy of Sciences Beijing100040 China Department of Computer and Information Sciences Fordham University BronxNY10458 United States

ISBN: (纸本)9783319723945

Password recovery of ZIP encrypted files is an important problem in computer forensics. The encryption is based on standard cryptographic algorithms as SHA1, HMAC and AES. The traditional methods such as dictionary and brute-force require very large computing power and techniques of reducing the password space. In this paper, we have developed a distributed password recovery system based on Zynq (a heterogeneous chip combining ARM CPU and FPGA fabric) cluster. The FPGA provides hardware acceleration for cryptographic algorithms. And the ARM completes the decompression after decryption to check candidate passwords. To reduce the computation of unzip, we only decompress the header of the file compressed according to different headers of common document formats. We adopt a cluster-building methodology to improve parallelism and calculation power. Finally, the experimental results show that single node is as fast as a core of i7-3770 CPU and the 48-node cluster can check 50,000 passwords per second. It also achieves about 2 × energy efficiency. © Springer International Publishing AG 2017.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

A fair scheduling algorithm for multiprocessor systems using a task satisfaction index 17

A fair scheduling algorithm for multiprocessor systems using...

引用

2017 International Conference on Research in Adaptive and Convergent Systems, RACS 2017

作者： Jung, Jinman Shin, Jongho Hong, Jiman Lee, Jinwoo Kuo, Tei-Wei Department of Information and Communication Engineering Hannam University Daejeon Korea Republic of Security Technology Group Samsung SDS Seoul Korea Republic of School of Computer Science and Engineering Soongsil University Seoul Korea Republic of Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan

ISBN: (纸本)9781450350273

With the emergence of increasingly heterogeneous devices and networks, computing systems are required to support a variety of services with difierent quality of service requirements. The degree of heterogeneity makes it more dificult to fairly allocate resources based on the client's weight. Moreover, as the systems become larger, their performance can worsen significantly. In this paper, we present a fair scheduling algorithm for multiprocessor systems using a task satisfaction index. The proposed algorithm, called LZF, aims to achieve a high level of proportional fairness for the heterogeneous tasks. The evaluation results show that its service time error is bounded between -1 and 1, and the LZF achieves the best proportional fairness among existing scheduling algorithms with respect to the average service time error. © 2017 Association for Computing Machinery.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

An FPGA-based algorithm to accelerate regular expression matching 10th

An FPGA-based algorithm to accelerate regular expression mat...

引用

10th International Conference on security, Privacy and Anonymity in Computation, Communication and Storage, SpaCCS 2017

作者： Yang, Jiajia Jiang, Lei Bai, Xu Dai, Qiong Su, Majing Bhuiyan, Md Zakirul Alam Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security University of Chinese Academy of Sciences Beijing100040 China Department of Computer and Information Sciences Fordham University BronxNY10458 United States

ISBN: (纸本)9783319723945

State-of-the-art Network Intrusion Detection Systems (NIDSs) use regular expressions (REs) to detect attacks or vulnerabilities. In order to keep up with the ever-increasing speed, more and more NIDSs need to be implemented by dedicated hardware. A major bottleneck is that NIDSs scan incoming packets just byte by byte, which greatly limits their throughput. Besides, huge memory consumption limits it’s practicability. In this paper, we propose an algorithm for regular expression matching that consumes multiple characters per time while maintaining memory efficiency. It includes 3 ideas: (1) top-k state extraction;(2) variable-stride acceleration;(3) DFA compression. We tested our algorithm on several real-life RE rulesets. The experimental results show that it achieves good performance on both memory efficiency and high throughput. It could achieve 14–22x efficiency ratio than the original DFA on Bro and Snort rulesets, and 2–7x efficiency ratio than the original DFA on l7_filter ruleset. © Springer International Publishing AG 2017.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

A privacy-aware two-factor authentication protocol based on elliptic curve cryptography for wireless sensor networks

A privacy-aware two-factor authentication protocol based on ...

引用

作者： Jiang, Qi Kumar, Neeraj Ma, Jianfeng Shen, Jian He, Debiao Chilamkurti, Naveen School of Cyber Engineering Xidian University Xi'an China Co-innovation Center for Information Supply and Assurance Technology Anhui University Hefei China Department of Computer Science and Engineering Thapar University Patiala India School of Computer and Software Nanjing University of Information Science and Technology Nanjing China State Key Lab of Software Engineering Computer School Wuhan University Wuhan China Department of Computer Systems and Computer Science La Trobe University Melbourne Australia

As one of the enabling components of Internet of things (IoT), wireless sensor networks (WSNs) have found applications in a wide range of fields, in which outside users need to directly interact with sensors to obtain sensed data. However, WSNs are vulnerable to various attacks over wireless links, such as eavesdropping and tampering. How to ensure that sensitive or critical information is only available to legal users becomes a challenging issue. Two-factor authentication combining password and smart card perfectly matches this requirement because of its practicality. However, a dozen of two-factor authentication protocols have been suggested in recent years. Owing to the challenging mission of reconciling efficiency and security requirements, it is still challenging to propose a privacy-aware two-factor protocol that is capable of providing various security features while maintaining acceptable efficiency. In this paper, we put forward a privacy-aware two-factor authentication protocol based on elliptic curve cryptography for WSNs. Our new protocol accomplishes various security features necessary for real-life application environments while maintaining acceptable efficiency. We prove that the new protocol fulfills mutual authentication in the Burrows–Abadi–Needham logic. Additionally, by way of informal security analysis, we show that the new protocol can withstand a variety of attacks and provide desirable security features. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

SMDP-Based Downlink Packet Scheduling Scheme for Solar Energy Assisted Heterogeneous Networks

SMDP-Based Downlink Packet Scheduling Scheme for Solar Energ...

引用

IEEE/ACM Int'l Conference on & Int'l Conference on cyber, Physical and Social Computing (CPSCom) Green Computing and Communications (GreenCom)

作者： Qizhen Li Jie Gao Jinming Wen Xiaohu Tang Lian Zhao Limin Sun School of Information Science and Technology Southwest Jiaotong University Chengdu China Department of Electrical and Computer Engineering Ryerson University Toronto Canada College of Information Science and Technology Jinan University Guangzhou China Beijing Key Laboratory of IoT Information Security Technology Chinese Academy of Sciences Beijing China

Renewable energy assisted heterogeneous networks (HetNets) can improve system capacity and reduce conventional energy consumption. In this paper, we propose a semi-Markov decision process (SMDP)-based downlink packet scheduling scheme for solar energy assisted HetNets, in which solar radiation is modeled as a continuous-time Markov chain (CTMC) and the arrivals of multi-class downlink packets are modeled as Poisson processes. We derive the state transition probabilities and the discounted state transition probabilities for the composite states of battery, solar radiation. To obtain an asymptotically optimal downlink packet scheduling policy, we solve the semi-Markov decision problem using the relative value iteration algorithm under average criterion and the value iteration algorithm under discounted criterion, respectively. The simulation results show that the average cost of the SMDP-based packet scheduling scheme is less than that of the heuristic packet scheduling scheme.

关键词： Solar radiation Downlink Batteries Scheduling algorithms Solar energy Job shop scheduling Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Low-Interference N-Continuous OFDM

arXiv

引用

arXiv 2018年

作者： Wei, Peng Xiao, Yue Dan, Lilin Lv, Shichao Xiang, Wei Department of Electronic Engineering Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China Tianjin Key Laboratory of Photoelectric Detection Technology and System The School of Electronics and Information Engineering Tiangong University Tianjin300387 China National Key Laboratory of Science and Technology on Communications University of Electronic Science and Technology of China Chengdu China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China Beijing Key Laboratory of IoT Information Security Technology Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China College of Science and Engineering James Cook University CairnsQLD4878 Australia

The low-interference N-continuous orthogonal frequency division multiplexing (NC-OFDM) system [25], [26] is investigated in terms of power spectrum density (PSD) and bit error rate (BER), to prove and quantify its advantages over traditional NC-OFDM. The PSD and BER performances of the low-interference scheme are analyzed and compared under the parameters of the highest derivative order (HDO) and the length of the smooth signal. In the context of PSD, different from one discontinuous point per NC-OFDM symbol in [25], the sidelobe suppression performance is evaluated upon considering two discontinuous points due to the finite continuity of the smooth signal and its higher-order derivatives. It was shown that with an increased HDO and an increased length of the smooth signal, a more rapid sidelobe decaying is achieved, for the significant continuity improvement of the OFDM signal and its higher-order derivatives. However, our PSD analysis also shows that if the length of the smooth signal is set inappropriately, the performance may be degraded, even if the HDO is large. Furthermore, it was shown in the error performance analysis that under the assumptions of perfect and imperfect synchronization, the low-interference scheme incurs small BER performance degradation for a short length of the smooth signal or a small HDO as opposed to conventional NC-OFDM. Based on analysis and simulation results, the trade-offs between sidelobe suppression and BER are studied with the above two parameters. Copyright © 2018, The Authors. All rights reserved.

关键词： Bit error rate

来源：评论

学校读者我要写书评

暂无评论

Lightweight classification of IoT malware based on image recognition

arXiv

引用

arXiv 2018年

作者： Su, Jiawei Vargas, Danilo Vasconcellos Prasad, Sanjiva Sgandurra, Daniele Feng, Yaokai Sakurai, Kouichi School of Information Science and Electrical Engineering Kyushu University Japan Faculty of Information Science and Electrical Engineering Kyushu University Japan Department of Computer Science and Engineering Indian Institute of Technology Delhi India ISG Smart Card and IoT Security Centre Royal Holloway University of London United Kingdom

The Internet of Things (IoT) is an extension of the traditional Internet, which allows a very large number of smart devices, such as home appliances, network cameras, sensors and controllers to connect to one another to share information and improve user experiences. Current IoT devices are typically micro-computers for domain-specific computations rather than traditional functionspecific embedded devices. Therefore, many existing attacks, targeted at traditional computers connected to the Internet, may also be directed at IoT devices. For example, DDoS attacks have become very common in IoT environments, as these environments currently lack basic security monitoring and protection mechanisms, as shown by the recent Mirai and Brickerbot IoT botnets. In this paper, we propose a novel light-weight approach for detecting DDos malware in IoT environments. We firstly extract one-channel gray-scale images converted from binaries, and then utilize a lightweight convolutional neural network for classifying IoT malware families. The experimental results show that the proposed system can achieve 94.0% accuracy for the classification of goodware and DDoS malware, and 81.8% accuracy for the classification of goodware and two main malware families. Copyright © 2018, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Random directions stochastic approximation with deterministic perturbations

arXiv

引用

arXiv 2018年

作者： Prashanth, L.A. Bhatnagar, Shalabh Bhavsar, Nirav Fu, Michael Marcus, Steven I. Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India Department of Computer Science and Automation Robert Bosch Centre for Cyber Physical Systems Indian Institute of Science Bangalore Bangalore India Robert H. Smith School of Business Institute for Systems Research University of Maryland College ParkMD United States Department of Electrical and Computer Engineering Institute for Systems Research University of Maryland College ParkMD United States

We introduce deterministic perturbation schemes for the recently proposed randomdirections stochastic approximation (RDSA) [19], and propose new first-order and second-order algorithms. In the latter case, these are the first second-order algorithms to incorporate deterministic perturbations. We show that the gradient and/or Hessian estimates in the resulting algorithms with deterministic perturbations are asymptotically unbiased, so that the algorithms are provably convergent. Furthermore, we derive convergence rates to establish the superiority of the first-order and second-order algorithms, for the special case of a convex and quadratic optimization problem, respectively. Numerical experiments are used to validate the theoretical results. Copyright © 2018, The Authors. All rights reserved.

关键词： Approximation theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：