检索结果-南通市图书馆

PosFuzz:augmenting greybox fuzzing with effective position distribution

在线全文

学校读者我要写书评

暂无评论

Cybersecurity 2023年第4期6卷 123-143页

作者： Yanyan Zou Wei Zou JiaCheng Zhao Nanyu Zhong Yu Zhang Ji Shi Wei Huo Institute of Information Engineering Chinese Academy of SciencesBeijingChina School of Cyber security University of Chinese Academy of SciencesBeijingChina State Key lab of Processors Institute of Computing TechnologyChinese Academy of SciencesBeijingChina Key laboratory of network Assessment Technology Chinese Academy of SciencesBeijingChina Beijing Key laboratory of network security and Protection Technology BeijingChina Zhongguancun laboratory BeijingChina

Mutation-based greybox fuzzing has been one of the most prevalent techniques for security vulnerability discovery and a great deal of research work has been proposed to improve both its efficiency and ***-based greybox fuzzing generates input cases by mutating the input seed,i.e.,applying a sequence of mutation operators to randomly selected mutation positions of the ***,existing fruitful research work focuses on scheduling mutation operators,leaving the schedule of mutation positions as an overlooked aspect of fuzzing *** paper proposes a novel greybox fuzzing method,PosFuzz,that statistically schedules mutation positions based on their historical *** makes use of a concept of effective position distribution to represent the semantics of the input and to guide the *** first utilizes Good-Turing frequency estimation to calculate an effective position distribution for each mutation *** then leverages two sampling methods in different mutating stages to select the positions from the *** have implemented PosFuzz on top of AFL,AFLFast and MOPT,called Pos-AFL,-AFLFast and-MOPT respectively,and evaluated them on the UNIFUZZ benchmark(20 widely used open source programs)and LAVA-M *** result shows that,under the same testing time budget,the Pos-AFL,-AFLFast and-MOPT outperform their counterparts in code coverage and vulnerability discovery *** with AFL,AFLFast,and MOPT,PosFuzz gets 21%more edge coverage and finds 133%more paths on *** also triggers 275%more unique bugs on average.

关键词： Greybox fuzzing Mutation position Mutation operator Code coverage Vulnerability discovery

New Identity Based Proxy Re-Encryption Scheme from Lattices

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2019年第10期16卷 174-190页

作者： Liqiang Wu Xiaoyuan Yang Minqing Zhang Longfei Liu Key lab of network and Information security Engineering University of Chinese Armed Police ForceXi’an 710086China Key lab of Computer network and Information security Xi Dian UniversityXi’an 710071China

Identity-Based Proxy Re-Encryption (IB-PRE) allows a semi-trusted proxy to convert the ciphertext encrypted under Alice’s identity into Bob’s ciphertext of the same message without leaking plaintext. Lattice-based cryptography enjoys potential resistance to quantum analysis and low computational complexity. A multi-hop and unidirectional IB-PRE from lattices is presented. We split the functions of decryption and ciphertext transformation separately, and design the double private keys mechanism, where two keys are generated for each user, one key is used to decrypt the ciphertext by Pre-Image Sampling technique, and the other is used to generate the re-encryption key by Bonsai Trees technique. The generation of the re-encryption key is non-interactive and collusion resistant. Moreover, its IND-sID-CPA security over the decisional Learning With Errors (LWE) assumption under the standard model is proved. Compared with some previous IBPRE schemes from Bilinear Pairings, the format of transformed ciphertext in our scheme remains unchanged, furthermore, it can also resist quantum analysis. Compared with some existing IB-PRE schemes from lattices with similar properties, the space of the message in our scheme is a vector of length l and the encryption process remains a lower encryption blowup factor. At last, a proof-of-concept implementation is provided.

关键词： IB-PRE lattices bonsai trees collusion resistance

A recoverable stress testing algorithm for compression and encryption cards

在线全文

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2008年第10期9卷 1398-1405页

作者： Bao-jun ZHANG Xue-zeng PAN Jie-bing WANG Ling-di PING network and security lab School of Computer Science anc~Technology Zhejiang University Hangzhou 310027 China

