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

IDTRSC: ID-based Traceable Ring Signcryption Framework for Data Sharing without Key Escrow

IEEE Transactions on Vehicular Technology 2025年

作者： Wei, Jiannan Xie, Longyu Zhu, Qinchuan Gao, Yansong Yu, Keping Choo, Kim-Kwang Raymond Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China institute of State Key Laboratory of Cryptology P.O.Box 5159 Beijing100878 China Waseda University Global Information and Telecommunication Institute Shinjuku169-8050 Japan University of Texas San Antonio Department of Information Systems and Cyber Security San AntonioTX78249-0631 United States

The capability to share data across different entities is increasingly pronounced in our data-driven and centric society. However, we also have to ensure properties such as data confidentiality, unforgeability, anonymity and traceability are supported in the solutions we deploy. Hence, in this paper we present an ID-based ring signcryption scheme. Specifically, our scheme supports confidentiality, unforgeability, anonymity, traceability and non-frameability. For example, the signcryption sender's identity can be revealed if needed (e.g., investigation). In addition, unlike other existing schemes, each user's partial private key is generated by the key generation center in our scheme. This circumvents the key escrow problem. We then theoretically and empirically demonstrate that our proposed scheme incurs reduced computational costs, in comparison to other competing schemes especially when the number of ring members is large. © 1967-2012 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Towards improving detection performance for malware with a correntropy-based deep learning method

引用

Digital Communications and Networks 2021年第4期7卷 570-579页

作者： Xiong Luo Jianyuan Li Weiping Wang Yang Gao Wenbing Zhao School of Computer and Communication Engineering University of Science and Technology BeijingBeijing100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083China Beijing Intelligent Logistics System Collaborative Innovation Center Beijing101149China China Information Technology Security Evaluation Center Beijing100085China Department of Electrical Engineering and Computer Science Cleveland State UniversityClevelandOH44115USA

With the rapid development of Internet of Things(IoT)technologies,the detection and analysis of malware have become a matter of concern in the industrial application of Cyber-Physical System(CPS)that provides various services using the IoT ***,many advanced machine learning methods such as deep learning are popular in the research of malware detection and analysis,and some achievements have been made so ***,there are also some *** example,considering the noise and outliers in the existing datasets of malware,some methods are not robust ***,the accuracy of malware classification still needs to be *** at this issue,we propose a novel method that combines the correntropy and the deep learning *** our proposed method for malware detection and analysis,given the success of the mixture correntropy as an effective similarity measure in addressing complex datasets with noise,it is therefore incorporated into a popular deep learning model,i.e.,Convolutional Neural Network(CNN),to reconstruct its loss function,with the purpose of further detecting the features of *** present the detailed design process of our ***,the proposed method is tested both on a real-world malware dataset and a popular benchmark dataset to verify its learning performance.

关键词： Malware detection Mixture correntropy Deep learning Convolutional neural network(CNN)

来源：评论

学校读者我要写书评

暂无评论

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Double-Blockchain Assisted Secure and Anonymous Data Aggregation for Fog-Enabled Smart Grid

引用

engineering 2022年第1期8卷 159-169页

作者： Siguang Chen Li Yang Chuanxin Zhao Vijayakumar Varadarajan Kun Wang Jiangsu Key Lab of Broadband Wireless Communication and Internet of Things Nanjing University of Posts and TelecommunicationsNanjing 210003China Jiangsu Engineering Research Center of Communication and Network Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China Anhui Provincial Key Laboratory of Network and Information Security Anhui Normal UniversityWuhu 241000China School of Computer Science and Engineering Vellore Institute of TechnologyChennai 600127India Department of Electrical and Computer Engineering University of CaliforniaLos AngelesCA 90095USA

