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

BAST: Blockchain-Assisted Secure and Traceable Data Sharing Scheme for Vehicular Networks

IEEE Transactions on information Forensics and security 2025年 20卷 4664-4678页

作者： Liu, Xinzhong Cui, Jie Zhang, Jing Yin, Rongwang Zhong, Hong Wei, Lu Bolodurina, Irina He, Debiao School of Computer Science and Technology Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei 230039 China Anhui University Anhui Engineering Laboratory of IoT Security Technologies Hefei 230039 China Hefei University Department of Basic Experiment and Training Hefei 230601 China Orenburg State University Faculty of Mathematics and Information Technologies Orenburg 460018 Russian Federation Wuhan University School of Cyber Science and Engineering 430072 China MatrixElements Technologies Shanghai Key Laboratory of Privacy Preserving Computation Shanghai 201204 China

In vehicular networks, caching service content on edge servers (ESs) is a widely accepted strategy for promptly responding to vehicle requests, reducing communication overhead, and improving service experience. However, implementing such an architecture requires addressing the challenges associated with ES response data reliability and communication security. In this study, to tackle the ES response data reliability issue, a blockchain-assisted threshold signature scheme for cache-based vehicular networks is proposed. The scheme utilizes a threshold mechanism to sign the data broadcast by the ES, incorporates blockchain to trace malicious signers, and avoids the shortcomings and limitations associated with idealized assumptions for the ES in existing data-sharing schemes. Moreover, considering the communication security and high-speed mobility of vehicles, using the non-interactive signatures of knowledge based on the Σ-protocol, a secure and efficient message authentication scheme for vehicles and ESs is provided. Through rigorous security proofs and comprehensive analyses, our scheme satisfies the communication security requirements of vehicular networks. By leveraging the JPBC library for performance analysis, the proposed scheme demonstrates advantages as concerns both computation and communication overheads compared to related schemes. Moreover, we implemented the proposed scheme on an Ethereum test network (i.e., Goerli) to validate its feasibility. © 2005-2012 IEEE.

关键词： authentication blockchain signatures of knowledge threshold signature Vehicular networks

来源：评论

学校读者我要写书评

暂无评论

PB-UAP: Hybride Universal Adversarial Attack for Image Segmentation

PB-UAP: Hybride Universal Adversarial Attack for Image Segme...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yufei Song Ziqi Zhou Minghui Li Xianlong Wang Hangtao Zhang Menghao Deng Wei Wan Shengshan Hu Leo Yu Zhang Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology School of Computer Science and Technology Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

With the rapid advancement of deep learning, the model robustness has become a significant research hotspot, i.e., adversarial attacks on deep neural networks. Existing works primarily focus on image classification tasks, aiming to alter the model’s predicted labels. Due to the output complexity and deeper network architectures, research on adversarial examples for segmentation models is still limited, particularly for universal adversarial perturbations. In this paper, we propose a novel universal adversarial attack method designed for segmentation models, which includes dual feature separation and low-frequency scattering modules. The two modules guide the training of adversarial examples in the pixel and frequency space, respectively. Experiments demonstrate that our method achieves high attack success rates surpassing the state-of-the-art methods, and exhibits strong transferability across different models.

关键词： Training Image segmentation Perturbation methods Semantics Scattering Signal processing Predictive models Network architecture Robustness Speech processing

来源：评论

学校读者我要写书评

暂无评论

Studies on the Droplet Impact Behavior and Anti-Icing Properties on the Slippery Lubricant-Infused Porous Surface (SLIPS) of Al Conductors 11th

Studies on the Droplet Impact Behavior and Anti-Icing Proper...

引用

11th Frontier Academic Forum of Electrical Engineering, FAFEE 2024

作者： Li, Bo Bai, Jie Yang, Liuqing Dai, Xu Xiao, Jie Xiang, Huiying Zhao, Yingying Zheng, Hanwen Liao, Ruijin Yuan, Yuan Institute of Electric Power Science of Guizhou Power Grid Co. Ltd. Guiyang550002 China China Southern Power Grid Laboratory of Anti-Icing and Disaster Reduction Liupanshui553002 China State Key Laboratory of Power Transmission Equipment & System Security and New Technology Chongqing University Chongqing400044 China College of Materials Science and Engineering Chongqing University Chongqing400030 China

ISBN: (纸本)9789819788118

