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

作者： Kumari, Saru Das, Ashok Kumar Wazid, Mohammad Li, Xiong Wu, Fan Choo, Kim-Kwang Raymond Khan, Muhammad Khurram Department of Mathematics Chaudhary Charan Singh University MeerutUttar Pradesh250 005 India Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad500 032 India School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan411 201 China Nanjing University of Information Science and Technology Nanjing210044 China Department of Computer Science and Engineering Xiamen Institute of Technology Xiamen361021 China Department of Information Systems and Cyber Security The University of Texas at San Antonio San AntonioTX78249 United States School of Computer Science China University of Geosciences Wuhan China School of Information Technology & Mathematical Sciences University of South Australia AdelaideSA Australia Center of Excellence in Information Assurance King Saud University Riyadh Saudi Arabia

A wireless sensor network (WSN) typically consists of a large number of resource-constrained sensor nodes and several control or gateway nodes. Ensuring the security of the asymmetric nature of WSN is challenging, and designing secure and efficient user authentication and key agreement schemes for WSNs is an active research area. For example, in 2016, Farash et al. proposed a user authentication and key agreement scheme for WSNs. However, we reveal previously unpublished vulnerabilities in their scheme, which allow an attacker to carry out sensor node spoofing, password guessing, user/sensor node anonymity, and user impersonation attacks. We then present a scheme, which does not suffer from the identified vulnerabilities. To demonstrate the practicality of the scheme, we evaluate the scheme using NS-2 simulator. We then prove the scheme secure using Burrows–Abadi–Needham logic. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks

arXiv

引用

arXiv 2017年

作者： Vergados, Dimitrios J. Amelina, Natalia Jiang, Yuming Kralevska, Katina Granichin, Oleg School of Electrical and Computer Engineering National Technical University of Athens Faculty of Mathematics and Mechanics Saint-Petersburg State University Department of Information Security and Communication Technology Norwegian University of Science and Technology

An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time or delay is obtained when the load is equalized throughout the network. Simulation results demonstrate that Local Voting achieves better performance in terms of average delay, maximum delay, and fairness compared to several representative scheduling algorithms from the literature. Despite being distributed, Local Voting has a very close performance to a centralized algorithm that is considered to have the optimal performance. Copyright © 2017, The Authors. All rights reserved.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

SMoNt: An ontology for crime solving through social media

引用

International Journal of Metadata, Semantics and Ontologies 2017年第2-3期12卷 71-81页

作者： Kalemi, Edlira Yildirim-Yayilgan, Sule Domnori, Elton Elezaj, Ogerta Process and Information Systems Engineering Research Centre University of Surrey Guildford SurreyGU2 7XH United Kingdom Department of Information Security and Communication Technology Norwegian University of Science and Technology Gjøvik2815 Norway Department of Computer Engineering Epoka University Tirana1039 Albania Department of Mathematics Statistics and Applied Informatics University of Tirana Tirana1000 Albania

There are numerous social networks such as Facebook, LinkedIn, Google Plus and Twitter whose data sources are becoming larger every day holding an abundance of valuable information. Among these data, digital crime evidence can be collected from online social networks (OSNs) for crime detection and further analysis. This paper describes the SMONT ontology which has been developed to give support to the process of crime investigation and prevention. The SMONT ontology covers specific data about the crime, digital evidence obtained from OSNs, information archived from police entities, and also details related to people or events which may bring the authorities closer to crime case solving. It is possible to benefit from the ontology in different ways like: intelligence gathering;reasoning over the data;smarter searches and comparisons;open data publication purposes;and for the overall management of the crime solving and prevention process. Copyright © 2017 Inderscience Enterprises Ltd.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

New efficient padding methods secure against padding oracle attacks 18th

New efficient padding methods secure against padding oracle ...

引用

18th International Conference on Information security and Cryptology, ICISC 2015