As a future energy system,the smart grid is designed to improve the efficiency of traditional power systems while providing more stable and reliable ***,this efficient and reliable service relies on collecting and analyzing users’electricity consumption data frequently,which induces various security and privacy *** address these challenges,we propose a double-blockchain assisted secure and anonymous data aggregation scheme for fog-enabled smart grid named ***,we design a three-tier architecture-based data aggregation framework by integrating fog computing and the blockchain,which provides strong support for achieving efficient and secure data collection in smart ***,we develop a secure and anonymous data aggregation mechanism with low computational overhead by jointly leveraging the Paillier encryption,batch aggregation signature and anonymous *** particular,the system achieves fine-grained data aggregation and provides effective support for power dispatching and price adjustment by the designed double-blockchain and two-level data ***,the superiority of the proposed scheme is illustrated by a series of security and computation cost analyses.

关键词： Blockchain Fog computing Homomorphic encryption Smart grid Anonymity

来源：评论

学校读者我要写书评

暂无评论

TrafPS: A Shapley-based Visual Analytics Approach to Interpret Traffic

arXiv

引用

arXiv 2024年

作者： Feng, Zezheng Jiang, Yifan Wang, Hongjun Fan, Zipei Ma, Yuxin Yang, Shuang-Hua Qu, Huamin Song, Xuan Department of Computer Science and Engineering Southern University of Science and Technology China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Department of Computer Science University of Reading United Kingdom Center for Spatial Information Science The University of Tokyo Japan Shenzhen Key Laboratory of Safety and Security for Next Generation of Industrial Internet Southern University of Science and Technology China

Recent achievements in deep learning (DL) have shown its potential for predicting traffic flows. Such predictions are beneficial for understanding the situation and making decisions in traffic control. However, most state-of-the-art DL models are considered "black boxes" with little to no transparency for end users with respect to the underlying mechanisms. Some previous work tried to "open the black boxes" and increase the interpretability of how predictions are generated. However, it still remains challenging to handle complex models on large-scale spatio-temporal data and discover salient spatial and temporal patterns that significantly influence traffic flows. To overcome the challenges, we present TrafPS, a visual analytics approach for interpreting traffic prediction outcomes to support decision-making in traffic management and urban planning. The measurements, region SHAP and trajectory SHAP, are proposed to quantify the impact of flow patterns on urban traffic at different levels. Based on the task requirement from the domain experts, we employ an interactive visual interface for multi-aspect exploration and analysis of significant flow patterns. Two real-world case studies demonstrate the effectiveness of TrafPS in identifying key routes and decision-making support for urban planning. Copyright © 2024, The Authors. All rights reserved.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

Distributed optimization for IoT attack detection using federated learning and Siberian Tiger optimizer

引用

ICT Express 2025年第3期11卷 542-546页

作者： Gupta, Brij B. Gaurav, Akshat Alhalabi, Wadee Arya, Varsha Alharbi, Eman Chui, Kwok Tai Department of Computer Science and Information Engineering Asia University Taichung 413 Taiwan Department of Medical Research China Medical University Hospital China Medical University Taichung Taiwan Symbiosis Centre for Information Technology (SCIT) Symbiosis International University Pune India School of Cybersecurity Korea University Seoul South Korea Kyung Hee University 26 Kyungheedae-ro Dongdaemun-gu Seoul South Korea Ronin Institute Montclair NJ United States International Center for AI and Cyber Security Research and Innovations (CCRI) Asia University Taichung 413 Taiwan Department of Computer Science Immersive Virtual Reality Research Group King Abdulaziz University Jeddah Saudi Arabia Hong Kong Metropolitan University Hong Kong SAR China Center for Interdisciplinary Research University of Petroleum and Energy Studies (UPES) Dehradun India Department of Computer Science Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia

The rapid growth of IoT devices has heightened the risk of botnet attacks, calling for scalable and distributed detection solutions. In this context, this study proposes a distributed optimization system for IoT attack detection using CNN model utilizing federated learning. After optimizing the hyperparameters of the model at the server, the Siberian Tiger Optimization (STO) method distributes these values to clients for dispersed training. Our model achieves accuracy, recall, and precision of 0.89978, 0.94355, and 0.94455, respectively, using the N-BaIoT dataset. These findings show, in spite of latency issues, the efficiency of federated learning in distributed IoT security systems. © 2025