Slippery lubricant-infused porous surface (SLIPS) has been widely studied as a promising anti-icing surface treatment. However, the research on the lubricant effect of impact droplets and anti-icing behavior on Al conductors is not deep enough, which may limit the further practical application of this technology. In this study, SLIPS has been prepared by constructing the anodized nano-porous structure and injecting the lubricant of silicone oil. SLIPS plates show the good wettability (CA = 103.7°, CAH = 1.4°) and low ice adhesion (6.30 kPa). Frosting tests indicate SLIPS plates has good anti-frosting property and inhibits the droplets condensation. Droplets impact tests on Aluminum Stranded Conductor (ACSR) show the lubricating effects and water sliding behavior of SLIPS conductors. Results show that the slippery Al conductors have good anti-icing properties, showing ideal application potential for transmission lines. © Beijing Paike Culture Commu. Co., Ltd. 2025.

关键词： Silicones

来源：评论

学校读者我要写书评

暂无评论

New Coefficient Grouping for Complex Affine Layers

引用

Chinese Journal of Electronics 2025年第2期34卷 520-532页

作者： Wenxiao Qiao Siwei Sun Ying Chen Lei Hu Key Laboratory of Cyberspace Security Defense Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Cryptology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Cryptology Beijing China Department of Cryptology Science & Technology Beijing Electronic Science & Technology Institute Beijing China

Recently, designing symmetric primitives for applications in cryptographic protocols including multi-party computation, fully homomorphic encryption, and zero-knowledge proofs has become an important research topic. Among many such new symmetric schemes, a power function over a large finite field $\mathbb{F}_{q}$ is commonly used. In this paper, we revisit the algebraic degree's growth for a substitution-permutation network (SPN) cipher over $\mathbb{F}_{2^{n}}(n\geq 3)$ , whose S-box is defined as a composition of a power function $P(x)=x^{2^{d}+1}$ where $d\geq 1$ with a polynomial $A(x)=a_state+ \sum\limits_{w=1}^{W}a_{w}x^{2^{\beta_{w}}}$ where $a_{i}\in \mathbb{F}_{2^{n}}$ for $0\leq i\leq W$ and $a_{w}\neq 0$ for $1\leq w\leq W$ . We propose a new coefficient grouping technique, which is based on our new description of the monomials that will probably appear in the state. Specifically, we propose a new measure to find proper $(\beta_{1},\beta_{2}, \ldots,\beta_{W})$ for the algebraic degree's fastest growth and a new method to compute the algebraic degree's upper bound for arbitrary $A(x)$ . Especially for Chaghri, which was presented at ACM CCS 2022, we obtained a tighter upper bound on the algebraic degree.

关键词： Ciphers Upper bound Polynomials Multi-party computation Homomorphic encryption Galois fields S Box Cryptographic protocols

来源：评论

学校读者我要写书评

暂无评论

The Enhancing Effect of the East Asian Subtropical Westerly Jet on Summer Extreme High-Temperature Events over Central-Eastern China Since the Late 1990s

引用

Advances in Atmospheric sciences 2025年第3期42卷 453-466页

作者： Chujie GAO Yuyu NIU Gen LI Shanlei SUN Bo LU Chaofan LI Bei XU Jinglong HUANG Xiubao SUN College of Oceanography&Key Laboratory of Marine Hazards Forecasting Ministry of Natural ResourcesHohai UniversityNanjing 210098China Key Laboratory of Meteorological Disaster Ministry of Education(KLME)&Collaborative Innovation Center on Forecast and Evaluation of Meteorological Disasters(CIC-FEMD)Nanjing University of Information Science and TechnologyNanjing 210044China State Key Laboratory of Tropical Oceanography South China Sea Institute of OceanologyChinese Academy of SciencesGuangzhou 510301China Laboratory for Climate Studies and CMA-NJU Joint Laboratory for Climate Prediction Studies National Climate CenterChina Meteorological AdministrationBeijing 100081China Xiong’an Institute of Meteorological Artificial Intellegence Xiong'an 071708China Center for Monsoon System Research Institute of Atmospheric PhysicsChinese Academy of SciencesBeijing 100029China College of Earth and Planetary Sciences University of the Chinese Academy of SciencesBeijing 100049China College of Intelligent Science and Control Engineering Jinling Institute of TechnologyNanjing 211169China

