检索结果-南通市图书馆

A New High-Precision and Lightweight Detection Model for Illegal Construction Objects Based on Deep Learning

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2024年第4期29卷 1002-1022页

作者： Wenjin Liu Lijuan Zhou Shudong Zhang Ning Luo Min Xu School of Cyberspace Security(School of cryptology) Hainan UniversityHaikou 570228China School of Information Engineering Capital Normal UniversityBeijing 100048China

Illegal construction has caused serious harm around the world. However, current methods are difficult to detect illegal construction activities in time, and the calculation complexity and the parameters of them are large. To solve these challenges, a new and unique detection method is proposed, which detects objects related to illegal buildings in time to discover illegal construction activities. Meanwhile, a new dataset and a high-precision and lightweight detector are proposed. The proposed detector is based on the algorithm You Only Look Once (YOLOv4). The use of DenseNet as the backbone of YDHNet enables better feature transfer and reuse, improves detection accuracy, and reduces computational costs. Meanwhile, depthwise separable convolution is employed to lightweight the neck and head to further reduce computational costs. Furthermore, H-swish is utilized to enhance non-linear feature extraction and improve detection accuracy. Experimental results illustrate that YDHNet realizes a mean average precision of 89.60% on the proposed dataset, which is 3.78% higher than YOLOv4. The computational cost and parameter count of YDHNet are 26.22 GFLOPs and 16.18 MB, respectively. Compared to YOLOv4 and other detectors, YDHNet not only has lower computational costs and higher detection accuracy, but also timely identifies illegal construction objects and automatically detects illegal construction activities.

关键词： object detection lightweight illegal buildings illegal construction objects high-precision

A closer look at the belief propagation algorithm in side-channel attack on CCA-secure PQC KEM

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第11期67卷 317-334页

作者： Kexin QIAO Zhaoyang WANG Heng CHANG Siwei SUN Zehan WU Junjie CHENG Changhai OU An WANG Liehuang ZHU School of Cyberspace Science and Technology Beijing Institute of Technology State Key Laboratory of cryptology School of cryptology University of Chinese Academy of Sciences School of Cyber Science and Engineering Wuhan University

The implementation security of post-quantum cryptography(PQC) algorithms has emerged as a critical concern with the PQC standardization process reaching its end. In a side-channel-assisted chosen-ciphertext attack, the attacker builds linear inequalities on secret key components and uses the belief propagation(BP) algorithm to solve. The number of inequalities leverages the query complexity of the attack, so the fewer the better. In this paper, we use the PQC standard algorithm CRYSTALS-KYBER as a study case to construct bilateral inequalities on key variables with substantially narrower intervals using a side-channel-assisted oracle. For KYBER512, KYBER768, and KYBER1024, the average Shannon entropy carried by such inequality is improved from the previous 0.6094, 0.4734, and 0.8544 to 0.6418, 0.4777, and 1.2007. The number of such inequalities required to recover the key utilizing the BP algorithm for KYBER512 and KYBER1024 is reduced by 5.32% and 40.53% in theory and experimentally the reduction is even *** query complexity is reduced by 43%, 37%, and 48% for KYBER512, 768, and 1024 assuming reasonably perfect reliability. Furthermore, we introduce a strategy aimed at further refining the interval of *** into the BP algorithm, we discover a measure metric named JSD(Jensen-Shannon distance)-metric that can gauge the tightness of an inequality. We then develop a machine learning-based strategy to utilize the JSD-metrics to contract boundaries of inequalities even with fewer inequalities given, thus improving the entropy carried by the system of linear inequalities. This contraction strategy is at the algorithmic level and has the potential to be employed in all attacks endeavoring to establish a system of inequalities concerning key variables.

关键词： Kyber chosen-ciphertext attack side-channel belief propagation contraction strategy machine learning

同方期刊数据库

Committed-programming reductions: formalizations,implications and relations

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第10期67卷 151-171页

作者： Jiang ZHANG Yu YU Dengguo FENG Shuqin FAN Zhenfeng ZHANG State Key Laboratory of cryptology Department of Computer Science and Engineering Shanghai Jiao Tong University Trusted Computing and Information Assurance Laboratory Institute of SoftwareChinese Academy of Sciences