This study proposes a recoverable stress testing algorithm (RSTA) for such special devices as compression/decom-pression card and encryption/decryption card. It uses a chaos function to generate a random sequence, and then, according to the random sequence, generates an effective command sequence. The dispatch of command obeys a special schedule strategy we designed for such devices, i.e., the commands are sent according to the command sequence, and the complete commands are put in a buffer for further result check. RSTA is used to test the HIFN compression acceleration card SAICHI-1000. Test results show that RSTA can make the card work continuously and adequately.

关键词：应力测试随机时序不规则功能同步化并发性

Secure fusion of encrypted remote sensing images based on Brovey

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第2期64卷 243-245页

作者： Junzhi YANG Guohua CHENG Meng SHEN School of Information and Electronics Beijing Institute of Technology School of Computer Science Beijing Institute of Technology Key lab of Information network security of Ministry of Public security (The Third research Institute of Ministry of Public security)

Dear editor,In the field of image fusion, panchromatic images captured by the Satellite Pour l’Observation de la Terre(SPOT) [1]have high spatial resolutions, whereas their spectral resolutions are relatively low. On the other hand, multispectral images have high spectral resolutions; however, their spatial resolutions are low. Because the two types of images captured by satellites cannot meet the demand [2], image fusion is generally necessary in practice.

关键词： cloud computing privacy preserving Brovey image fusion remote sensing

Double-Blockchain Assisted Secure and Anonymous Data Aggregation for Fog-Enabled Smart Grid

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Engineering 2022年第1期8卷 159-169页

作者： Siguang Chen Li Yang Chuanxin Zhao Vijayakumar Varadarajan Kun Wang Jiangsu Key lab of Broadband Wireless Communication and Internet of Things Nanjing University of Posts and TelecommunicationsNanjing 210003China Jiangsu Engineering research Center of Communication and network Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China Anhui Provincial Key laboratory of network and Information security Anhui Normal UniversityWuhu 241000China School of Computer Science and Engineering Vellore Institute of TechnologyChennai 600127India Department of Electrical and Computer Engineering University of CaliforniaLos AngelesCA 90095USA

As a future energy system,the smart grid is designed to improve the efficiency of traditional power systems while providing more stable and reliable ***,this efficient and reliable service relies on collecting and analyzing users’electricity consumption data frequently,which induces various security and privacy *** address these challenges,we propose a double-blockchain assisted secure and anonymous data aggregation scheme for fog-enabled smart grid named ***,we design a three-tier architecture-based data aggregation framework by integrating fog computing and the blockchain,which provides strong support for achieving efficient and secure data collection in smart ***,we develop a secure and anonymous data aggregation mechanism with low computational overhead by jointly leveraging the Paillier encryption,batch aggregation signature and anonymous *** particular,the system achieves fine-grained data aggregation and provides effective support for power dispatching and price adjustment by the designed double-blockchain and two-level data ***,the superiority of the proposed scheme is illustrated by a series of security and computation cost analyses.

关键词： Blockchain Fog computing Homomorphic encryption Smart grid Anonymity

Two-step transmission with artificial noise for secure wireless SIMO communications

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2015年第4期58卷 115-127页

作者： WANG Bo MU PengCheng YANG PeiZhi YIN QinYe Ministry of Education Key lab for Intelligent networks and network security School of Electronic and Information Engineering Xi’an Jiaotong University

The issue of physical layer security of the wireless single-input multiple-output(SIMO) system is addressed in this paper. We propose a two-step transmission scheme with artificial noise to improve the security and the scheme does not require the channel state information of the eavesdropper. In the first step, the destination which has multiple antennas generates a random reference symbol and artificial noise and transmits them in the direction of the source and its orthogonal space, respectively. The reference symbol is received by the source without being polluted by the artificial noise, while it is jammed by the artificial noise for the eavesdropper. In the second step, the symbol of the source is multiplied by the received reference symbol and then transmitted. Finally, the destination can directly estimate the symbol of the source using the reference symbol. However, the eavesdropper needs to additionally estimate the reference symbol for demodulating the symbol of the source, which usually obtains an inaccurate result due to the artificial noise. The informationtheoretic security of our scheme is analyzed and a lower bound of the achievable secrecy rate is derived. The performance of the new scheme is compared with that of the traditional approach under different input signals through numerical simulations. The results show that the proposed scheme outperforms the traditional SIMO approach especially in the high SNR region.

