检索结果-南通市图书馆

Privacy-Preserving Public Auditing Scheme for Data Confidentiality and Accountability in Cloud Storage

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第1期28卷 179-187页

作者： YANG Zhen WANG Wenyu HUANG Yongfeng LI Xing Department of Electronic Engineering Tsinghua University Tsinghua National Laboratory for information Science and Technology Information Networking Institute Carnegie Mellon University

Cloud data confidentiality need to be audited for the data owner’s concern. Confidentiality auditing is usually based on logging schemes, whereas cloud data dynamics and sharing group dynamics result in massive logs, which makes confidentiality auditing a formidable task for user with limited resources. So we propose a public auditing scheme for data confidentiality,in which user resorts to a Third-party auditor(TPA)for auditing. Our scheme design a special log called attestation in which hash user pseudonym is used to preserve user privacy. Attestation-based data access identifying is presented in our scheme which brings no new vulnerabilities toward data confidentiality and no extra online burden for user. We further support accountability of responsible user for data leakage based on user pseudonym. Extensive security and performance analysis compare our scheme with existing auditing schemes.Results indicate that the proposed scheme is provably secure and highly efficient.

关键词： Data confidentiality Public auditability Privacy preserving Cloud storage User accountability

Cache Pollution Prevention Mechanism Based on Deep Reinforcement Learning in NDN

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Communications and information Networks 2021年第1期6卷 91-100页

作者： Jie Zhou Jiangtao Luo Junxia Wang Lianglang Deng School of Communication and information Engineering Chongqing University of Posts and TelecommunicationsChongqing 400065China Electronic information and networking Research institute Chongqing University of Posts and TelecommunicationsChongqing 400065China

As a representative architecture of contentcentric paradigms for the future Internet,named data networking(NDN)enables consumers to retrieve content duplicates from either the original server or intermediate routers.Each node of NDN is equipped with cache that buffers but not validates the data,making it vulnerable to various attacks.Cache pollution,one of the specific attacks in NDN,fraudulently alters the cached contents by excessively requesting worthless information,squeezing the space of real popular contents and thus degrading the experience of normal users.In order to address the issue,this paper proposes a defense scheme based on deep reinforcement learning(DRL)against cache pollution attack,in which whether a data packet is to be cached is decided by a trained intelligent agent,that is adaptive to dynamic network states and following long term rewards,the accumulative data-requesting delays.Finally,the DRL-based scheme is evaluated and compared to two other existing schemes.Experimental results show that the proposed defense mechanism outperforms the others significantly,and is proved to be effective against cache pollution attacks.

关键词： named data networking cache pollution attack deep reinforcement learning

Mobility-Aware Multi-Task Migration and Offloading Scheme for Internet of Vehicles

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2023年第6期32卷 1192-1202页

作者： LI Xujie TANG Jing XU Yuan SUN Ying College of Computer and information Hohai University State Key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications Key Lab for Wireless Sensor Network and Communication Shanghai Institute of Microsystem School of information Engineering Jiangsu Open University

In Internet of vehicles, vehicular edge computing(VEC) as a new paradigm can effectively accomplish various tasks. Due to limited computing resources of the roadside units(RSUs), computing ability of vehicles can be a powerful supplement to computing resources. Then the task to be processed in data center can be offloaded to the vehicles by the RSUs. Due to mobility of the vehicles, the tasks will be migrated among the RSUs. How to effectively offload multiple tasks to the vehicles for processing is a challenging problem. A mobility-aware multi-task migration and offloading scheme for Internet of vehicles is presented and analyzed. Considering the coupling between migration and offloading, the joint migration and offloading optimization problem is formulated. The problem is a NP-hard problem and it is very hard to be solved by the conventional methods. To tackle the difficult problem, the idea of alternating optimization and divide and conquer is introduced. The problem can be decoupled into two sub-problems: computing resource allocation problem and vehicle node selection problem. If the vehicle node selection is given, the problem can be solved based on Lagrange function. And if the allocation of computing resource is given, the problem turns into a 0-1 integer programming problem, and the linear relaxation of branch bound algorithm is introduced to solve it. Then the optimization value is obtained through continuous iteration. Simulation results show that the proposed algorithm can effectively improve system performance.