In this work, we introduce a class of black-box(BB) reductions called committed-programming reduction(CPRed) in the random oracle model(ROM) and obtain the following interesting results:(1) we demonstrate that some well-known schemes, including the full-domain hash(FDH) signature(Eurocrypt1996) and the Boneh-Franklin identity-based encryption(IBE) scheme(Crypto 2001), are provably secure under CPReds;(2) we prove that a CPRed associated with an instance-extraction algorithm implies a reduction in the quantum ROM(QROM). This unifies several recent results, including the security of the Gentry-Peikert-Vaikuntanathan IBE scheme by Zhandry(Crypto 2012) and the key encapsulation mechanism(KEM) variants using the Fujisaki-Okamoto transform by Jiang et al.(Crypto 2018) in the ***, we show that CPReds are incomparable to non-programming reductions(NPReds) and randomly-programming reductions(RPReds) formalized by Fischlin et al.(Asiacrypt 2010).

关键词： provable security random oracle model quantum random oracle model black-box reduction/separation programmability

The Exchange Attack and the Mixture Differential Attack Revisited: From the Perspective of Automatic Evaluation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 19-29页

作者： Kexin QIAO Zhiyu ZHANG Zhongfeng NIU Liehuang ZHU School of Cyberspace Science and Technology Beijing Institute of Technology State Key Laboratory of cryptology Institute of Information Engineering Chinese Academy of Sciences School of Cryptography University of Chinese Academy of Sciences

Recent results show that the differential properties within quadruples boom as a new inspiration in cryptanalysis of Advanced Encryption Standard(AES)-like constructions. These methods include the exchange attack proposed in Asiacrypt’19, the mixture differential attack proposed in To SC’18, etc., where the essential properties are obtained by manually scrutinizing the structures of the AES-like constructions. This paper presents a novel framework and an automatic tool based on mixed integer linear programming to search for mixture differential distinguishers for general constructions. This framework considers what equality patterns among quadruples can make a distinguisher and traces how the patterns propagate through cipher components with accurate probability *** this tool, a 5-round AES distinguishing attack with lower complexity and more 6-round distinguishing attacks in the chosen plaintext scenarios are deduced. We prove that no exchange-type or mixture differential distinguisher exists for 7 and above rounds AES if the details of the Sbox and Mix Columns matrix are not taken into account.

关键词： Ciphers Estimation Encryption Mixed integer linear programming Complexity theory Standards

RWNeRF:Robust Watermarking Scheme for Neural Radiance Fields Based on Invertible Neural Networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第9期80卷 4065-4083页

作者： Wenquan Sun Jia Liu Weina Dong Lifeng Chen Fuqiang Di Department of Cryptographic Engineering Engineering University of PAPXi’an710086China Department of Cryptographic Engineering Key Laboratory of PAP for Cryptology and Information SecurityXi’an710086China

As neural radiance fields continue to advance in 3D content representation,the copyright issues surrounding 3D models oriented towards implicit representation become increasingly *** response to this challenge,this paper treats the embedding and extraction of neural radiance field watermarks as inverse problems of image transformations and proposes a scheme for protecting neural radiance field copyrights using invertible neural network *** 2D image watermarking technology for 3D scene protection,the scheme embeds watermarks within the training images of neural radiance fields through the forward process in invertible neural networks and extracts them from images rendered by neural radiance fields through the reverse process,thereby ensuring copyright protection for both the neural radiance fields and associated 3D ***,challenges such as information loss during rendering processes and deliberate tampering necessitate the design of an image quality enhancement module to increase the scheme’s *** module restores distorted images through neural network processing before watermark ***,embedding watermarks in each training image enables watermark information extraction from multiple *** proposed watermarking method achieves a PSNR(Peak Signal-to-Noise Ratio)value exceeding 37 dB for images containing watermarks and 22 dB for recovered watermarked images,as evaluated on the Lego,Hotdog,and Chair datasets,*** results demonstrate the efficacy of our scheme in enhancing copyright protection.

关键词： Neural radiance fields 3D scene robust watermarking invertible neural networks

Quantum algorithm for minimum dominating set problem with circuit design

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2024年第2期33卷 178-188页

