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

A Novel Approach to Cloud security: Publicly Verifiable Remote Signcryption Framework

IEEE Internet of Things Journal 2025年第10期12卷 14828-14844页

作者： Ali, Mohammad Liu, Ximeng Amirkabir University of Technology Department of Mathematics and Computer Science Tehran Iran Fuzhou University Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou350108 China

In communication systems, ensuring both data integrity and confidentiality is crucial. Traditional methods, such as encryption and signature schemes, handle these aspects separately, leading to inefficiencies. Signcryption techniques, which address both requirements simultaneously, present a more efficient alternative. Nonetheless, they are unsuitable for cloud storage systems due to their reliance on original files for data auditing. Remote data integrity checking (RDIC) methods resolve this issue but compromise data confidentiality. To bridge the gap between signcryption and RDIC approaches, remote signcryption (RSC) has been proposed. However, existing RSC methods lack support for public auditing, rendering data auditing non-outsourcable. This paper introduces publicly verifiable remote signcryption (PVRSC) to address this shortcoming and presents the first concrete PVRSC scheme with public verifiability. We define the security model for PVRSC and prove its robustness based on the hardness of the Bilinear Diffie-Hellman (BDH) problem. Our implementation on real data shows that PVRSC significantly outperforms existing methods, achieving speeds up to 100 times faster and reducing communication costs by half compared to RDIC methods. For outsourced data up to 5MB, PVRSC maintains a communication cost below 8KB during data recovery, a substantial improvement over classical signcryption approaches, which exceed 5MB. © 2014 IEEE.

关键词： Cloud security

来源：评论

学校读者我要写书评

暂无评论

Understanding User Passwords through Parsing Tree

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Wang, Ding Shan, Xuan Wu, Yuxuan Jia, Chunfu Nankai University College of Cryptology and Cyber Science Tianjin300350 China Ministry of Education of China Henan Key Laboratory of Network Cryptography Key Laboratory of Cyberspace Security China Nankai University Tianjin Key Laboratory of Network and Data Security Technology Tianjin300350 China

Passwords are today's dominant form of authentication, and password guessing is the most effective method for evaluating password strength. Most password guessing models (e.g., PCFG, Markov, and RFGuess) regard passwords as sequences composed of basic units (i.e., characters/segments), with the information flow being unidirectional (i.e., predicting the next unit based on the preceding units). However, modeling passwords in a single direction fails to capture users' password creation behavior that is actually impacted by the full password context. Through an in-depth analysis of real-world passwords, we reveal that users often create passwords around a central keyword, like common words, names, or dates, and then embellish them with numbers or symbols. Based on this observation, we, for the first time, attempt to parse passwords as trees. Unlike existing sequence models, trees can reveal the semantic connections within passwords and the logical thought processes users follow when creating passwords. For instance, in the password iloveyou, the basic units i and you are semantically dependent on the predicate love, forming a natural tree structure. We propose a trawling guessing model called PassTree and a targeted guessing model based on personally identifiable information (PII), named PassTree-PII. Our extensive experiments demonstrate the effectiveness of our models: (1) PassTree outperforms its leading counterparts by 0.38%-2.51% when guessing numbers are below 107 (2) PassTree-PII achieves a cracking rate comparable to the state-of-the-art RFGuess-PII proposed in USENIX security'23, but operates significantly more efficiently, using only 0.87% of the memory and being 16.60 times faster. Our work provides a new perspective on understanding user passwords and demonstrates a feasible technical route of applying tree structures to password guessing. © 2025 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Get the Punchline: Headline-Centric Multi-View Learning for Personalized Headline Generation

IEEE Transactions on Audio, Speech and Language Processing

引用

IEEE Transactions on Audio, Speech and Language Processing 2025年 33卷 962-973页

作者： Wenya Guo Shenglong Yu Ying Zhang Zhengkun Zhang Xiaojie Yuan College of Computer Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology College of Cyber Science Nankai University Tianjin China

Personalized news headline generation aims to generate a user-specific headline based on their reading histories. Existing approaches incorporate information from various aspects of news articles, which leads to a lack of focus on news headlines and fails to capture accurate information for guiding headline generation. As a result, the generated headlines lack differences across users and fail to reflect user-specific information. To address this problem, we propose a Headline-centric Multi- view Headline Generation network, denoted as HMvNet. HMvNet is an extraction-integration method that centers around the punchline, i.e. the user-specific information contained in history headlines. HMvNet extracts user-preferred entity tokens and syntactic structures from history headlines through the token-level view and the sequence-level view, respectively. Besides, we propose a reinforcement learning method specifically designed for personalized headline generation to train HMvNet. This method allows the model to fully leverage extracted information and ensures the fluency of the generated headlines. Experimental results demonstrate the superiority of the proposed personalization modeling method as well as the reinforcement learning framework.

