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

HTOTP: Honey Time-Based One-Time Passwords

IEEE Transactions on Information Forensics and security 2025年 20卷 4438-4453页

作者： Ding, Zixuan Wang, Ding Nankai University College of Cryptology and Cyber Science Key Laboratory of Data and Intelligent System Security Ministry of Education Tianjin300350 China Chinese Academy of Sciences Key Laboratory of Cyberspace Security Defense Institute of Information Engineering Beijing100085 China

One-Time Passwords (OTPs) play a crucial role in Two-Factor Authentication (2FA) and Multi-Factor Authentication (MFA) by adding an additional layer of security. OTPs effectively reduce the risk of static passwords being intercepted and reused. Nevertheless, both academic schemes and industrial solutions face security threats stemming from server/device compromises and OTP factor forgery. Chain-based asymmetric OTP schemes are a promising approach to addressing the problem of server compromise but still face threats from device compromise and pre-generated chain leakage. We emphasize that since devices directly store the OTP seed, OTP authentication is essentially equivalent to verifying device possession. This means that in existing OTP schemes, OTP forgery and device compromise remain prevalent and difficult to overcome. In this work, we propose a brand new scheme to address OTP factor forgery and server/device compromises. For the first time, our scheme constructs a tightly coupled architecture between the password factor and the OTP factor. The OTP seed is derived from a password and a device-stored salt, preventing OTP seed extraction and OTP forgery even in the event of a device compromise. Through the integration of "honeywords" with the tightly coupled OTP architecture, the server stores decoy OTP seeds generated by decoy passwords, providing resistance against server compromises and partial password guessing from devices. We conduct a comprehensive evaluation of our OTP schemes. The computational overhead is correlated with the number of honeywords, and with the recommended set size of 20, the total verification overhead is approximately 0.24~ms . Additionally, we propose formal security properties and application metrics, and rigorously prove our scheme’s resistance against server/device compromise attacks and guessing attacks. Our scheme is the first to achieve comprehensive OTP security with low overhead. © 2005-2012 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Codes With Few Weights From Simplicial Complexes

引用

IEEE Transactions on Information Theory 2025年第5期71卷 3531-3543页

作者： Chen, Bing Xu, Yunge Hu, Zhao Li, Nian Zeng, Xiangyong Hubei University Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Wuhan430062 China Hubei University Key Laboratory of Intelligent Sensing System and Security Ministry of Education Hubei Provincial Engineering Research Center of Intelligent Connected Vehicle Network Security School of Cyber Science and Technology Wuhan430062 China State Key Laboratory of Integrated Service Networks Xi’an710071 China Hubei University Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Key Laboratory of Intelligent Sensing System and Security Ministry of Education Wuhan430062 China

Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let q be a prime power. In this paper, by using the simplicial complexes of Fmq with one single maximal element, we construct four families of linear codes over the ring Fq+uFq}( u2=0 ), which generalizes the results of Wu et al. (2020). The parameters and Lee weight distributions of these four families of codes are completely determined. Most notably, via the Gray map, we obtain several classes of optimal linear codes over Fq, including (near) Griesmer codes and distance-optimal codes. Moreover, it is shown that most of the Gray images are minimal or self-orthogonal codes which are useful in applications. © 1963-2012 IEEE.

关键词： Turbo codes

来源：评论

学校读者我要写书评

暂无评论

RIGIDITY RESULTS OF SPACE-LIKE SUBMANIFOLDS WITH PARALLEL GAUSSIAN MEAN CURVATURE VECTOR

引用

Tohoku Mathematical Journal 2025年第1期77卷 105-118页

作者： Wang, Huijuan FACULTY OF MATHEMATICS AND STATISTICS KEY LABORATORY OF APPLIED MATHEMATICS OF HUBEI PROVINCE KEY LABORATORY OF INTELLIGENT SENSING SYSTEM AND SECURITY MINISTRY OF EDUCATION HUBEI UNIVERSITY WUHAN China

In this paper, we study the space-like submanifolds with parallel Gaussian mean curvature vector in pseudo-Euclidean space. We establish a relevant Omori-Yau maximum principle for these space-like submanifolds which is closed with respect to the Euclidean topology. Then, we prove a rigidity theorem for these space-like submanifolds with ⃦ ε ⃦ <^√_n² under a growth condition on the mean curvature. Finally, we use a Liouville type result to obtain a further rigidity theorem for space-like submanifolds with parallel Gaussian mean curvature vector in pseudo-Euclidean space. © 2025 Tohoku University, Mathematical Institute. All rights reserved.

关键词： Omori-Yau maximum principle parallel Gaussian mean curvature vector Rigidity theorems space-like submanifolds

来源：评论

学校读者我要写书评

暂无评论

DSDIR: A Two-Stage Method for Addressing Noisy Long-Tailed Problems in Malicious Traffic Detection

