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

On the importance of standardising the process of generating digital forensic reports

Forensic Science International: Reports 2019年 1卷 100008-100008页

作者： Karie, Nickson. M. Kebande, Victor R. Venter, H.S. Choo, Kim-Kwang Raymond Department of Computer Science University of Swaziland Kwaluseni Swaziland IoTaP Research Center Department of Computer Science and Media Technology Malmo University Nordenskiöldsgatan 1 211 19 Malmö Sweden Department of Computer Science University of Pretoria Private Bag X20 Hatfield 0028 Pretoria South Africa Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio TX 78249-0631 USA

AbstractThe ISO/IEC 27043:2015 international standard provides new standardised guidelines for common investigation processes across various investigation scenarios that mostly involve digital evidence. The reporting process is one of the many investigative processes described in the ISO/IEC 27043:2015 standard, but the manner in which the reporting process is presented does not constitute or cover the specificity of the presentation of the entire processes covered in the standard. In this paper, we posit the importance of having the report generation process covering details obtained from all other classes of the digital investigation processes in a standardised format, as well as the need to standardise the process of generating digital forensic reports. Such a standardised process can facilitate future automation and text analytics, sharing of reports and knowledge across jurisdictions, etc. We also identify a number of key factors, such as the use of Blockchain, which should be added to the ISO/IEC 27043 international standard in order to support a standardised digital forensic report generation process.

关键词： Standardisation Digital forensic report generation digital forensics ISO/IEC 27043:2015 Blockchain

来源：评论

学校读者我要写书评

暂无评论

SMDP-based downlink packet scheduling scheme for solar energy assisted heterogeneous networks

arXiv

引用

arXiv 2018年

作者： Li, Qizhen Gao, Jie Wen, Jinming Tang, Xiaohu Zhao, Lian Sun, Limin School of Information Science and Technology Southwest Jiaotong University Chengdu611756 China Department of Electrical and Computer Engineering Ryerson University TorontoONM5B 2K3 Canada Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada Beijing Key Laboratory of IoT Information Security Technology Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China

Renewable energy assisted heterogeneous networks 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 heterogeneous networks (HetNets), where solar radiation is modeled as a continuous-time Markov chain (CTMC) and the arrivals of multi-class downlink packets are modeled as Poisson processes. The proposed downlink packet scheduling scheme can be compatible with the mainstream wireless packet networks such as long-term evolution (LTE) networks and the fifth-generation (5G) networks because the SMDP is a real-time admission control model. 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 greedy packet scheduling scheme. Copyright © 2018, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Frequency synchronization for uplink massive MIMO with adaptive MUI suppression in angle-domain

arXiv

引用

arXiv 2018年

作者： Ge, Yinghao Zhang, Weile Gao, Feifei Li, Geoffrey Ye MOE Key Lab for Intelligent Networks and Network Security School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an Shaanxi710049 China State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Automation Tsinghua University Beijing100084 China Department of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332 United States

In this paper, we develop a novel angle-domain adaptive filtering (ADAF)-based frequency synchronization method for the uplink of a massive multiple-input multiple-output (MIMO) multiuser network, which is applicable for users with either separate or overlapped angle-of-arrival (AoA) regions. For each user, we first introduce the angle-constraining matrix (ACM), which consists of a set of selected match-filter (MF) beamformers pointing to the AoAs of the interested user. Then, the adaptive beamformer can be acquired by appropriately designing the ADAF vectors. Such beamformer can achieve two-stage adaptive multiuser interference (MUI) suppression, i.e., inherently suppressing the MUI from non-overlapping users by ACM in the first stage and substantially mitigating the MUI from adjacent overlapping users by ADAF vector in the second stage. For both separate and mutually overlapping users, the carrier frequency offset (CFO) estimation and subsequent data detection can be performed independently for each user, which significantly reduces computational complexity. Moreover, ADAF is rather robust to imperfect AoA knowledge and side cluster of scatterers, making itself promising for multiuser uplink transmission. We also analyze the performance of CFO estimation and obtain an approximated closed-form expression of mean-squared error (MSE). The effectiveness of the proposed method and its superiority over the existing methods are demonstrated by numerical results. Copyright © 2018, The Authors. All rights reserved.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

Opportunities and challenges for monitoring terrestrial biodiversity in the robotics age

引用

Nature Ecology and Evolution 2025年 1-12页