关键词： History data mining Syntactics Reinforcement learning Recommender systems Generators Training User preference Speech processing Hybrid power systems

来源：评论

学校读者我要写书评

暂无评论

MMH-FE:AMulti-Precision and Multi-Sourced Heterogeneous Privacy-Preserving Neural network Training Based on Functional Encryption

引用

Computers, Materials & Continua 2025年第3期82卷 5387-5405页

作者： Hao Li Kuan Shao Xin Wang Mufeng Wang Zhenyong Zhang The State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences)Jinan250014China China Industrial Control Systems Cyber Emergency Response Team Beijing100040China

Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model ***,dishonest clouds may infer user data,resulting in user data *** schemes have achieved secure outsourced computing,but they suffer from low computational accuracy,difficult-to-handle heterogeneous distribution of data from multiple sources,and high computational cost,which result in extremely poor user experience and expensive cloud computing *** address the above problems,we propose amulti-precision,multi-sourced,andmulti-key outsourcing neural network training ***,we design a multi-precision functional encryption computation based on Euclidean ***,we design the outsourcing model training algorithm based on a multi-precision functional encryption with multi-sourced ***,we conduct experiments on three *** results indicate that our framework achieves an accuracy improvement of 6%to 30%.Additionally,it offers a memory space optimization of 1.0×2^(24) times compared to the previous best approach.

关键词： Functional encryption multi-sourced heterogeneous data privacy preservation neural networks

来源：评论

学校读者我要写书评

暂无评论

POINTERGUESS: targeted password guessing model using pointer mechanism 24

POINTERGUESS: targeted password guessing model using pointer...

引用

Proceedings of the 33rd USENIX Conference on security Symposium

作者： Kedong Xiu Ding Wang College of Cyber Science Nankai University Tianjin China and Key Laboratory of Data and Intelligent System Security (NKU) Ministry of Education Tianjin China and Tianjin Key Laboratory of Network and Data Security Technology Nankai University Tianjin China

ISBN: (纸本)9781939133441

Most existing targeted password guessing models view users' reuse behaviors as sequences of edit operations (e.g., insert and delete) performed on old passwords. These atomic edit operations are limited to modifying one character at a time and cannot fully cover users' complex password modification behaviors (e.g., modifying the password structure). This partially leads to a significant gap between the proportion of users' reused passwords and the success rates that existing targeted password models can achieve. To fill this gap, this paper models users' reuse behaviors by focusing on two key components: (1) What they want to copy/keep; (2) What they want to tweak. More specifically, we introduce the pointer mechanism and propose a new targeted guessing model, namely POINTERGUESS. By hierarchically redefining password reuse from both personal and population-wide perspectives, we can accurately and comprehensively characterize users' password reuse behaviors. Moreover, we propose MS-POINTERGUESS, which can employ the victim's multiple leaked *** employing 13 large-scale real-world password datasets, we demonstrate that POINTERGUESS is effective: (1) When the victim's password at site A (namely pwA) is known, within 100 guesses, the average success rate of POINTERGUESS in guessing her password at site B (namely pwB, pwA ≠ pwB) is 25.21% (for common users) and 12.34% (for security-savvy users), respectively, which is 21.23%~71.54% (38.37% on average) higher than its foremost counterparts; (2) When not excluding identical password pairs (i.e., pwA can equal pwB), within 100 guesses, the average success rate of POINTERGUESS is 48.30% (for common users) and 28.42% (for security-savvy users), respectively, which is 6.31%~15.92% higher than its foremost counterparts; (3) Within 100 guesses, the MS-POINTERGUESS further improves the cracking success rate by 31.21% compared to POINTERGUESS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Improved Multi-objective Particle Swarm Optimization Algorithm with Reduced Initial Search Space 21st

An Improved Multi-objective Particle Swarm Optimization Algo...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Zhiguang, Chu Yingchen, Fan Xiaolei, Zhang Ruyan, Zhang Xing, Zhang School of Electronics and Information Engineering Liaoning University of Technology Jinzhou121000 China Key Laboratory of Security for Network and Data in Industrial Internet of Liaoning Province Jinzhou121000 China

ISBN: (纸本)9789819601240

As data dimensions continue to increase, the challenges of data storage become more severe. While feature selection can reduce the complexity of high-dimensional data, existing methods are prone to local optima and high computational costs. To address these issues, this paper proposes a hybrid feature selection method based on MOPSO (Multi-Objective Particle Swarm Optimization). This method first uses a filter approach to narrow the search space, then employs a particle swarm algorithm to generate particles, incorporating mutation, crossover, and selection strategies during particle updates to enhance their search capabilities. Additionally, an archive set is established, utilizing grid-based and density-based methods during the update process to avoid local optima. Finally, the proposed method is compared with two single-objective optimization methods and two multi-objective optimization methods on multiple datasets. Experimental results demonstrate that the proposed method significantly reduces classification error rates and effectively reduces the number of features, providing an efficient solution for feature selection in high-dimensional data and addressing the challenges in high-dimensional data analysis. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Practical Two-Factor Authentication Protocol for Real-Time data Access in WSNs

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Xu, Meijia Wang, Ding Nankai University College of Cryptology and Cyber Science Tianjin300350 China Tianjin300350 China Nankai University Tianjin Key Laboratory of Network and Data Security Technology Tianjin300350 China