DSDIR: A Two-Stage Method for Addressing Noisy Long-Tailed P...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Li, Guoliang Zhang, Ruiqi Sun, Zhe Xing, Lingkai Zhang, Yu College of Cyber Science Nankai University Tianjin China College of Computer Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Key Laboratory of Data and Intelligent System Security Ministry of Education Tianjin China

ISBN: (纸本)9798350368741

In recent years, deep learning based malicious traffic detection (MTD) systems have demonstrated remarkable success. However, their effectiveness tend to decrease because most malicious traffic datasets are suffered from noisy-labeled and long-tailed problems. While numerous approaches have been developed to address these two problems individually, they become inefficient when confronting the combined challenge of noisy long-tailed data, as they typically tackle only a single adverse factor at a time. This paper proposes a two-stage method called Distribution-aware sample Selection and Dynamic Instance-based Relabeling (DSDIR), which simultaneously addresses the impacts of noisy-labeled and long-tailed problems. In the first stage, a noise-independent clean sample selection method is designed to obtain a clean dataset, which converts negative effects of the long-tailed problem into positive ones. In the second stage, dynamic instance-based relabeling is designed to train a model and improve the dataset's quality simultaneously. Eventually, DSDIR not only produces a balanced and noise-tolerant model but also obtains a clean dataset. Experimental results demonstrate that in the high noise condition of 60% and 80%, the accuracy rate of DSDIR is 5% higher than the state-of-the-art methods. Our code is available at https://***/nku-ligl/DSDIR. © 2025 IEEE.

关键词： deep learning distribution estimation dynamic relabeling malicious traffic detection noisy long-tailed problem

来源：评论

学校读者我要写书评

暂无评论

Enhancing Adversarial Example Transferability via Regularized Constrained Feature Layer

引用

Computers, Materials & Continua 2025年第4期83卷 157-175页

作者： Xiaoyin Yi Long Chen Jiacheng Huang Ning Yu Qian Huang School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing401420China School of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of EducationChongqing400065China Artificial Intelligence and Big Data College Chongqing Polytechnic University of Electronic TechnologyChongqing401331China

Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior *** is achieved by leveraging the property of adversarial *** is,when generated from a surrogate model,they retain their features if applied to other models due to their good ***,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source ***,when attempting black-box transfer attacks on different target models,their effectiveness is *** solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency *** are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial ***,a regularized loss function is used to enhance the black-box transferability between different target *** proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.

关键词： Adversarial examples black-box transferability regularized constrained transfer-based adversarial attacks

来源：评论

学校读者我要写书评

暂无评论

MPGStack: Membership Privacy Protection on Graph data via Model Stacking

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Chen, Chenyang Zhang, Xiaoyu Lin, Shen Chen, Xiaofeng Shaanxi Xi'an710071 China Key Laboratory of Data and Intelligent System Security Ministry of Education China

Graph neural networks (GNNs) can retain the structural information of graph data when processing graph data via message passing mechanism. Recently, GNNs have been widely used in recommendation systems, social networks, finance, etc. However, GNNs are also vulnerable when encountering severe security and data privacy challenges. Membership inference attacks (MIA) on graph data can make the trained GNN model leak the training data, which causes serious privacy problems. However, all the studies reviewed so far suffer from the fact that there are few types of research on GNNs to defend against MIA. In this paper, we propose MPGStack: a framework that utilizes ensemble learning of GNNs to safeguard against MIA. More concretely, we propose three ensemble strategies in MPGStack: KFold, GP-KFold, and LPA-KFold, which partition the graph at different degrees of granularity based on random uniform partition, class information, and label propagation, respectively. MPGStack can enhance the target model's generalization performance, mitigate MIA, and boost classification accuracy. The experimental results conducted on seven benchmark datasets demonstrate that MPGStack can effectively defend against MIA and significantly reduce the attack model's success rate to the level of random guessing. MPGStack also improves the classification accuracy of the target model up to 99% or more. Extensive experimental results demonstrate that MPGStack is more effective, stable, and applicable to different datasets and scenarios than other methods, achieving random guessing attack models while improving the model's classification accuracy on different datasets. © 2004-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Secure Multi-way Join Query and Its Bench-Marking with Trusted Execution Environments 2nd

Secure Multi-way Join Query and Its Bench-Marking with Tru...

引用

2nd International Conference on data security and Privacy Protection, DSPP 2024

作者： Zhao, Yi Zhao, Sen Lv, Siyi School of Cyber Engineering Xidian University Xi’an China State Key Laboratory of Integrated Service Networks Xidian University Xi’an China Key Laboratory of Data and Intelligent System Security Ministry of Education Nankai University Tianjin China

ISBN: (纸本)9789819785452