作者： Pringle, Stephen Dallimer, Martin Goddard, Mark A. Le Goff, Léni K. Hart, Emma Langdale, Simon J. Fisher, Jessica C. Abad, Sara-Adela Ancrenaz, Marc Angeoletto, Fabio Auat Cheein, Fernando Austen, Gail E. Bailey, Joseph J. Baldock, Katherine C. R. Banin, Lindsay F. Banks-Leite, Cristina Barau, Aliyu S. Bashyal, Reshu Bates, Adam J. Bicknell, Jake E. Bielby, Jon Bosilj, Petra Bush, Emma R. Butler, Simon J. Carpenter, Dan Clements, Christopher F. Cully, Antoine Davies, Kendi F. Deere, Nicolas J. Dodd, Michael Drinkwater, Rosie Driscoll, Don A. Dutilleux, Guillaume Dyrmann, Mads Edwards, David P. Farhadinia, Mohammad S. Faruk, Aisyah Field, Richard Fletcher, Robert J. Foster, Chris W. Fox, Richard Francksen, Richard M. Franco, Aldina M. A. Gainsbury, Alison M. Gardner, Charlie J. Giorgi, Ioanna Griffiths, Richard A. Hamaza, Salua Hanheide, Marc Hayward, Matt W. Hedblom, Marcus Helgason, Thorunn Heon, Sui P. Hughes, Kevin A. Hunt, Edmund R. Ingram, Daniel J. Jackson-Mills, George Jowett, Kelly Keitt, Timothy H. Kloepper, Laura N. Kramer-Schadt, Stephanie Labisko, Jim Labrosse, Frédéric Lawson, Jenna Lecomte, Nicolas de Lima, Ricardo F. Littlewood, Nick A. Marshall, Harry H. Masala, Giovanni L. Maskell, Lindsay C. Matechou, Eleni Mazzolai, Barbara McConnell, Alistair Melbourne, Brett A. Miriyev, Aslan Nana, Eric Djomo Ossola, Alessandro Papworth, Sarah Parr, Catherine L. Payo-Payo, Ana Perry, Gad Pettorelli, Nathalie Pillay, Rajeev Potts, Simon G. Prendergast-Miller, Miranda T. Qie, Lan Rolley-Parnell, Persie Rossiter, Stephen J. Rowcliffe, Marcus Rumble, Heather Sadler, Jon P. Sandom, Christopher J. Sanyal, Asiem Schrodt, Franziska Sethi, Sarab S. Shabrani, Adi Siddall, Robert Smith, Simón C. Snep, Robbert P. H. Soulsbury, Carl D. Stanley, Margaret C. Stephens, Philip A. Stephenson, P.J. Struebig, Matthew J. Studley, Matthew Svátek, Martin Tang, Gilbert Taylor, Nicholas K. Umbers, Kate D. L. Ward, Robert J. White, Patrick J. C. Whittingham, Mark J. Wich, Serge Williams, Christopher D. Yakubu, Ibrahim B. Yoh, Natalie Durrell Institute of Conservation and Ecology (DICE) School of Natural Sciences University of Kent Canterbury United Kingdom Centre for Environmental Policy Imperial College London London United Kingdom Department of Geography and Environmental Sciences Northumbria University Newcastle upon Tyne United Kingdom School of Computing Engineering and the Built Environment Edinburgh Napier University Edinburgh United Kingdom Synthotech Ltd Milner Court Hornbeam Square Harrogate United Kingdom Mechanical Engineering Department University College London London United Kingdom HUTAN SWD Kota Kinabalu Malaysia Programa de Pós-Graduação em Gestão e Tecnologia Ambiental da Universidade Federal de Rondonópolis Rondonópolis Brazil Department of Engineering Harper Adams University Newport United Kingdom Applied Ecology Research Group School of Life Sciences Anglia Ruskin University Cambridge United Kingdom Centre for Ecology and Hydrology Penicuik United Kingdom Department of Life Sciences Imperial College London Silwood Park Campus Ascot United Kingdom Department of Urban and Regional Planning Faculty of Earth and Environmental Sciences Bayero University Kano Nigeria Greenhood Nepal Kathmandu Nepal Animal Rural & Environmental Sciences Nottingham Trent University Nottinghamshire United Kingdom School of Biological and Environmental Sciences Liverpool John Moores University Liverpool United Kingdom Lincoln Centre for Autonomous Systems University of Lincoln Lincoln United Kingdom Royal Botanic Garden Edinburgh Edinburgh United Kingdom School of Biological Sciences University of East Anglia Norwich Research Park Norwich United Kingdom Digital Ecology Limited Bristol United Kingdom School of Biological Sciences University of Bristol Bristol United Kingdom Department of Computing Imperial College London London United Kingdom Department of Ecology and Evolutionary Biology University of Colorado Boulder CO United States Faculty of Science Technology Engineering

