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

security on a knapsack-type encryption scheme based upon hybrid-model assumption

学校读者我要写书评

暂无评论

International Journal of network security 2017年第4期19卷 644-647页

作者： Jin, Zhengping Zhang, Hong Li, Zhongxian State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing100029 China National Cybernet Security Limited Tianjin300384 China

Provable security is a reduction that breaking the scheme is usually reduced to solving some basic hard problems, thus the foundation of the scheme's security is the assumption that it is hard to solve the based problems. Due to most existing schemes are founded on single assumption, some encryption schemes, whose security are based on multiple assumptions, have been proposed. Recently, Su and Tsai constructed a knapsack-type encryption scheme based on hybrid-model, and proved it should be more secure than schemes based on single assumption. In this paper, we find that this scheme actually cannot reach the security as claimed. By launching the known message attack, we show Su and Tsai's encryption scheme cannot provide confidentiality, for the adversary could decrypt any ciphertext in this cryptosystem if one of the assumptions does not hold.

关键词： Cryptography

Polarization attack on continuous-variable quantum key distribution

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Zhao, Yijia Zhang, Yichen Huang, Yundi Xu, Bingjie Yu, Song Guo, Hong State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications Beijing100876 China Science and Technology on Security Communication Laboratory Institute of Southwestern Communication Chengdu610041 China State Key Laboratory of Advanced Optical Communication System and Network School of Electronics Engineering and Computer Science Center for Quantum Information Technology Peking University Beijing100871 China

The shot-noise unit (SNU) is a crucial factor for the practical security of a continuous-variable quantum key distribution system. In the most widely used experimental scheme, the SNU should be calibrated first and acts as a constant during the key distribution. However, the SNU of a practical system is dependent on the various parameters of the local oscillator, which can be controlled by the eavesdropper in the open channel. In this paper, we report a quantum hacking method to control the practical SNU by using the limited compensation rate of the polarization compensation. Since the compensation is only based on of the polarization measurement results of part of local oscillator pulses, the polarization of other unmeasured pulses may not be compensated correctly, which can be utilized by the eavesdropper to control the practical SNU. The simulation and experiment results indicate that the practical SNU can be controlled by the eavesdropper. Thus, the eavesdropper can use the fact that the practical SNU is no longer equals to the calibrated one to control the excess noise and final key rate. Copyright © 2018, The Authors. All rights reserved.

关键词： Shot noise

Cubic medium field equation public key cryptosystem

学校读者我要写书评

暂无评论

International Journal of network security 2018年第3期20卷 472-477页

作者： Lu, Gang Xue, Linyuan Nie, Xuyun Qin, Zhiguang Liu, Bo School of Information and Software Engineering University of Electronic Science and Technology of China 4 Jianshe North Rd 2nd Section Chenghua Qu Chengdu610054 China State Key Laboratory of Information Security Institute of Information Engineering Beijing100093 China Network and Data Security Key Laboratory of Sichuan Province Chengdu610054 China

Medium Field Equation (MFE) multivariate public key cryptosystems were broken by High Order Linearization Equation (HOLE) attack. In order to avoid HOLE attack, we proposed an improvement of MFE, Cubic MFE public key encryption scheme. In our construction, multiplications of three second order matrices were used to get a set of cubic polynomials in the central map. Through theoretical analysis and computer experiments, the Cubic MFE is shown to be secure against HOLE attack and other existing attacks. © International Journal of network security.

关键词： Linearization

Angle-domain approach for parameter estimation in high-mobility OFDM with fully/partly calibrated massive ULA

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Ge, Yinghao Zhang, Weile Gao, Feifei Minn, Hlaing MOE Key Lab for Intelligent Networks and Network Security 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 Engineering University of Texas Dallas United States

In this paper, we consider a downlink orthogonal frequency division multiplexing (OFDM) system from a base station to a high-speed train (HST) equipped with fully/partly calibrated massive uniform linear antenna-array (ULA) in wireless environments with abundant scatterers. Multiple Doppler frequency offsets (DFOs) stemming from intensive propagation paths together with transceiver oscillator frequency offset (OFO) result in a fast time-varying frequency-selective channel. We develop an angle domain carrier frequency offset (CFO, general designation for DFO and OFO) estimation approach. A high-resolution beamforming network is designed to separate different DFOs into a set of parallel branches in angle domain such that each branch is mainly affected by a single dominant DFO. Then, a joint estimation algorithm for both maximum DFO and OFO is developed for fully calibrated ULA. Next, its estimation mean square error (MSE) performance is analyzed under inter-subarray mismatches. To mitigate the detrimental effects of inter-subarray mismatches, we introduce a calibration-oriented beamforming parameter (COBP) and develop the corresponding modified joint estimation algorithm for partly calibrated ULA. Moreover, the Cramér-Rao lower bound of CFO estimation is derived. Both theoretical and numerical results are provided to corroborate the proposed method. Copyright © 2018, The Authors. All rights reserved.

关键词： Calibration

TPEFD： an SDN-based efficient elephant flow detection method

学校读者我要写书评

暂无评论

网络与信息安全学报 2017年第5期3卷 70-76页

作者： TIAN YU LIU Jing LAI Ying-xu BAO Zhen-shan ZHANG Wen-bo Faculty of Information Technology Beijing University of Technology Beijing 100124 China Key Laboratory of Trusted Computing Beijing 100124 China Information Security Rank Protection Key Technology National Engineering Laboratory Beijing 100124 China)