Because of server-untrustable model in outsourcing encrypted database system, it’s fatal for data owners to keep their data confidential under complex query operations performed by database servers. Trusted Execution Environments (TEEs) provide a secure space for privacy computation via hardware-based methods to increase the efficiency of database system, and it ensures the availability of computing directly on sensitive data in untrusted outsourcing database servers. However, while various query schemes are designed under the combination of encrypted database and TEEs, designing an available and secure scheme for join queries on multiple data tables with TEEs remains an open problem. Besides, previous works also devote less to bench-marking multi-way joins on TEEs. In our work, we extend binary join query scheme into multi-way forms in encrypted database system based on TEEs. It combines various join algorithms based on hash functions (hash-based, radix-based, etc.) with parallelized optimizing mechanism. Besides, we do bench-marking with TEEBench framework on those multi-way join schemes in three-way forms using both cache-fit and cache-exceed datasets and do different evaluation on two TEEs hardware platforms (Intel SGX and AMD SEV) to show its availability. After that, we also propose a multi-way join scheme with access pattern protection through the combination between our previous scheme and oblivious I/O methods. With the evaluation of its efficiency and memory leakage, we can also verify the feasibility of our access-pattern-protected multi-way join scheme. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Outsourcing

来源：评论

学校读者我要写书评

暂无评论

Stacking U-Nets in U-shape: Redesigning the Information Flow in Model-based Networks for MRI Reconstruction

Stacking U-Nets in U-shape: Redesigning the Information Flow...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Qiao, Xiaoyu Li, Weisheng Xiao, Bin Huang, Yuping Yang, Lijian Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Ministry of Education Chongqing China

ISBN: (纸本)9798350368741

Model-based networks have shown convincing performance in MRI reconstruction. However, the unrolled cascades within the networks are constrained to solely obtain information from the preceding counterpart, resulting in potential error accumulation. Moreover, the linear structure fails to address the challenge of recovering fine-grained details. To tackle these problems, we propose to redesign the information flow in model-based networks. Our method features a large U-shaped network, where the nodes are built with unrolled cascades and U-Net-based regularizers. We design an input-level integration module to help the cascades acquire information from adjacent and skip-connected counterparts, building robust mappings to the target. We further design a coarse-to-fine feature-level integration module, aiming at guiding the network to progressively recover fine details. Intermediate reconstructions produced by subnetworks of different scales are integrated, enabling the extraction of complementary information to enhance the final performance. Compared with cutting-edge methods on different datasets, our method exhibits superior performances. © 2025 IEEE.

关键词： compressed sensing deep learning model-based MRI reconstruction U-Net

来源：评论

学校读者我要写书评

暂无评论

Subsampling Decomposition based k-Space Refinement for Accelerated MRI Reconstruction

Subsampling Decomposition based k-Space Refinement for Accel...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

ISBN: (纸本)9798350368741

In accelerated MRI reconstruction problem, directly recovering all the missing k-space data from undersampled measurements is highly ill-posed and often leads to suboptimal performance. To address the problem, we propose a novel deep unfolding network (DUN) with subsampling decomposition (SD) based k-space refinement to mitigate the ill-posedness. Our method employs a parallel network architecture with a primary branch unfolded by gradient descent-inspired optimization process (GD-PB) for reconstruction. Additionally, we introduce an SD-based auxiliary branch (SD-AB) that decompose the inverse problem into moderately corrupted subproblems. We design a novel subsampling mask predictor that captures both global and local spatial correlations in k-space, ensuring the SD-AB effectively preserves the most well-reconstructed subsets as reliable region (RR). The RR in SD-AB is used to periodically refine the intermediate outputs of the GD-PB, achieving improved accuracy. Experimental results reveal that our method significantly outperforms conventional and SD-based DUN techniques, achieving superior PSNR and SSIM results compared with cutting-edge methods. © 2025 IEEE.

关键词： compressed sensing deep unfolded network MRI reconstruction parallel imaging subsampling decomposition

来源：评论

学校读者我要写书评

暂无评论

Learning Preconditioners in Gates-controlled Deep Unfolding Networks based on Quasi-Newton Methods For Accelerated MRI Reconstruction

Learning Preconditioners in Gates-controlled Deep Unfolding ...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

ISBN: (纸本)9798350368741

Deep unfolding networks (DUNs) have made significant progress in MRI reconstruction, successfully tackling the problem of prolonged imaging time. However, the ill-conditioned nature of MRI reconstruction often causes slow convergence in iterative optimization, potentially compromising the performance of DUNs. In this study we propose a preconditioned and gates-controlled DUN (PGDUN) to address these challenges. Our approach starts with optimizing the step size of proximal gradient descent (PGD) through a preconditioner. To improve flexibility and adaptability, we relax the constrains on quasi-newton-based optimization procedure. We design ConvLSTM-based modules, where the gate units automatically preserve necessary long- and short-term information, facilitating the learning of optimized variables and their combinations. Furthermore, we design gate units to modulate the features fed to regularizers across different iterations, boosting their robustness against potential accumulated errors. Evaluations using PSNR and SSIM metrics reveal that our approach outperforms existing state-of-the-art methods, achieving superior reconstruction results across various sequences. © 2025 IEEE.

关键词： Compressed Sensing LSTM MRI reconstruction Preconditioner Quasi-Newton

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：