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

Efficient Batch Verification and Privacy-Preserving Data Aggregation Scheme in V2G networks

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Congcong Wang, Chen Shen, Jian Vasilakos, Athanasios V. Wang, Bin Wang, Weizheng Department of Software Engineering Nanjing University of Information Science and Technology Nanjing210044 China the Zhejiang Key Laboratory of Digital Fashion and Data Governance the Zhejiang Provincial International Cooperation Base for Science and Technology on Cloud Computing Security and Data Aggregation Zhejiang Sci-Tech University Hangzhou310018 China Zhejiang Provincial Innovation Center of Advanced Textile Technology Shaoxing312000 China College of Computer Science and Information Technology IAU Saudi Arabia Grimstad4879 Norway Network and Data Security Hangzhou310053 China Computer Science Department City University of Hong Kong Hong Kong the Division of Computer Science University of Aizu Fukushima965–8580 Japan

In recent years, against the backdrop of smart grids, vehicle-to-grid (V2G) interaction has become a hot topic. With the increasing number of new energy vehicles, handling massive amounts of electricity transaction data has become an urgent problem in need of resolution. Ensuring the security of the vast quantities of electricity transaction data has emerged as a significant challenge. Therefore, two data aggregation schemes are proposed in this paper, both supporting batch verification and privacy protection in centralized and distributed scenarios, respectively. Firstly, an improved Paillier cryptosystem is utilized to achieve lightweight encryption in the proposed schemes. In addition, a novel distributed data aggregation structure that combines a large number of geographically distributed fog nodes with centralized cloud servers is introduced. This structure not only meets the requirements of lightweight encryption and resistance against single point failures but also reduces the communication complexity of distributed data aggregation to O(n). According to the security proofs and experimental analysis, it can be demonstrated that both proposed schemes are effective and secure, meeting the lightweight requirements of modern smart grid systems. © 2025 IEEE. All rights reserved,

关键词： Data aggregation

来源：评论

学校读者我要写书评

暂无评论

BCE-PPDS: Blockchain-based cloud–edge collaborative privacy-preserving data sharing scheme for IoT

引用

Future Generation Computer Systems 2026年 174卷

作者： Guijuan Wang Qi Liu Zhongyuan Yu Hongliang Zhang Anming Dong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong 250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan Shandong 250353 China China University of Petroleum Qingdao Shandong 266000 China

Internet of Things (IoT) devices generate large amounts of data every day that can be combined with intelligent platforms for predictive analytics and scientific research. However, concerns about privacy and security hinder the willingness of individuals to share data. Blockchain emerged as a promising infrastructure for facilitating secure data sharing due to its decentralized, immutability, and auditable benefits. In this paper, we propose a blockchain-based cloud–edge collaborative privacy protection data sharing scheme (BCE-PPDS), which is decentralized and enables data requesters (DRs) to search data resources using smart contracts to efficiently obtain target data. To protect the identity privacy of data owners (DOs), we propose a novel certificateless linkable ring signature algorithm with efficient performance. This algorithm is not only suitable for deployment on resource-limited IoT devices, so that DOs can realize anonymous identity authentication, but also can aggregate the generated ring signatures for batch verification, so as to improve the efficiency of signature verification. In addition, we designed a key distribution algorithm using the Asmuth–Bloom secret sharing scheme to ensure the security of the key. Under the random oracle model, BCE-PPDS is provably secure. The experimental results verify that BCE-PPDS is efficient and practical.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Forgeability of Wang-Zhu-Feng-Yau’s Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & Technology 2013年第4期28卷 743-748页

作者：葛爱军黄欣沂陈成马传贵张锐 State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer ScienceFujian Normal University Institute of Software Chinese Academy of Sciences

Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.＇s proof.

关键词： attribute-based signature existential unforgeability policy-and-endorsement

来源：评论

学校读者我要写书评

暂无评论

Multimodal Fusion and Vision-Language Models: A Survey for Robot Vision

arXiv

引用

arXiv 2025年

作者： Han, Xiaofeng Chen, Shunpeng Fu, Zenghuang Feng, Zhe Fan, Lue An, Dong Wang, Changwei Guo, Li Meng, Weiliang Zhang, Xiaopeng Xu, Rongtao Xu, Shibiao The State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence Beijing University of Posts and Telecommunications China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center China

