检索结果-南通市图书馆

DLP:towards active defense against backdoor attacks with decoupled learning process

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Cybersecurity 2024年第1期7卷 122-134页

作者： Zonghao Ying Bin Wu state key {2. of information security Institute of Information EngineeringChinese Academy of SciencesBeijingChina School of Cyber security University of Chinese Academy of SciencesBeijingChina

Deep learning models are well known to be susceptible to backdoor attack,where the attacker only needs to provide a tampered dataset on which the triggers are *** trained on the dataset will passively implant the backdoor,and triggers on the input can mislead the models during *** study shows that the model shows different learning behaviors in clean and poisoned subsets during *** on this observation,we propose a general training pipeline to defend against backdoor attacks *** models can be trained from the unreli-able dataset by decoupling the learning process into three stages,i.e.,supervised learning,active unlearning,and active semi-supervised *** effectiveness of our approach has been shown in numerous experiments across various backdoor attacks and datasets.

关键词： Deep learning Backdoor attack Active defense

New Algebraic Attacks on Grendel with the Strategy of Bypassing SPN Steps

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第3期33卷 635-644页

作者： Wenxiao QIAO Siwei SUN Lei HU state key {2. of information security Institute of Information Engineering Chinese Academy of Sciences School of Cyber security University of Chinese Academy of Sciences School of Cryptology University of Chinese Academy of Sciences state key {2. of Cryptology

The rapid development of modern cryptographic applications such as zero-knowledge,secure multiparty computation,fully homomorphic encryption has motivated the design of new so-called arithmetization-oriented symmetric *** designing ciphers in this domain is relatively new and not well-understood,the security of these new ciphers remains to be completely *** this paper,we revisit the security analysis of arithmetizat ionoriented cipher *** uses the Legendre symbol as a component,which is tailored specifically for the use in zero-knowledge and efficiently-varifiable proof *** FSE 2.2.,the first preimage attack on some original full GrendelHash instances was *** a countermeasure,the designer adds this attack into the security analysis and updates the formula to derive the secure number of *** our work,we present new algebraic attacks on *** the preimage attack,we can reduce the complexity or attack one more round than previous attacks for some *** addition,we present the first collision attack on some round-reduced instances by solving the constrained input/constrained output problem for the underlying permutations.

关键词： Ciphers Symbols Multi-party computation Complexity theory Homomorphic encryption

Big Data Access Control Mechanism Based on Two-Layer Permission Decision Structure

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第4期79卷 1705-1726页

作者： Aodi Liu Na Wang Xuehui Du Dibin Shan Xiangyu Wu Wenjuan Wang He’nan Province key laboratory of {2. security Information Engineering UniversityZhengzhou450000China

Big data resources are characterized by large scale, wide sources, and strong dynamics. Existing access controlmechanisms based on manual policy formulation by security experts suffer from drawbacks such as low policymanagement efficiency and difficulty in accurately describing the access control policy. To overcome theseproblems, this paper proposes a big data access control mechanism based on a two-layer permission decisionstructure. This mechanism extends the attribute-based access control (ABAC) model. Business attributes areintroduced in the ABAC model as business constraints between entities. The proposed mechanism implementsa two-layer permission decision structure composed of the inherent attributes of access control entities and thebusiness attributes, which constitute the general permission decision algorithm based on logical calculation andthe business permission decision algorithm based on a bi-directional long short-term memory (BiLSTM) neuralnetwork, respectively. The general permission decision algorithm is used to implement accurate policy decisions,while the business permission decision algorithm implements fuzzy decisions based on the business *** BiLSTM neural network is used to calculate the similarity of the business attributes to realize intelligent,adaptive, and efficient access control permission decisions. Through the two-layer permission decision structure,the complex and diverse big data access control management requirements can be satisfied by considering thesecurity and availability of resources. Experimental results show that the proposed mechanism is effective andreliable. In summary, it can efficiently support the secure sharing of big data resources.

关键词： Big data access control data security BiLSTM

Improved lower bound for the complexity of unique shortest vector problem

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Cybersecurity 2024年第3期7卷 102-110页

作者： Baolong Jin Rui Xue state key {2. of information security Institute of Information EngineeringChinese Academy of SciencesBeijing 100085China School of Cyber security University of Chinese Academy of SciencesBeijing 100049China

Unique shortest vector problem(uSVP)plays an important role in lattice based *** cryptographic schemes based their security on *** the cofidence of those applications,it is essential to clarify the complex-ity of uSVP with different ***,proving the NP-hardness of usVP appears quite *** the state of the art,we are even not able to prove the NP-hardness of usVP with constant *** this work,we gave a lower bound for the hardness of usVP with constant parameters,*** proved that uSVP is at least as hard as gap shortest vector problem(GapSVP)with gap of O(√n/log(n)),which is in NP n *** previous works,our reduction works for paramters in a bigger range,especially when the constant hidden by the big-O in GapsVP is smallerthan1.

关键词： Computational complexity Unique shortest vector problem Bounded distance decoding Complexity reduction

FL-EASGD:Federated Learning Privacy security Method Based on Homomorphic Encryption

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第5期79卷 2361-2373页

作者： Hao Sun Xiubo Chen Kaiguo Yuan information security Center State Key Laboratory ofNetworking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijing100876China

Federated learning ensures data privacy and security by sharing models among multiple computing nodes instead of plaintext ***,there is still a potential risk of privacy leakage,for example,attackers can obtain the original data through model inference ***,safeguarding the privacy of model parameters becomes *** proposed solution involves incorporating homomorphic encryption algorithms into the federated learning ***,the existing federated learning privacy protection scheme based on homomorphic encryption will greatly reduce the efficiency and robustness when there are performance differences between parties or abnormal *** solve the above problems,this paper proposes a privacy protection scheme named Federated Learning-Elastic Averaging Stochastic Gradient Descent(FL-EASGD)based on a fully homomorphic encryption ***,this paper introduces the homomorphic encryption algorithm into the FL-EASGD scheme to preventmodel plaintext leakage and realize privacy security in the process ofmodel ***,this paper designs a robust model aggregation algorithm by adding time variables and constraint coefficients,which ensures the accuracy of model prediction while solving performance differences such as computation speed and node anomalies such as downtime of each *** addition,the scheme in this paper preserves the independent exploration of the local model by the nodes of each party,making the model more applicable to the local data ***,experimental analysis shows that when there are abnormalities in the participants,the efficiency and accuracy of the whole protocol are not significantly affected.

关键词： Federated learning homomorphic encryption privacy security stochastic gradient descent

Constructing the Impossible Differential of Type-II GFN with Boolean Function and Its Application to WARP

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 80-89页

作者： Jiali SHI Guoqiang LIU Chao LI College of Liberal Arts and Sciences National University of Defense Technology Hunan Engineering Research Center of Commercial Cryptography Theory and Technology Innovation state key {2. of information security Institute of Information Engineering

Type-Ⅱ generalized Feist el network(GFN) has attracted a lot of attention for its simplicity and high *** differential attack is one of the powerful cryptanalytic approaches for word-oriented block ciphers such as Feistel-like *** deduce the impossible differential of Type-Ⅱ GFN by analyzing the Boolean function in the middle *** main idea is to investigate the expression with the variable representing the plaintext(ciphertext) difference words for the internal state *** adopting the miss-in-the-middle approach,we can construct the impossible differential of Type-Ⅱ *** an illustration,we apply this approach to WARP,a lightweight 12.-bit block cipher with a 12.-bit key which was presented by Banik et *** SAC *** structure of WARP is a 32.branch Type-Ⅱ ***,we find two 2.-round truncated impossible differentials and implement a 32.round key recovery attack on *** the 32.round key recovery attack on WARP,some observations are used to mount an effective *** the advantage of the early abort technique,the data,time,and memory complexities are 2.2..69chosen plaintexts,2.2..6832.round encryptions,and 2.00-bit,*** the best of our knowledge,this is the best attack on WARP in the single-key scenario.

关键词： Ciphers Boolean functions Parallel processing Complexity theory

On Isodual Double Toeplitz Codes

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick key laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China state key {2. of information security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2.the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

维普期刊数据库

Spatial Distribution Feature Extraction Network for Open Set Recognition of Electromagnetic Signal

在线全文

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2024年第4期139卷 279-296页

作者： Hui Zhang Huaji Zhou Li Wang Feng Zhou The Ministry key laboratory of Electronic {2. Countermeasure and Simulation Xidian UniversityXi’an710071China Science and Technology on Communication information security Control {2. Jiaxing314033China

This paper proposes a novel open set recognition method,the Spatial Distribution Feature Extraction Network(SDFEN),to address the problem of electromagnetic signal recognition in an open *** spatial distribution feature extraction layer in SDFEN replaces convolutional output neural networks with the spatial distribution features that focus more on inter-sample information by incorporating class center *** designed hybrid loss function considers both intra-class distance and inter-class distance,thereby enhancing the similarity among samples of the same class and increasing the dissimilarity between samples of different classes during ***,this method allows unknown classes to occupy a larger space in the feature *** reduces the possibility of overlap with known class samples and makes the boundaries between known and unknown samples more ***,the feature comparator threshold can be used to reject unknown *** signal open set recognition,seven methods,including the proposed method,are applied to two kinds of electromagnetic signal data:modulation signal and real-world *** experimental results demonstrate that the proposed method outperforms the other six methods overall in a simulated open ***,compared to the state-of-the-art Openmax method,the novel method achieves up to 8.87%and 5.2.%higher micro-F-measures,respectively.

关键词： Electromagnetic signal recognition deep learning feature extraction open set recognition

Low-resolution Kramers-Kronig detection system with error-feedback noise shaping

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2024年第5期67卷 259-269页

作者： Xiangyong DONG Zhenming YU Hongyu HUANG Kaixuan SUN Kun XU state key {2. of information Photonics and Optical Communications Beijing University of Posts and Telecommunications

In this paper, we investigated the effects of error-feedback noise shaping(EFNS) on a lowresolution Kramers-Kronig(KK) detection system for the first time. Both 16-ary quadrature amplitude modulation(16-QAM) and 64-ary quadrature amplitude modulation(64-QAM) were considered in the experiment. The carrier tone was added on the transmitter side using the virtual carrier-assisted single sideband(VCA-SSB) method to meet the minimum phase(MP) condition. Under the MP condition, KK detection only needs the intensity of the optical signal to be detected by one photodiode(PD) to retrieve the phase information. However, the virtual carrier tone increases the carrier-to-signal power ratio(CSPR), which results in a high peak-to-average power ratio(PAPR) at the transmitter, causing an increase in quantization noise. To mitigate quantization noise in the low-resolution KK detection system, EFNS was applied. The application of EFNS increased the optimal CSPR of the KK detection system and improved receiver sensitivity. Using a 4-bit DAC and the EFNS, 80 km transmission was achieved in the 60-Gbit/s 64-QAM KK detection system.

关键词： optical fiber communications Kramers-Kronig receiver error-feedback noise shaping quantization noise carrier-to-signal power ratio