The increase in frequency and intensity of Extreme High-temperature Events(EHEs)over Central-Eastern China(CEC)in recent decades has severely impacted social development and *** observation and reanalysis datasets,this study explores the effect of the East Asian subtropical westerly jet stream(EAJ)on the CEC EHEs for the summers spanning 1979–*** its general relative location to the right side of the upper-level jet stream exit region,CEC would theoretically suffer more EHEs with a stronger and northwardly-shifted EAJ in summer due to the likelihood of abnormal subsidence induced by the ***,such an EAJ–EHE connection has been unstable over the past four decades but has displayed an evident interdecadal *** the late 1990s,the interannual variation of the EAJ was manifested mainly by its meridional displacement in the northeastern part of East Asia;thus,the atmospheric responses were essentially located to the east of CEC,exerting less of an influence on the CEC ***,since the late 1990s,the EAJ variation has featured an intensity change in its center over the northwest portion of the CEC,which has resulted in a westward shift in atmospheric responses to cover the CEC ***,the EAJ could potentially affect the summer CEC EHEs during 2000–*** findings offer support for an in-depth understanding of the formation mechanisms of extreme weather/climate events of this nature and thus provide a scientific reference for seasonal climate predictions.

关键词： summer extreme high-temperature events East Asian subtropical jet atmospheric circulation central-eastern China interdecadal change

来源：评论

学校读者我要写书评

暂无评论

MAGIC: detecting advanced persistent threats via masked graph representation learning 24

MAGIC: detecting advanced persistent threats via masked grap...

引用

Proceedings of the 33rd USENIX Conference on security Symposium

作者： Zian Jia Yun Xiong Yuhong Nan Yao Zhang Jinjing Zhao Mi Wen Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China School of Software Engineering Sun Yat-sen University China National Key Laboratory of Science and Technology on Information System Security China Shanghai University of Electric Power China

ISBN: (纸本)9781939133441

Advance Persistent Threats (APTs), adopted by most delicate attackers, are becoming increasing common and pose great threat to various enterprises and institutions. Data provenance analysis on provenance graphs has emerged as a common approach in APT detection. However, previous works have exhibited several shortcomings: (1) requiring attack-containing data and a priori knowledge of APTs, (2) failing in extracting the rich contextual information buried within provenance graphs and (3) becoming impracticable due to their prohibitive computation overhead and memory *** this paper, we introduce MAGIC, a novel and flexible self-supervised APT detection approach capable of performing multi-granularity detection under different level of supervision. MAGIC leverages masked graph representation learning to model benign system entities and behaviors, performing efficient deep feature extraction and structure abstraction on provenance graphs. By ferreting out anomalous system behaviors via outlier detection methods, MAGIC is able to perform both system entity level and batched log level APT detection. MAGIC is specially designed to handle concept drift with a model adaption mechanism and successfully applies to universal conditions and detection scenarios. We evaluate MAGIC on three widely-used datasets, including both real-world and simulated attacks. Evaluation results indicate that MAGIC achieves promising detection results in all scenarios and shows enormous advantage over state-of-the-art APT detection approaches in performance overhead.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DCCT-Net: A Network Combined Dynamic CNN and Transformer for Image Compressive Sensing

DCCT-Net: A Network Combined Dynamic CNN and Transformer for...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Lijuan Xu Haixiao Mei Fenghua Tong Dawei Zhao Fuqiang Yu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Recent end-to-end image compressive sensing networks primarily use Convolutional Neural Networks (CNNs) and Transformers, each with distinct limitations: CNNs struggle with global feature capture, while Transformers lack local feature extraction. We propose a novel network, DCCT-Net, which combines Dynamic CNN (DCNN) and Transformer. This integration leverages DCNN’s local feature strengths and the Transformer’s global representation capabilities, resulting in superior image reconstruction quality. To further enhance the network’s performance, we propose a Feature Dynamic Augment Module (FDAM), which dynamically extracts features based on the saliency of segmented image regions, thereby amplifying the CNN’s local feature expression. Additionally, we design a Weighted Fusion Module (WFM), which optimizes the combination of local and global features extracted by the DCNN and Transformer, respectively. Extensive experiments demonstrate that our proposed DCCT-Net significantly outperforms most existing state-of-the-art methods in the field.

关键词： Image segmentation Image coding Signal processing Transformers Feature extraction Sensors Convolutional neural networks Speech processing Compressed sensing Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient and Privacy-preserving Edge Intelligence for 6G-Empowered Intelligent Transportation systems