关键词： CNN model Distributed optimization Federated learning IoT attack detection Siberian Tiger Optimization (STO)

来源：评论

学校读者我要写书评

暂无评论

MorphText: Deep Morphology Regularized Accurate Arbitrary-shape Scene Text Detection

arXiv

引用

arXiv 2024年

作者： Xu, Chengpei Jia, Wenjing Wang, Ruomei Luo, Xiaonan He, Xiangjian Faculty of Engineering and IT University of Technology Sydney Australia The Department of Computer Science University of Nottingham Ningbo China School of Data and Computer Science National Engineering Research Center of Digital Life Sun Yat-sen University China The School of Computer Science and Information Security Guilin University of Electronic Technology China

Bottom-up text detection methods play an important role in arbitrary-shape scene text detection but there are two restrictions preventing them from achieving their great potential, i.e., 1) the accumulation of false text segment detections, which affects subsequent processing, and 2) the difficulty of building reliable connections between text segments. Targeting these two problems, we propose a novel approach, named "MorphText", to capture the regularity of texts by embedding deep morphology for arbitrary-shape text detection. Towards this end, two deep morphological modules are designed to regularize text segments and determine the linkage between them. First, a Deep Morphological Opening (DMOP) module is constructed to remove false text segment detections generated in the feature extraction process. Then, a Deep Morphological Closing (DMCL) module is proposed to allow text instances of various shapes to stretch their morphology along their most significant orientation while deriving their connections. Extensive experiments conducted on four challenging benchmark datasets (CTW1500, Total-Text, MSRA-TD500 and ICDAR2017) demonstrate that our proposed MorphText outperforms both top-down and bottom-up state-of-the-art arbitrary-shape scene text detection approaches. Copyright © 2024, The Authors. All rights reserved.

关键词： Morphology

来源：评论

学校读者我要写书评

暂无评论

Generative AI-Enabled Quantum Encryption Algorithm for Securing IoT-Based Healthcare Application Using Blockchain

引用

IEEE Internet of Things Journal 2025年

作者： Prajapat, Sunil Kumar, Pankaj Das, Ashok Kumar Muhammad, Ghulam Central University of Himachal Pradesh Srinivasa Ramanujan Department of Mathematics Dharamshala176215 India International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of King Saud University College of Computer and Information Sciences Department of Computer Engineering Riyadh11543 Saudi Arabia

The integration of Artificial Intelligence (AI) with the Internet of Things (IoT) has transformed numerous domains through the AI of Things (AIoT). Nonetheless, AIoT encounters issues related to energy usage and carbon emissions as mobile technology continues to progress. Generative AI (GAI) possesses significant potential to mitigate carbon emissions associated with AIoT, owing to its higher reasoning and generative powers. Conventional security protocols frequently encounter issues with computational efficiency, latency, and overall security comprehensiveness. Blockchain technology, characterized by its decentralized and immutable properties, is a viable approach for improving electronic healthcare data transmission and node authentication in IoT networks. This research examines secure data transmission and node encryption in IoT systems, with a particular emphasis on data management. Conventional approaches encounter constraints in computational efficiency, latency, and comprehensive security. This study presents a novel protocol that combines GAI and blockchain technology with quantum encryption to enhance authentication and ensure secure data transmission. The algorithm comprises multiple consecutive processes, including the encoding and transmission of node requests, followed by the authentication process utilizing hash functions and digital signatures. The authentication approach utilizes a challenge-response technique, guaranteeing that only nodes with authentic credentials can advance. Thereafter, a dynamic key exchange protocol and quantum encryption method provide secure data delivery. The results indicate the procedure’s effectiveness in ensuring secure and regulated access to patient data, underscoring its significance in medical facilities. The system’s functionalities are augmented by a thorough evaluation employing machine learning. The findings indicate that the system exhibits an accuracy of 99.4%, precision of 99.10%, recall of 98.66%, F1-score of

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover 51