关键词： Vehicular edge computing Task offloading Task migration

Recursive filtering for nonlinear systems subject to measurement outliers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2021年第7期64卷 92-103页

作者： Bo JIANG Hongyu GAO Fei HAN Hongli DONG School of Electrical and information Engineering Northeast Petroleum University Heilongjiang Provincial Key Laboratory of networking and Intelligent Control Artificial Intelligence Energy Research institute Northeast Petroleum University

In this paper, an innovative recursive filtering algorithm(RFA) is proposed for a class of nonlinear systems(NSs) subject to multiplicative noises(MNs) and measurement outliers(MOs). Initially, the MNs are employed to formulate the random influence on the NSs with the stochastic noises. Next, the outlier phenomenon could occur unpredictably during measurement transmission. Then, a self-adaptive saturation function is introduced to the constructed filter to mitigate the influence of MOs on the filter performance.In this paper, we design a resistant-outlier filter for NSs with MNs and MOs, and the filter gain ensures that the trace of the filtering error covariance matrix is minimized by solving the constructed Riccati-like difference equations. Moreover, the exponential boundedness of the filtering error in the sense of mean square is analyzed. Finally, the feasibility of the proposed RFA is illustrated by a simulation example when the MOs occur.

关键词： adaptive saturation measurement outliers multiplicative noises nonlinear systems recursive filtering

机会网络中基于身份门限签名的可信路由(英文)

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2011年第4期8卷 132-140页

作者：陈曦田有亮李兴华马建峰 Key Laboratory of Computer Networks and information Security Ministry of EducationXidian University networking and information Processing Laboratory Rochester Institute of Technology

In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-based threshold signature which allows mobile nodes to jointly generate and distribute the secrets for social attributes in a totally self-organized way without the need of any centralized authority.New joining nodes can reconstruct their own social attribute signatures by getting enough partial signature services from encounter opportunities with the initial nodes.Mobile nodes need to testify whether the neighbors can provide valid attribute signatures for their routing advertisements in order to resist potential routing attacks.Simulation results show that:by implementing our security scheme,the network delivery probability of the social context-based routing protocol can be effectively improved when there are large numbers of compromised nodes in opportunistic networks.

关键词： opportunistic networks social context-based routing identity-based signature threshold cryptography

A Trusted Multi-Task Distribution Mechanism for Internet of Vehicles Based on Smart Contract

在线全文

学校读者我要写书评

暂无评论

China Communications 2023年第4期20卷 212-226页

作者： Xujie Li Yuan Xu Jing Tang Ying Sun Shaoshuai Fan Fei Shen College of Computer and information Hohai UniversityNanjing 210098China State Key Laboratory of networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China School of information Engineering Jiangsu Open UniversityNanjing 210017China Shanghai institute of Microsystem and information Technology Chinese Academy of SciencesShanghai 200050China

In this paper,a trusted multi-task distribution mechanism for Internet of Vehicles based on smart contract is proposed to improve the security and efficiency for the task distribution in Internet of Vehicles.Firstly,a three-tier trusted multi-task distribution framework is presented based on smart contract.The smart contract will be triggered by the task request.As the important part of the smart contract,the task distribution algorithm is stored on the blockchain and run automatically.In the process of the task distribution,the cost of the task distribution and the system stability play a critical role.Therefore,the task distribution problem is formulated to minimize the cost of the task distribution whilst maintaining the stability of the system based on Lyapunov theorem.Unfortunately,this problem is a mixed integer nonlinear programming problem with NP-hard characteristics.To tackle this,the optimization problem is decomposed into two sub problems of computing resource allocation and task distribution decision,and an effective task distribution algorithm is proposed.Simulation results show that the proposed algorithm can effectively improves system performance.

关键词： task distribution resource allocation Lyapunov optimization smart contract