关键词： wireless communication physical layer security multi-antenna SIMO artificial noise

A Caching Strategy Based on Many-to-Many Matching Game in D2D networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2021年第6期26卷 857-868页

作者： Kaihang Yu Zhonggui Ma Runyu Ni Tao Zhang School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China Key lab of Information network security Ministry of Public SecurityShanghai 201204China

Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device(D2D) networks. We model the D2D User Equipments(DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy.(1) It can cache other contents besides high popularity contents.(2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used(LRU), Equal Probability Random Cache(EPRC), and the Most Popular Content Cache(MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.

关键词： caching strategy Device-to-Device(D2D)networks Gauss determinantal point process many-to-many matching game

Analysis of Telephone Call Detail Records based on Fuzzy Decision Tree

在线全文

学校读者我要写书评

暂无评论

China Communications 2010年第6期7卷 120-127页

作者： Ding Liping Gu jian Wang Yongji Wu Jingzheng Institute of Software Chinese Academy of Sciences Beijing 100190 P. R. China Key lab of Information network security of Ministry of Public security （The Third research Institute of Ministry of Public security） Shanghai 200031 P. R. China

Digital evidences can be obtained from computers and various kinds of digital devices, such as telephones, mp3/mp4 players, printers, cameras, etc. Telephone Call Detail Records (CDRs) are one important source of digital evidences that can identify suspects and their partners. Law enforcement authorities may intercept and record specific conversations with a court order and CDRs can be obtained from telephone service providers. However, the CDRs of a suspect for a period of time are often fairly large in volume. To obtain useful information and make appropriate decisions automatically from such large amount of CDRs become more and more difficult. Current analysis tools are designed to present only numerical results rather than help us make useful decisions. In this paper, an algorithm based on Fuzzy Decision Tree (FDT) for analyzing CDRs is proposed. We conducted experimental evaluation to verify the proposed algorithm and the result is very promising.

关键词：模糊决策树电话呼叫 MP4播放器呼叫详细记录数字证据 CDR 服务供应商数码设备

Resource investment for DDoS attack resistant SDN: a practical assessment

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2023年第7期66卷 112-129页

作者： Bin YUAN Fan ZHANG Jun WAN Huan ZHAO Shui YU Deqing ZOU Qiangsheng HUA Hai JIN School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering research Center for Big Data Technology and System Services Computing Technology and System lab Hubei Engineering research Center on Big Data security Shenzhen Huazhong University of Science and Technology research Institute School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing lab School of Computer Science University of Technology Sydney

Software-defined networks(SDNs) present a novel network architecture that is widely used in various datacenters. However, SDNs also suffer from many types of security threats, among which a distributed denial of service(DDoS) attack, which aims to drain the resources of SDN switches and controllers,is one of the most common. Once the switch or controller is damaged, the network services can be *** defense schemes against DDoS attacks have been proposed from the perspective of attack detection;however, such defense schemes are known to suffer from a time consuming and unpromising accuracy, which could result in an unavailable network service before specific countermeasures are taken. To address this issue through a systematic investigation, we propose an elaborate resource-management mechanism against DDoS attacks in an SDN. Specifically, by considering the SDN topology, we leverage the M/M/c queuing model to measure the resistance of an SDN to DDoS attacks. network administrators can therefore invest a reasonable number of resources into SDN switches and SDN controllers to defend against DDoS attacks while guaranteeing the quality of service(QoS). Comprehensive analyses and empirical data-based experiments demonstrate the effectiveness of the proposed approach.

关键词： SDN security DDoS attacks resource management queueing theory QoS