With biodiversity loss escalating globally, a step change is needed in our capacity to accurately monitor species populations across ecosystems. Robotic and autonomous systems (RAS) offer technological solutions that may substantially advance terrestrial biodiversity monitoring, but this potential is yet to be considered systematically. We used a modified Delphi technique to synthesize knowledge from 98 biodiversity experts and 31 RAS experts, who identified the major methodological barriers that currently hinder monitoring, and explored the opportunities and challenges that RAS offer in overcoming these barriers. Biodiversity experts identified four barrier categories: site access, species and individual identification, data handling and storage, and power and network availability. Robotics experts highlighted technologies that could overcome these barriers and identified the developments needed to facilitate RAS-based autonomous biodiversity monitoring. Some existing RAS could be optimized relatively easily to survey species but would require development to be suitable for monitoring of more ‘difficult’ taxa and robust enough to work under uncontrolled conditions within ecosystems. Other nascent technologies (for instance, new sensors and biodegradable robots) need accelerated research. Overall, it was felt that RAS could lead to major progress in monitoring of terrestrial biodiversity by supplementing rather than supplanting existing methods. Transdisciplinarity needs to be fostered between biodiversity and RAS experts so that future ideas and technologies can be codeveloped effectively. © The Author(s) 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting vulnerable software components using software network graph 9th

Predicting vulnerable software components using software net...

引用

9th International Symposium on cyberspace Safety and security, CSS 2017

作者： Wei, Shengjun Du, Xiaojiang Hu, Changzhen Shan, Chun Beijing Key Laboratory of Software Security Engineering Technique Beijing Institute of Technology Beijing100081 China Department of Computer and Information Sciences Temple University PhiladelphiaPA19122 United States

ISBN: (纸本)9783319694702

Vulnerability Prediction Models (VPMs) are used to predict vulnerability-prone modules and now many software security metrics have been proposed. In this paper, we predict vulnerability-prone components. Based on software network graph we define component cohesion and coupling metrics which are used as security metrics to build the VPM. To validate the prediction performance, we conduct an empirical study on Firefox 3.6. We compare the results with other works’, it shows that our model has a good performance in the accuracy, precision, and recall, and indicate that the proposed metrics are also effective in vulnerability prediction. © 2017, Springer International Publishing AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Information Leakage in Encrypted Deduplication via Frequency Analysis

Information Leakage in Encrypted Deduplication via Frequency...

引用

International Conference on Dependable Systems and Networks (DSN)

作者： Jingwei Li Chuan Qin Patrick P. C. Lee Xiaosong Zhang University of Electronic Science and Technology of China Chengdu CN Department of Computer Science and Engineering The Chinese University of Hong Kong Center for Cyber Security University of Electronic Science and Technology of China

ISBN: (纸本)9781538605431

Encrypted deduplication seamlessly combines encryption and deduplication to simultaneously achieve both data security and storage efficiency. State-of-the-art encrypted deduplication systems mostly adopt a deterministic encryption approach that encrypts each plaintext chunk with a key derived from the content of the chunk itself, so that identical plaintext chunks are always encrypted into identical ciphertext chunks for deduplication. However, such deterministic encryption inherently reveals the underlying frequency distribution of the original plaintext chunks. This allows an adversary to launch frequency analysis against the resulting ciphertext chunks, and ultimately infer the content of the original plaintext chunks. In this paper, we study how frequency analysis practically affects information leakage in encrypted deduplication storage, from both attack and defense perspectives. We first propose a new inference attack that exploits chunk locality to increase the coverage of inferred chunks. We conduct trace-driven evaluation on both real-world and synthetic datasets, and show that the new inference attack can infer a significant fraction of plaintext chunks under backup workloads. To protect against frequency analysis, we borrow the idea of existing performance-driven deduplication approaches and consider an encryption scheme called MinHash encryption, which disturbs the frequency rank of ciphertext chunks by encrypting some identical plaintext chunks into multiple distinct ciphertext chunks. Our trace-driven evaluation shows that MinHash encryption effectively mitigates the inference attack, while maintaining high storage efficiency.