Robot vision has greatly benefited from advancements in multimodal fusion techniques and vision-language models (VLMs). We systematically review the applications of multimodal fusion in key robotic vision tasks, including semantic scene understanding, simultaneous localization and mapping (SLAM), 3D object detection, navigation and localization, and robot manipulation. We compare VLMs based on large language models (LLMs) with traditional multimodal fusion methods, analyzing their advantages, limitations, and synergies. Additionally, we conduct an in-depth analysis of commonly used datasets, evaluating their applicability and challenges in real-world robotic scenarios. Furthermore, we identify critical research challenges such as cross-modal alignment, efficient fusion strategies, real-time deployment, and domain adaptation, and propose future research directions, including self-supervised learning for robust multimodal representations, transformer-based fusion architectures, and scalable multimodal frameworks. Through a comprehensive review, comparative analysis, and forward-looking discussion, we provide a valuable reference for advancing multimodal perception and interaction in robotic vision. A comprehensive list of studies in this survey is available at https://***/Xiaofeng-Han-Res/MF-RV. Copyright © 2025, The Authors. All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Auction Theory and Game Theory Based Pricing of Edge computing Resources: A Survey

引用

IEEE Internet of Things Journal 2025年

作者： Yu, Jiguo Liu, Shun Zou, Yifei Wang, Guijuan Hu, Chunqiang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Qufu Normal University School of Computer Science Shandong Rizhao China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250353 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

The proliferation of Internet of Things (IoT) devices and edge computing applications has heightened the demand for efficient resource allocation and pricing mechanisms. Effective pricing strategies play a crucial role in optimizing resource utilization, reducing latency, and ensuring fair resource distribution among users. Both auction theory and game theory have emerged as fundamental economic frameworks for designing pricing mechanisms in edge computing. This paper presents a comprehensive survey of pricing strategies that leverage both auction and game theory, systematically categorizing existing research based on auction mechanisms and game-theoretic models. Unlike previous surveys that focus solely on auction-based pricing, this work integrates game-theoretic perspectives, providing a holistic analysis of strategic interactions in edge computing resource allocation. Furthermore, we discuss key challenges, emerging trends, and future research directions aimed at enhancing efficiency, fairness, and privacy protection in cloud-edge collaborative computing environments. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Malicious Client Detection with Differential Privacy Constraints Based on Model Update Slicing and K-Means Clustering 6

Malicious Client Detection with Differential Privacy Constra...

引用

6th International Conference on Frontier Technologies of information and Computer, ICFTIC 2024

作者： Qi, Mengshi Wang, Xin He, Yunpeng Yang, Ming Wu, Xiaoming Key Laboratory of Computing Power Network and Information Security Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

ISBN: (纸本)9798331541750

Federated learning (FL) is a decentralized machine learning technique that protects data privacy by trainng models locally on devices and sharing only model updates instead of raw data. However, FL also faces multiple security challenges. Clientside poisoning attacks can compromise global model training by injecting malicious updates. Additionally, the server may infer private information from client model updates. Most existing studies address these two risks separately, lacking a systematic analysis and response to their combined threats. This paper proposes a method called Sliced-Clustering Guard (SCGuard), which slices gradients and performs clustering analysis on each segment, enabling the server to more accurately detect malicious updates and effectively differentiate malicious client updates with differential privacy (DP) protection. Experimental results demonstrate that SCGuard can mitigate poisoning attacks while effectively safeguarding clients' sensitive information. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Robust low-rank tensor factorization by cyclic weighted median

引用

Science China(information Sciences) 2015年第5期58卷 145-155页

作者： MENG DeYu ZHANG Biao XU ZongBen ZHANG Lei GAO ChenQiang Institute for Information and System Sciences and Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Department of Computing Hong Kong Polytechnic University Chongqing Key Laboratory of Signal and Information Processing Chongqing University of Posts and Telecommunications