Area-Based Connected Dominating Set Construction and Maintenance Algorithm in Ubiquitous Stub Environment

在线全文

学校读者我要写书评

暂无评论

China Communications 2015年第9期12卷 141-149页

作者： Guo Shaoyong Xing Ningzhe Fu Ning Shao Sujie You Fucheng State Key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications School of Electronic and information Engineering Beijing Jiaotong University Beijing Guo Dian Tong networking Technology Company Limited information Engineering School of Beijing institute of Graphic Communication

In order to construct and maintain stability Connected Dominating Set over MANET in Ubiquitous Stub Network, this paper proposes a novel area-based CDS construction and maintenance algorithm. The algorithm is divided into three phases: 1) Area Partition; 2) Area Expansion; 3) Area Connection. In additional, maintenance strategy is proposed in each phase respectively to handle node mobility with timer. At last, the simulation is implemented with OPNET and MATLAB and the results are analyzed in detailed with Size of CDS, Message Overhead and other indexes.

关键词：连通支配集维护算法构造环境 MATLAB OPNET 维护策略 CDS

A 2-stage strategy updating rule promotes cooperation in the prisoner's dilemma game

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2012年第10期21卷 555-562页

作者：方祥圣朱平刘润然刘恩钰魏贵义 Department of information Science Anhui Institute of Economic Management networking and Distributed Computing Laboratory Zhejiang Gongshang University institute for information Economy Hangzhou Normal University South China University of Technology

In this study,we propose a spatial prisoner＇s dilemma game model with a 2-stage strategy updating rule,and focus on the cooperation behavior of the system.In the first stage,i.e.,the pre-learning stage,a focal player decides whether to update his strategy according to the pre-learning factor β and the payoff difference between himself and the average of his neighbors.If the player makes up his mind to update,he enters into the second stage,i.e.,the learning stage,and adopts a strategy of a randomly selected neighbor according to the standard Fermi updating rule.The simulation results show that the cooperation level has a non-trivial dependence on the pre-learning factor.Generally,the cooperation frequency decreases as the pre-learning factor increases;but a high cooperation level can be obtained in the intermediate region of- 3〈 β 〈-1.We then give some explanations via studying the co-action of pre-learning and learning.Our results may sharpen the understanding of the influence of the strategy updating rule on evolutionary games.

关键词： evolutionary game theory strategy updating social cooperation prisoner＇s dilemma game

Participants Recruitment for Coverage Maximization by Mobility Predicting in Mobile Crowd Sensing

在线全文

学校读者我要写书评

暂无评论

China Communications 2023年第8期20卷 163-176页

作者： Yuanni Liu Xi Liu Xin Li Mingxin Li Yi Li School of Communication and information Engineering Chongqing University of Posts and TelecommunicationsChongqing 400065China School of Cyber Security and information Law Chongqing University of Posts and TelecommunicationsChongqing 400065China State Key Laboratory of networking and Switching Beijing Research institute China UnicomBeijing 100048China

Mobile Crowd Sensing(MCS)is an emerging paradigm that leverages sensor-equipped smart devices to collect data.The introduction of MCS also poses some challenges such as providing highquality data for upper layer MCS applications,which requires adequate participants.However,recruiting enough participants to provide the sensing data for free is hard for the MCS platform under a limited budget,which may lead to a low coverage ratio of sensing area.This paper proposes a novel method to choose participants uniformly distributed in a specific sensing area based on the mobility patterns of mobile users.The method consists of two steps:(1)A second-order Markov chain is used to predict the next positions of users,and select users whose next places are in the target sensing area to form a candidate pool.(2)The Average Entropy(DAE)is proposed to measure the distribution of participants.The participant maximizing the DAE value of a specific sensing area with different granular sub-areas is chosen to maximize the coverage ratio of the sensing area.Experimental results show that the proposed method can maximize the coverage ratio of a sensing area under different partition granularities.

关键词： data average entropy human mobility prediction markov chain mobile crowd sensing