作者： Kang, HyungChul Park, Myungseo Moon, Dukjae Lee, Changhoon Kim, Jongsung Kim, Kimoon Kim, Juhyuk Hong, Seokhie Korea University Seoul Korea Republic of The Affiliated Insutitude of ETRI Seoul Korea Republic of Department of Computer Science and Engineering Seoul University of Science and Technology Seoul Korea Republic of Department of Mathematics Department of Financial Information Security Kookmin University Seoul Korea Republic of Korea Security and Internet Agency Seoul Korea Republic of

ISBN: (纸本)9783319308395

This paper proposes three new padding methods designed to withstand padding oracle attacks, which aim at recovering a plaintext without knowing the secret key by exploiting oracle’s characteristic of checking the padding during decryption. Of the ten existing padding methods, only two (ABYT-PAD and ABIT-PAD) can withstand padding oracle attacks. However, these methods are not efficient since they either use a random number generator or require MAC verification in applications. The three new padding methods proposed in this paper are secure against padding oracle attacks and more efficient compared to the two aforementioned padding methods. © Springer International Publishing Switzerland 2016.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuit

A sharp condition for exact support recovery of sparse signa...

引用

2016 IEEE International Symposium on Information Theory, ISIT 2016

作者： Wen, Jinming Zhou, Zhengchun Wang, Jian Tang, Xiaohu Mo, Qun College of Information Engineering Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China ENS de Lyon LIP Lyon69007 France School of Mathematics Southwest Jiaotong University Chengdu610031 China Dept. of Electrical and Computer Engineering Seoul National University Seoul151742 Korea Republic of Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu610031 China Department of Mathematics Zhejiang University Hangzhou310027 China

ISBN: (纸本)9781509018062

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied in the literature. In this paper, we show that for any K-sparse signal x, if the sensing matrix A satisfies the restricted isometry property (RIP) of order K+1 with restricted isometry constant (RIC) δK+1K+1 since for any given positive integer K ≥ 2 and any 1/√K+1 ≤ t K+1 = t for which OMP may fail to recover the signal x in K iterations. Moreover, the constraint on the minimum magnitude of the nonzero elements of x is weaker than existing results. © 2016 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Survey on cyberspace security

引用

Science China(Information Sciences) 2015年第11期58卷 5-47页

作者： ZHANG HuanGuo HAN WenBao LAI XueJia LIN DongDai MA JianFeng LI JianHua Computer School of Wuhan University State Key Laboratory of Mathematics Engineering and Advanced Computing Department of Computer Shanghai Jiaotong University Institute of Information Engineering Chinese Academy of Sciences School of Cyber Engineering Xidian University School of Information Security Engineering Shanghai Jiaotong University

Along with the rapid development and wide application of information technology, human society has entered the information era. In this era, people live and work in cyberspace. Cyberspace is the collection of all information systems; it is the information environment for human survival. Therefore, it is necessary to ensure the security of cyberspace. This paper gives a comprehensive introduction to research and development in this field, with a description of existing problems and some currently active research topics in the areas of cyberspace itself, cyberspace security, cryptography, network security, information system security and information content security.

关键词： cyberspace security information security cryptography network security information system security information content security

来源：评论

学校读者我要写书评

暂无评论

Big Data Analytics study «Third Wave»

Big Data Analytics study «Third Wave»

引用

International Conference on Confluence The Next Generation Information Technology Summit (Confluence)

作者： Olga Kolesnichenko Gennady Smorodin Victor Dashonok Oleg Zhurenkov Lev Mazelis Dariya Yakovleva Security Analysis Bulletin Moscow Russia CIS EMC Academic Alliance Russia St. Petersburg Russia Department of Mathematics and Engineering computer science in Economics Altai Academy of Economics and Law Barnaul Russia Department of Mathematics and Modeling Vladivostok State University of Economics and Service Vladivostok Russia Department of Information Technology and Systems Vladivostok State University of Economics and Service Vladivostok Russia

ISBN: (纸本)9781467382045