Software-defined networking(SDN) is a new approach to configure and operate programmable switches of the networks(especially the data center networks) through a centralized software controller. Elephant flows normally exist in data center networks and take up a large amount of network bandwidth, so the elephant flow detection is very important to ease network congestion. A two-phase real-time detection(TPEFD) method was proposed to detect the elephant flows in the SDN-based network. First, the controller obtained aggregated statistics and shrank sample scope until it was small enough, packets were sampled in the scope in switches. In order to identify the elephant flows, the sFlow sampling results were compared with the dynamic threshold. If the sampling value exceeded the threshold value, the flow was recognized as an elephant flow. The efficiency of our method in an SDN experimental environment was evaluated. The experimental results indicated that the proposed method was feasible and the detection time was efficient.

关键词： OpenFlow 象现金流量流度检波数据中心

Large branching tree based dynamic provable data possession scheme

学校读者我要写书评

暂无评论

Large branching tree based dynamic provable data possession ...

作者： Li, Yong Yao, Ge Lei, Li-Nan Wang, Hua-Qun Lin, Chang-Lu School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou350007 China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin541004 China School of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing210023 China

As the era of big data is coming, more and more users choose to store data in the cloud. Cloud storage provides users with flexible, dynamic and cost effective data storage service. However, the new paradigm of service introduces new security challenges such as users loss control of the remote data and they cannot ensure data integrity in the cloud. Moreover, supporting dynamic data updates is also a practical requirement of cloud storage. It is imperative to provide an efficient and secure dynamic auditing protocol to check the data integrity in the cloud. In this paper, we first analyze the dynamic performance of some prior works. In order to solve the inefficiency problem caused by the Merkle Hash Tree (MHT) in dynamic update, the Large Branching Tree (LBT) data structure was introduced in our Dynamic Provable Data Possession (DPDP) scheme. LBT structure simplifies the process of updates and supports updating several blocks synchronously, and reduces the auxiliary information during the challenge-respond process as well. Our scheme is able to efficiently support fully dynamic data updates and batch updates. Based on the LBT structure, we use bilinear algebraic maps to optimize the authenticate process. A signature scheme is used to authenticate both the value and the position of data blocks, which reduces computation overhead during the dynamic update phase. The security and performance analysis show that our DPDP scheme is provably secure and efficient. © 2017 Institute of Information Science. All rights reserved.

关键词： Cloud storage

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

学校读者我要写书评

暂无评论

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

Beamforming network optimization for reducing channel time variation in high-mobility massive MIMO

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Ge, Yinghao Zhang, Weile Gao, Feifei Zhang, Shun Ma, Xiaoli 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 State Key Laboratory of Integrated Services Networks Xidian University Xi'an Shaanxi710071 China Georgia Institute of Technology AtlantaGA30332 United States

Communications in high-mobility environments have caught a lot of attentions recently. In this paper, fast time-varying channels for massive multiple-input multiple-output (MIMO) systems are addressed. We derive the exact channel power spectrum density (PSD) for the uplink from a high-speed railway (HSR) to a base station (BS) and propose to further reduce the channel time variation via beamforming network optimization. A large-scale uniform linear array (ULA) is equipped at the HSR to separate multiple Doppler shifts in angle domain through high-resolution transmit beamforming. Each branch comprises a dominant Doppler shift, which can be compensated to suppress the channel time variation, and we derive the channel PSD and the Doppler spread to assess the residual channel time variation. Interestingly, the channel PSD can be exactly expressed as the product of a pattern function and a beam-distortion function. The former reflects the impact of array aperture and is the converted radiation pattern of ULA, while the latter depends on the configuration of beamforming directions. Inspired by the PSD analysis, we introduce a common configurable amplitudes and phases (CCAP) parameter to optimize the beamforming network, by partly removing the constant modulus quantized phase constraints of matched filter (MF) beamformers. In this way, the residual Doppler shifts can be ulteriorly suppressed, further reducing the residual channel time variation. The optimal CCAP parameter minimizing the Doppler spread is derived in a closed form. Numerical results are provided to corroborate both the channel PSD analysis and the superiority of beamforming network optimization technique. Copyright © 2018, The Authors. All rights reserved.

关键词： Beamforming

S-SurF: An enhanced secure bulk data dissemination in wireless sensor networks 10th

学校读者我要写书评

暂无评论

S-SurF: An enhanced secure bulk data dissemination in wirele...

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

作者： Shen, Jian Miao, Tiantian Liu, Qi Ji, Sai Wang, Chen Liu, Dengzhi Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing210044 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China

ISBN: (纸本)9783319723884

Wireless sensor networks (WSNs) have recently gained a lot of attentions as a hot topic of research, with extensive applications being explored. In WSNs, bulk data dissemination protocols are responsible for reprogramming, which have been proposed for efficiency and security. However, few of them can simultaneously achieve both reliability and security. To address this problem, we propose an enhanced protocol entitled Secure Survival of the Fittest (S-SurF) based on SurF [6] in this paper. The proposed protocol is composed of four main phases: packet preprocessing, flooding, negotiation and data verification. Moreover, S-SurF incorporates a time-reliability model to predict the minimum completion time and hence seizes the most opportune moment to transit between flooding and negotiation schemes. In addition, extensive analysis proves the efficiency and security of S-SurF. © 2017, Springer International Publishing AG.

关键词： Wireless sensor networks