Low-rank tensor factorization(LRTF) provides a useful mathematical tool to reveal and analyze multi-factor structures underlying data in a wide range of practical applications. One challenging issue in LRTF is how to recover a low-rank higher-order representation of the given high dimensional data in the presence of outliers and missing entries, i.e., the so-called robust LRTF problem. The L1-norm LRTF is a popular strategy for robust LRTF due to its intrinsic robustness to heavy-tailed noises and outliers. However, few L1-norm LRTF algorithms have been developed due to its non-convexity and non-smoothness, as well as the high order structure of data. In this paper we propose a novel cyclic weighted median(CWM) method to solve the L1-norm LRTF problem. The main idea is to recursively optimize each coordinate involved in the L1-norm LRTF problem with all the others fixed. Each of these single-scalar-parameter sub-problems is convex and can be easily solved by weighted median filter, and thus an effective algorithm can be readily constructed to tackle the original complex problem. Our extensive experiments on synthetic data and real face data demonstrate that the proposed method performs more robust than previous methods in the presence of outliers and/or missing entries.

关键词： tensor factorization low-rank weighted median filter tensorface

来源：评论

学校读者我要写书评

暂无评论

Cross-chain Transaction Tracking Protocol based on Multi-dimensional Digital Watermarking Fingerprints 6

Cross-chain Transaction Tracking Protocol based on Multi-dim...

引用

6th International Conference on Frontier Technologies of information and Computer, ICFTIC 2024

作者： Li, Duanzhen Xu, Shujiang He, Haochen Xue, Hongrui Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

ISBN: (纸本)9798331541750

Cross-chain technology plays a critical role in the process of interconnecting blockchains. However, all attention has been focused on how to achieve efficient cross-chain interoperability protocols, thus neglecting the most important security issues in cross-chain data interaction. Frequent network attacks and data privacy leaks have sounded the alarm for the safety of cross-chain data transactions. How to solve the problem of data ownership tracking in cross-chain transactions has become the top priority. This paper designs a cross-chain transaction tracking protocol based on multi-dimensional digital watermark fingerprints, using robust watermark, fragile watermark, and user identity key to achieve multi-dimensional tracking and supervision of cross-chain data transactions. Finally, this paper analyzes the feasibility and efficiency of the proposed protocol through experiments. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Node Verification and Protection Strategy for Edge computing 5

A Lightweight Node Verification and Protection Strategy for ...

引用

5th International Seminar on Artificial Intelligence, networking and information Technology, AINIT 2024

作者： Du, Jiayuan Zhang, Guowei Qufu Normal University School of Cyber Science and Engineering Qufu China Key Laboratory of Computing Power Network and Information Security Jinan China

ISBN: (纸本)9798350385557

To alleviate the burden on the core network, edge computing has rapidly advanced to support distributed computing. However, as sensitive information is delegated to the edge layer closer to endpoints, the privacy protection challenges faced by edge nodes intensify while striving to deliver high-quality services. Existing studies predominantly rely on various encryption algorithms to safeguard privacy information, such as identity, location, and offloading routes privacy. Unfortunately, these approaches exhibit high overhead and often neglect the potential maliciousness of the nodes themselves. To address these issues, this paper introduces a lightweight edge node verification and protection strategy. This strategy not only verifies the reliability of edge nodes but also enables anonymized uploading of private information. Numerical simulation results demonstrate the superiority of this strategy over existing schemes, showcasing reduced computational overhead while achieving enhanced protection. © 2024 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Offloading Mode Hidden for Delay Sensitive Tasks in Edge computing networks 5

Offloading Mode Hidden for Delay Sensitive Tasks in Edge Com...

引用

5th International Seminar on Artificial Intelligence, networking and information Technology, AINIT 2024

作者： Zhang, Guowei Du, Jiayuan Qufu Normal University School of Cyber Science and Engineering Qufu China Key Laboratory of Computing Power Network and Information Security Jinan China

ISBN: (纸本)9798350385557

Edge computing has been developed to support local services with lower burden to the core network. However, privacy issues deteriorate when terminal users enjoy the high-quality services with the price of sending their data to multiple service nodes (SNs) scattered throughout the network. Existing researches concerning this problem are almost all based on the traditional security technologies including encryption and authentication, which are too complicated to be well supported by the terminal nodes (TNs) in edge networks due to the poor local processing capabilities. In view of the above, this article proposes an offloading mode hidden (OMH) algorithm, which reduces the risk level by equalizing the task offloading modes of different TNs. Gaming process is adopted to achieve the risk-minimized offloading solutions for TNs. Numerical results demonstrate that comparing with the Greedy algorithm, the proposed OMH algorithm can achieve lower task offloading risk with higher efficiency and provide more TNs with satisfied services. © 2024 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：