In this study EMC Academic Alliance for the first time has applied the new approach to organize the Big Data Analytics study. The Multicenter Study "Third Wave" was presented at the EMC Academic Forum Russia & CIS 2015, at the International Scientific Congress "Globalistics-2015" and at the Russia National Supercomputing Forum 2015. Was implemented the variant of morphological analysis of Text Big Data from the Internet. The Study "Third Wave" is provided by Bill Schmarzo's 6 Steps Approach. Countries are set into positive or negative image's groups, and also into two groups with indication to technological order. The study can be developed to elaborate a new index for countries' rating. Big Data Analytics Study "Third Wave" relates to the new sphere for investigation - determination of Global management metrics.

关键词： Big data Bars Economics Electromagnetic compatibility Indexes Internet Terrorism

来源：评论

学校读者我要写书评

暂无评论

A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuit

A sharp condition for exact support recovery of sparse signa...

引用

IEEE International Symposium on Information Theory

作者： Jinming Wen Zhengchun Zhou Jian Wang Xiaohu Tang Qun Mo College of Information Engineering Shenzhen University Shenzhen China ENS de Lyon LIP Lyon France School of Mathematics Southwest Jiaotong University Chengdu China Dept. of Electrical & Computer Engineering Seoul National University Seoul Korea Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu China Department of Mathematics Zhejiang University Hangzhou China

ISBN: (纸本)9781509018079

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied in the literature. In this paper, we show that for any K-sparse signal x, if the sensing matrix A satisfies the restricted isometry property (RIP) of order K+1 with restricted isometry constant (RIC) δ K+1 K+1 since for any given positive integer K ≥ 2 and any 1/√K+1 ≤ t K+1 = t for which OMP may fail to recover the signal x in K iterations. Moreover, the constraint on the minimum magnitude of the nonzero elements of x is weaker than existing results.

关键词： Matching pursuit algorithms Electronic mail Sensors Indexes Information theory Noise measurement Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Multicast adaptive logic for Dynamic Adaptive Streaming over HTTP network

Multicast adaptive logic for Dynamic Adaptive Streaming over...

引用

IEEE Conference on computer Communications Workshops, INFOCOM WKSHPS 2015

作者： Dubin, Ran Dvir, Amit Hadar, Ofer Harel, Nissim Barkan, Refael Communication Systems Engineering Ben-Gurion University of the Negev Israel Cyber Security Center Department of Computer Science and Mathematics Ariel University Israel Computer Science Department Holon Institute of Technology Israel Computer Science School College of Management Academic Studies Israel

ISBN: (纸本)9781467371315

Video streaming constitutes the vast majority of Internet traffic and the DASH protocol has become the de-facto standard in the industry of multimedia delivery. The multicast method for information distribution has the potential to dramatically reduce multimedia streaming traffic;however, to date, there is no effective Adaptive Logic (AL) designed to support multicast constraints at the client side. In this paper we present an adaptive logic that is designed specifically for multicast scenarios. A comparison of our Multicast Adaptive Logic (MAL) with leading ALs under multicast conditions demonstrates that MAL provides the best performance under multicast conditions and good performance under unicast conditions. © 2015 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Review of one-time signatures for multicast authentication in smart grid

Review of one-time signatures for multicast authentication i...

引用

International Conference & Expo on Emerging Technologies for a Smarter World (CEWIT)

作者： Cheongmin Ji Jimin Kim Jae-Young Lee Manpyo Hong Department of Computer Engineering Ajou University Suwon Republic of Korea Department of Mathematics Seoul International School Seongnam Republic of Korea Department of Cyber Security Ajou University Suwon Republic of Korea

One-time signatures are known to be one of the most promising solution for time-critical multicast authentication in environments with resource-constrained devices such as smart grid. There have been several solutions for multicast applications and TV-OTS has been known to be the most efficient scheme so far. However, there still exists several challenges for one-time signatures to be deployed in practice. We review existing onetime signatures for multicast authentication and address several challenges such as key management and storage cost problems that can inevitably arise when they are actually deployed in practice.

关键词： Authentication Public key Smart grids Wide area measurements Voltage measurement Time factors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：