作者：张皓颖王绍轩刘新建沈颖童王玉坤 Beijing Key Laboratory of Petroleum Data Mining China University of PetroleumBeijing 102249China State Key Laboratory of cryptology P.O.Box 5159Beijing 100878China

Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum *** are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete *** paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected *** expedite the search process,a quantum algorithm employing Grover’s search is ***,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search ***,a swap test method is introduced to ascertain the number of iterations *** oracle,diffusion operators,and swap test are designed with achievable quantum *** query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.

关键词： quantum algorithm circuit design minimum dominating set

维普期刊数据库

MarkINeRV: A Robust Watermarking Scheme for Neural Representation for Videos Based on Invertible Neural Networks

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第9期80卷 4031-4046页

作者： Wenquan Sun Jia Liu Lifeng Chen Weina Dong Fuqiang Di Department of Cryptographic Engineering Engineering University of PAPXi’an710086China Department of Cryptographic Engineering Key Laboratory for Cryptology and Information SecurityXi’an710086China

Recent research advances in implicit neural representation have shown that a wide range of video data distributions are achieved by sharing model weights for Neural Representation for Videos(NeRV).While explicit methods exist for accurately embedding ownership or copyright information in video data,the nascent NeRV framework has yet to address this issue *** response,this paper introduces MarkINeRV,a scheme designed to embed watermarking information into video frames using an invertible neural network watermarking approach to protect the copyright of NeRV,which models the embedding and extraction of watermarks as a pair of inverse processes of a reversible network and employs the same network to achieve embedding and extraction of *** is just that the information flow is in the opposite ***,a video frame quality enhancement module is incorporated to mitigate watermarking information losses in the rendering process and the possibility ofmalicious attacks during transmission,ensuring the accurate extraction of watermarking information through the invertible network’s inverse *** paper evaluates the accuracy,robustness,and invisibility of MarkINeRV through multiple video *** results demonstrate its efficacy in extracting watermarking information for copyright protection of *** represents a pioneering investigation into copyright issues surrounding NeRV.

关键词： Invertible neural network neural representations for videos watermarking robustness

LOL: a highly flexible framework for designing stream ciphers

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第9期67卷 62-75页

作者： Dengguo FENG Lin JIAO Yonglin HAO Qunxiong ZHENG Wenling WU Wenfeng QI Lei ZHANG Liting ZHANG Siwei SUN Tian TIAN State Key Laboratory of cryptology PLA Strategic Support Force Information Engineering University Institute of Software Chinese Academy of Sciences Westone Cryptologic Research Center School of cryptology University of Chinese Academy of Sciences

In this paper, we propose LOL, a general framework for designing blockwise stream ciphers. The proposed framework achieves ultrafast software implementations for ubiquitous virtual networks in 5G/6G environments and high-security levels for post-quantum cryptography. The LOL framework is structurally strong; furthermore, this framework and all its components enjoy high flexibility with various extensions. On the basis of the LOL framework, we propose new stream-cipher designs called LOL-MINI and LOL-DOUBLE with the support of the AES-NI and single instruction multiple data instructions. The former applies the basic LOL single mode, while the latter uses the extended parallel-dual mode. LOL-MINI and LOL-DOUBLE support 256-bit key length. Our thorough evaluations revealed that these cipher designs have 256-bit security margins against all existing cryptanalysis methods, including differential, linear, and integral. The software performances of LOL-MINI and LOL-DOUBLE can reach 89 and 135 Gbps. In addition to pure encryptions,the LOL-MINI and LOL-DOUBLE stream ciphers can be applied in a stream-cipher-then-MAC strategy to make AEAD schemes.

关键词： stream cipher 5G/6G mobile system fast software implementation

Generalized splitting-ring number theoretic transform

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第4期18卷 205-207页

作者： Zhichuang LIANG Yunlei ZHAO Zhenfeng ZHANG School of Computer Science Fudan UniversityShanghai 200433China State Key Laboratory of cryptology Beijing 100036China Institute of Software Chinese Academy of SciencesBeijing 100190China

1 Introduction Lattice-based cryptography is one of the most promising routine of post-quantum cryptography(PQC).The fundamental and time-consuming operation in lattice-based schemes is the polynomial multiplication i... 详细信息

关键词： ring splitting polynomial