With the rapid development of sensors and communication technologies, the Internet of Things (IoT) paradigm has increasingly expanded to cover various daily, industrial, and military applications. As a core component of the IoT responsible for environmental sensing and data collection, wireless sensor networks (WSNs) face significant security threats. The design of multi-factor authentication schemes to secure real-time data transmission in WSNs has garnered considerable research efforts. However, a common trend in existing multi-factor authentication protocols is emphasizing performance and security benefits, while possible limitations are rarely subjected to thorough analysis. To fill this gap, we first select two representative multi-factor authentication schemes (i.e., Chaudhry et al.'s scheme at ACM ToIT'21 and Jabbari-Mohasef's scheme at IEEE TII'22) as case studies, and point out that both schemes are vulnerable to offline password guessing and node capture attacks, and fail to achieve forward secrecy. We then investigate the fundamental causes of these weaknesses underlying the schemes and propose corresponding solutions. After rethinking previous schemes, we present a new robust two-factor authentication scheme for WSNs and formally prove its security under the Random Oracle Model. Furthermore, we compare our scheme with 18 state-of-the-art protocols using the widely accepted evaluation framework. The comparison results show that our protocol outperforms its foremost counterparts. © 2004-2012 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A circuit area optimization of MK-3 S-box

引用

Cybersecurity 2025年第1期8卷 61-71页

作者： Yanjun Li Weiguo Zhang Yiping Lin Jian Zou Jian Liu Information Industry Information Security Evaluation Center The 15th Research Institute of China Electronic Technology Group CorporationBeijing 100083China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 450001China Beijing Electronic Science and Technology Institute No.7 Fufeng RoadFengtai DistricBeijing 100083China College of Computer and Data Science Fuzhou UniversityFuzhou 350108China

In MILCOM 2015,Kelly et *** the authentication encryption algorithm MK-3,which applied the 16-bit *** paper aims to implement the 16-bit S-box with less circuit ***,we classifed the irreducible polynomials over F_(2n)into three *** we compared the logic gates required for multiplication over the fnite feld constructed by the three types of irreducible *** to the comparison result,we constructed the composite felds, F_((2^(4))^(2))and F_((2^(8))^(2)).Based on the isomorphism of fnite felds,the operations over F_(2)^(16)can be conducted over F_((2^(8))^(2)).Similarly,elements over F28 can be mapped to the corresponding elements over F_((2^(4)))^(2).Next,the SAT solver was used to optimize the operations over smaller feld F_(2)^(4).At last,the architecture of the optimized MK-3 S-box was worked *** with the implementation proposed by the original designer,the circuit area of the MK-3 S-box in this paper is reduced by at least 55.9%.

关键词： irreducible operations optimization

来源：评论

学校读者我要写书评

暂无评论

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...

引用

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

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

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

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.

关键词： Deep learning Computer vision Heavily-tailed distribution Codes Accuracy Noise Speech recognition Acoustics Noise measurement Speech processing

来源：评论

学校读者我要写书评

暂无评论

FedFLD: Heterogeneous Federated Learning via Forget-Less Distillation

FedFLD: Heterogeneous Federated Learning via Forget-Less Dis...

引用

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

作者： Xiaoyang Yi Jian Zhang Jing Chen Yuru Bao Lingkai Xing College of Cyber Science Nankai University China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China College of Computer Science Nankai University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Federated learning, as a distributed machine learning paradigm, enhances privacy protection but faces the challenge of heterogeneity. data-free knowledge distillation (DFKD) methods attempt to overcome this challenge by using a generator to synthesize samples for fine-tuning a global model. However, these methods often suffer from significant shifts in output distribution, leading to catastrophic forgetting. To tackle these issues, we propose FedFLD, a novel federated forget-less distillation framework that mitigates catastrophic forgetting in DFKD while addressing the heterogeneity challenge. Specifically, FedFLD guides the generator’s training from three key aspects and constrains the output distribution with an elastic weight consolidation penalty term. By synthesizing diverse samples from different perspectives through additional generator updates, FedFLD facilitates effective knowledge distillation from local models to the global model. Additionally, the global model is further optimized via the heterogeneity fine-tuning process, mitigating the bias from heterogeneity and resulting in a more expressive and robust model.

关键词： Training Privacy Federated learning Signal processing Generators Acoustics Servers Speech processing Protection Faces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：