引用

IEEE Network 2025年

作者： Zhu, Chenlu Fan, Xiaoxuan Deng, Xianjun Xiao, Ziheng Guo, Tingting Liu, Shenghao Sun, Jiaqi Park, Jong Hyuk Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Wuhan Kedao Geographic Information Engineering Co. Wuhan China Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea Republic of

6G-empowered Intelligent Transportation systems (ITS) generate large amounts of data through millions of devices and sensors at the terminal and network edge. Edge intelligence advances the frontier of data-driven artificial intelligence (AI) to the network edge, which enables AI applications to better utilize edge data. Broader connectivity, higher device density, and stronger data exchange present challenges for reliable device communication and privacy data protection in 6G-empowered ITS. To address these challenges, this paper proposes an energy-efficient and privacy-preserving edge intelligence framework named EP-EI. EP-EI deploys a deep reinforcement learning-based cluster head selection model at the edge to ensure energy-efficient communication for terminal devices. Meanwhile, EP-EI designs a privacy-aware hierarchical computing framework for terminal-edge-cloud to prevent privacy leakage. Furthermore, the application scenarios, challenges, and future directions of EP-EI are discussed. Finally, simulation experiments in a specific intelligent transportation case study demonstrate that EP-EI can provide energy-efficient and privacy-protecting services. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Near Optimal Probabilistic Constructions of Frameproof Codes

引用

IEEE Transactions on information Theory 2025年

作者： Liu, Miao Ma, Zengjiao Shangguan, Chong Shandong University Research Center for Mathematics and Interdisciplinary Sciences Qingdao266237 China Shandong University State Key Laboratory of Cryptography and Digital Economy Security Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education School of Cyber Science and Technology Shandong Qingdao266237 China Ministry of Education Frontiers Science Center for Nonlinear Expectations Qingdao266237 China

Frameproof codes are a class of secure codes that were originally introduced in the pioneering work of Boneh and Shaw in the context of digital fingerprinting. They can be used to enhance the security and credibility of digital contents. Let Mc,l(q) denote the largest cardinality of a q-ary c-frameproof code with length l. Based on an intriguing observation that relates Mc,l(q) to the renowned Erdős Matching Conjecture in extremal set theory, in 2003, Blackburn posed an open problem on the precise value of the limit (Formula presented). By combining several ideas from the probabilistic method, we present a lower bound for Mc,l(q), which, together with an upper bound of Blackburn, completely determines Rc,l for all fixed c, l, and resolves the above open problem in the full generality. We also present an improved upper bound for Mc,l(q). © 1963-2012 IEEE.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance

arXiv

引用

arXiv 2025年

作者： Zheng, Lingqi Fang, Weijun Qiu, Rongxing State Key Laboratory of Cryptography and Digital Economy Security Shandong University Qingdao266237 China Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Qingdao266237 China School of Cyber Science and Technology Shandong University Qingdao266237 China

Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance d and dual distance d⊥. In recent years, much research has been devoted to improving the lower bound on d, some of which have exceeded the square-root bound. The constructions presented recently seem to indicate that when the minimum distance increases, the minimum distance of its dual code decreases. In this paper, we focus on the new constructions of binary cyclic codes with length n = 2m − 1, dimension near n/2, and both relatively large minimum distance and dual distance. For m is even, we construct a family of binary cyclic codes with parameters [2m − 1, 2m−1 ± 1, d], where d ≥ 2m/2 − 1 and d⊥ ≥ 2m/2. Both the minimum distance and the dual distance are significantly better than the previous results. When m is the product of two distinct primes, we construct some cyclic codes with dimensions k = (n + 1)/2 and d > logn2 n , where the lower bound on the minimum distance is much larger than the square-root bound. For m is odd, we present two families of binary [2m − 1, 2m−1, d] cyclic codes with d ≥ 2(m+1)/2 − 1, d⊥ ≥ 2(m+1)/2 and d ≥ 2(m+3)/2 − 15, d⊥ ≥ 2(m−1)/2 respectively, which leads that d · d⊥ can reach 2n asymptotically. To the best of our knowledge, except for the punctured binary Reed-Muller codes, there is no other construction of binary cyclic codes that reaches this bound. © 2025, CC0.

关键词： Binary codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：