Problems in NP Can Admit Double-Exponential Lower Bounds Whe...

引用

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

作者： Foucaud, Florent Galby, Esther Khazaliya, Liana Li, Shaohua Mc Inerney, Fionn Sharma, Roohani Tale, Prafullkumar Université Clermont Auvergne CNRS Mines Saint-Étienne Clermont Auvergne INP LIMOS Clermont-Ferrand63000 France Department of Computer Science and Engineering Chalmers University of Technology Gothenburg Sweden University of Gothenburg Sweden Technische Universität Wien Austria CISPA Helmholtz Center for Information Security Saarbrücken Germany University of Bergen Norway Indian Institute of Science Education and Research Pune India

ISBN: (纸本)9783959773225

Treewidth serves as an important parameter that, when bounded, yields tractability for a wide class of problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and Quantified SAT or, more generally, Quantified CSP, are fixed-parameter tractable parameterized by the treewidth of the input’s (primal) graph plus the length of the MSO-formula [Courcelle, information & Computation 1990] and the quantifier rank [Chen, ECAI 2004], respectively. The algorithms generated by these (meta-)results have running times whose dependence on treewidth is a tower of exponents. A conditional lower bound by Fichte, Hecher, and Pfandler [LICS 2020] shows that, for Quantified SAT, the height of this tower is equal to the number of quantifier alternations. These types of lower bounds, which show that at least double-exponential factors in the running time are necessary, exhibit the extraordinary level of computational hardness for such problems, and are rare in the current literature: there are only a handful of such lower bounds (for treewidth and vertex cover parameterizations) and all of them are for problems that are #NP-complete, Σp2-complete, Πp2-complete, or complete for even higher levels of the polynomial hierarchy. Our results demonstrate, for the first time, that it is not necessary to go higher up in the polynomial hierarchy to achieve double-exponential lower bounds: we derive double-exponential lower bounds in the treewidth (tw) and the vertex cover number (vc), for natural, important, and well-studied NP-complete graph problems. Specifically, we design a technique to obtain such lower bounds and show its versatility by applying it to three different problems: Metric Dimension, Strong Metric Dimension, and Geodetic Set. We prove that these problems do not admit 22o(tw) ·nO(1)-time algorithms, even on bounded diameter graphs, unless the ETH fails (here, n is the number of vertices in the graph). In fact, for Strong Metric Dimension, the double-expo

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

On authenticated skyline query processing over road networks

On authenticated skyline query processing over road networks

引用

作者： Zhu, Xiaoyu Wu, Jie Chang, Wei Zakirul Alam Bhuiyan, Md Raymond Choo, Kim-Kwang Qi, Fang Liu, Qin Wang, Guojun School of Computer Science and Engineering Central South University Changsha China Center for Networked Computing Temple University PhiladelphiaPA United States Department of Computer and Information Sciences Saint Joseph's University PhiladelphiaPA United States Department of Computer Science Fordham University New York CityNY United States Department of Information Systems and Cyber Security University of Texas at San Antonio San AntonioTX United States School of Computer Science and Electronic Engineering Hunan University Changsha China School of Computer Science Guangzhou University Guangzhou China

In recent times, many location-based service providers (LBSPs) choose to outsource data query services to third-party cloud service providers (CSPs). This allows users to easily search for points of interests (POIs), such as restaurants and parking lots in their vicinity, using their mobile devices and in-vehicle infotainment units. Skyline query is one potential technique to be deployed for road networks. However, the untrusted CSPs may forge or omit query results, intentionally or not. Therefore, in this article, we posit that by observing the unique properties of skyline query results in road networks, we can bind each POI with four nearby POIs with special properties using signature chain technology. Our proposed approach not only provides users with skyline query result authentication ability over the road network, but also have low communication overhead. Specifically, the overhead analysis and experimental results show that our proposed approach decreases the communication overhead. © 2020 John Wiley & Sons, Ltd.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：