关键词： Encryption Maximum likelihood estimation Time-frequency analysis Data models computer security

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Social Network Data Publishing Algorithm Based on Differential Privacy

引用

Journal of Information security 2017年第4期8卷 328-338页

作者： Zhenpeng Liu Yawei Dong Xuan Zhao Bin Zhang School of Cyber Security and Computer Hebei University Baoding China Center for Information Technology Hebei University Baoding China School of Electronic Information Engineering Hebei University Baoding China

Social network contains the interaction between social members, which constitutes the structure and attribute of social network. The interactive relationship of social network contains a lot of personal privacy information. The direct release of social network data will cause the disclosure of privacy information. Aiming at the dynamic characteristics of social network data release, a new dynamic social network data publishing method based on differential privacy was proposed. This method was consistent with differential privacy. It is named DDPA (Dynamic Differential Privacy Algorithm). DDPA algorithm is an improvement of privacy protection algorithm in static social network data publishing. DDPA adds noise which follows Laplace to network edge weights. DDPA identifies the edge weight information that changes as the number of iterations increases, adding the privacy protection budget. Through experiments on real data sets, the results show that the DDPA algorithm satisfies the user’s privacy requirement in social network. DDPA reduces the execution time brought by iterations and reduces the information loss rate of graph structure.

关键词： Dynamic Social Network Data Publishing Differential Privacy

来源：评论

学校读者我要写书评

暂无评论

Effects of csi knowledge on secrecy of threshold-selection decode-and-forward relaying

arXiv

引用

arXiv 2018年

作者： Kundu, Chinmoy Ghose, Sarbani Ngatche, Telex M.N. Dobre, Octavia A. Duong, Trung Q. Bose, Ranjan School of Electronics Electrical Engineering and Computer Science Queen’s University Belfast Northern Ireland United Kingdom Cryptology and Security Research Unit Indian Statistical Institute Kolkata700108 India Engineering and Applied Science Memorial University Canada Department of Electrical Engineering Indian Institute of Technology Delhi New Delhi110016 India

—This paper considers secrecy of a three node cooperative wireless system in the presence of a passive eavesdropper. The threshold-selection decode-and-forward (DF) relay is considered, which can decode the source message correctly only if a predefined signal-to-noise ratio (SNR) is achieved. The effects of channel state information (CSI) availability on secrecy outage probability (SOP) and ergodic secrecy rate (ESR) are investigated, and closed-form expressions are derived. Diversity is achieved from the direct and relaying paths both at the destination and at the eavesdropper by combinations of maximal-ratio combining (MRC) and selection combining (SC) schemes. An asymptotic analysis is provided when each hop SNR is the same in the balanced case and when it is different in the unbalanced case. The analysis shows that both hops can be a bottleneck for secure communication;however, they do not affect the secrecy identically. While it is observed that CSI knowledge can improve secrecy, the amount of improvement for SOP is more when the required rate is low and for ESR when the operating SNR is also low. It is also shown that the source to eavesdropper link SNR is more crucial for secure communication. Copyright © 2018, The Authors. All rights reserved.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

On the design of a secure user authentication and key agreement scheme for wireless sensor networks

On the design of a secure user authentication and key agreem...

引用

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Mobile Social Network Forensic Analysis Based on Visualization Method

Mobile Social Network Forensic Analysis Based on Visualizati...

引用

2017 6th International Conference on Advanced Materials and computer Science(ICAMCS 2017)

作者： Jiating Li Chunguang Ma Min Yu Chao Liu College of Computer Science and Technology Harbin Engineering University Institution of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences

Nowadays, so much personal information is stored in the mobile phone, especially in mobile social network. Due to the large amount of data in the mobile phone, it is very difficult to extract and analyze the evidence of the mobile phone. The paper presents a visualization forensic analysis method based on mobile social network, and a forensic analysis of mobile phone messages and call records was conducted, the results shows which makes the evidence more intuitive and improves the efficiency of phone forensics. The method can be used as reference for forensic analysts.

关键词： Forensic Analysis Visualization Mobile Social Network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：