关键词：
Social metaverse;Intelligent identification of close friends;Decentralized multi-authority;Traceability;Revocation
摘要：
Intelligent identification of close friends is the mainstream approach to protect users' multi-dimensional data in the social metaverse. It provides a fine-grained matching service for users. However, users enjoy these benefits at the cost of leaking personal multi-dimensional data. The existing social metaverse-based intelligent identification of close friends privacy protection models typically use centralized mechanisms. This will limit users' control over their data and make them vulnerable to privacy leakage and data misuse. To address these problems, this paper proposes a traceable and revocable decentralized multi-authority privacy protection scheme (TRDM) for social metaverse. The scheme establishes multiple authority centers based on users' multi-dimensional data, overcoming single point of failure and performance bottlenecks. In addition, TRDM partially hides access policies and supports multi-dimensional attribute access control in social metaverse environment. By introducing leaf node values of binary trees, TRDM achieves the traceability and completes the revocation of malicious users by updating part of the ciphertext. Security analysis and experiments show that TRDM satisfies the requirement of static security under the random prediction model and has better performance in the revocation of malicious users.
通讯机构：
[Long, M ] G;Guangzhou Univ, Sch Elect & Commun Engn, Guangzhou 510006, Peoples R China.
关键词：
3D mesh models;integrity authentication;semi-fragile reversible watermarking;spherical crown volume division
摘要：
Aiming at the large distortion and low tampering localization accuracy of the existing semi-fragile reversible watermarking for 3D mesh models, a novel semi-fragile reversible watermarking for 3D models using spherical crown volume division is proposed. The crown volume of a sphere is divided to reduce the embedding distortion. The possible geometric and topological transformations are separately considered in the watermark generation, and the vertices of the one-ring neighbourhood are grouped to improve the tampering localization accuracy. Experimental results show that the proposed scheme can achieve better localization accuracy and lower embedding distortion than some state-of-the-art algorithms. It has good potential for the applications in integrity authentication for 3D mesh models.
作者：
Wang J.;Ou W.;Alfarraj O.;Tolba A.;Kim G.-J.;...
期刊：
Computer Systems Science and Engineering,2023年45(2):1805-1819 ISSN：0267-6192
通讯作者：
Kim, G.-J.
作者机构：
[Ou W.; Wang J.] School of Computer & Communication Engineering, Changsha University of Science & Technology, Changsha, 410004, China;[Tolba A.; Alfarraj O.] Department of Computer Science, Community College, King Saud University, Riyadh, 11437, Saudi Arabia;[Kim G.-J.] Department of Computer Engineering, Chonnam National University, Gwangju, 61186, South Korea;[Ren Y.] School of Computer Science, Engineering Research Center of Digital Forensics of Ministry of Education, Nanjing University of Information Science & Technology, Nanjing, 210044, China
通讯机构：
[Kim, G.-J.] D;Department of Computer Engineering, South Korea
摘要：
With the continuous shrinking of the size of the semiconductor process, the multi-node upset (MNU) brought about by the charge-sharing effect in the nano-integrated circuit has a huge impact on the reliability of the chip. In this paper, a low-delay quadruple-node-upset self-recoverable (LDQNUSR) latch is proposed, which employs seven identical multi-level soft-error interception modules (SIM), each of which is composed of six two-input C-element (CEs) and an inverter. Due to the error interception characteristics of each SIM and the mutual feedback mechanism, this latch has complete quadruple-node-upset (QNU) self-recovery capabilities. Simulation results show that the proposed latch can tolerate all QNUs and can self-recover from any QNUs. In addition, latch overhead can be reduced due to the use of high-speed transmission gates and clock gating techniques. The proposed latch has lower delay compared to the latest LDAVPM latch.
作者机构：
[Li, Jia] Hunan Ind Polytech, Sch Informat Engn, Changsha 410036, Peoples R China.;[Li, Wenjun; Yang, Xueying] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Hunan Prov Key Lab Intelligent Proc Big Data Trans, Changsha 410015, Peoples R China.;[Yang, Yongjie] Saarland Univ, Chair Econ Theory, D-66123 Saarbrucken, Germany.
通讯机构：
[Xueying Yang] H;Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China
通讯机构：
[Yin, B ] C;ChangSha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha 410114, Peoples R China.
关键词：
Crowdsourcing systems;Task assignment;Proxies;Quality control
摘要：
Traditional task assignment follows a direct recruitment model in which requesters recruit and select workers to complete tasks. Because of the unclear division of roles and the diversity of each role’s mission, this model is neither efficient nor scalable. This paper introduces the concept of cooperative unit (CU), in which workers are organized into cooperative units, whose proxies bid for tasks from requesters based on worker characteristics. However, because of the decentralization of task assignment, quality control is complicated, and the benefits of different roles must be balanced. As a result, we propose a novel two-tier task assignment framework (TTAF) that produces high-quality results while striking the appropriate balance between requesters, CUs, and workers. We first propose a vector-based expertise representation model that evaluates workers’ expertise based on previous answers. Then, we devise a higher-tier task assignment between tasks and CUs that maximizes answer quality while staying within budget. The quality of the answers is ensured by aspects such as keyword coverage, overall expertise, and the number of workers. We also devise lower-tier task assignment, which evenly distributes tasks among workers such that more workers have the opportunity to perform tasks. The extensive evaluation shows that our proposed approaches achieve promising results.
摘要：
Aiming to reduce the embedding distortion and improve tampering location precision of reversible watermarking for authenticating three-dimensional(3D) models, a semi-fragile reversible watermarking based on virtual polygon projection and double modulation strategy is proposed. During the embedding, it first constructs virtual adjacent vertices for each vertex and obtains a corresponding virtual polygon, and then a watermark is generated according to the projection value of the current vertex on the corresponding polygon. For each vertex, double modulation is used to move the vertex to realize watermark embedding. For the verification, it first obtains the vertex position and extracts the watermark, and then regenerates a watermark according to the restored vertex. If the extracted watermark is consistent with the regenerated one, it means that the vertex has not been tampered, and the 3D model can be lossless recovered; otherwise, the vertex is tampered. Experimental results and analysis show that the proposed scheme outperforms the existing methods in embedding distortion and tampering location precision. It has potential application in the integrity authentication of 3D models.
作者：
Wang J.;Lei X.;Jiang Q.;Alfarraj O.;Tolba A.;...
期刊：
Computer Systems Science and Engineering,2023年45(2):1727-1742 ISSN：0267-6192
通讯作者：
Kim, G.-J.
作者机构：
[Jiang Q.; Wang J.; Lei X.] School of Computer & Communication Engineering, Changsha University of Science & Technology, Changsha, 410114, China;[Tolba A.; Alfarraj O.] Computer Science Department, Community College, King Saud University, Riyadh, 11437, Saudi Arabia;[Kim G.-J.] Department of Computer Engineering, Chonnam National University, Gwangju, 61186, South Korea
通讯机构：
[Kim, G.-J.] D;Department of Computer Engineering, South Korea
关键词：
deep factorization machine;denial-of-service attacks;GRMMP;Software-defined network
通讯机构：
[Zhuofan Liao] S;School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410114, China
关键词：
Mobile edge computing;Deep neural network (DNN);DNN partitioning and offloading;Heterogeneous edge computing
摘要：
Mobile edge computing is conducive to artificial intelligence computing near terminals, in which Deep Neural Networks (DNNs) should be partitioned to allocate tasks partially to the edge for execution to reduce latency and save energy. Most of the existing studies assume that the tasks are of the same type or the computing resources of the server are the same. In real life, Mobile Devices (MDs) and Edge Servers (ESs) are heterogeneous in type and computing resources, it is challenging to find the optimal partition point for each DNN and offload it to an appropriate ES. To fill this gap, we propose a partitioning-and-offloading scheme for the heterogeneous tasks-server system to reduce the overall system latency and energy consumption on DNN inference. The scheme has four steps. First, it establishes a partitioning and task offloading model for adaptive DNN model. Second, to reduce the solution space, the scheme designs a Partition Point Retain (PPR) algorithm. After that, the scheme gives an Optimal Partition Point (OPP) Algorithm to find the optimal partition point with the minimum cost for each ES corresponding to each MD. Based on the partition points, an offloading of DNN tasks for each MD is presented to finish the whole scheme. Simulations show that the proposed scheme reduces the total cost by 77.9% and 59.9% on average compared to Only-Local and Only-Server respectively in the heterogeneous edge computing environment.
摘要：
传统场景分类模型不能轻量高效地完成遥感图像中多尺度的关键特征提取，深度学习方法普遍存在计算量大、收敛速度慢等缺点。针对以上问题，本文充分利用CNN结构和Transformer结构对不同尺度特征的提取能力，提出了一种全局-局部特征提取模块(global and local features fused block, GLFF),并基于此模块设计了一个轻量级遥感图像场景分类模型(GLFFNet),该模型具有较好的局部信息和全局信息提取能力。为了验证GLFFNet的有效性，本文使用开源遥感图像数据集RSSCN7与SIRI-WHU测试GLFFNet与其他深度学习网络的复杂度和识别能力。最终，GLFFNet在RSSCN7与SIRI-WHU数据集上分别取得了高达94.82%和95.83%的识别准确率，优于其他先进的模型。
期刊：
ACM Transactions on Internet Technology,2023年23(3):1–23 ISSN：1533-5399
作者机构：
[Wang, Jin] School of Computer Science and Mathematics, Fujian University of Technology;School of Computer & Communication Engineering, Changsha University of Science & Technology, China;[Chen, Jiahao] School of Computer Science and Mathematics, Fujian University of Technology, China;[Ren, Yongjun] School of Computer and Software, Nanjing University of Information Science & Technology, China;[Xiong, Neal] Department of Computer Science and Mathematics, Sul Ross State University, USA
关键词：
Internet of Things;cryptographic commitment;date storage;zero-trust;Blockchain
摘要：
With the development of the Internet of Things (IoT), a large-scale, heterogeneous, and dynamic distributed network has been formed among IoT devices. There is an extreme need to establish a trust mechanism between devices, and blockchain can provide a zero-trust security framework for IoT. However, the efficiency of the blockchain is far from meeting the application requirements of the IoT, which has become the biggest resistance to the application of the blockchain in the IoT. Therefore, this paper combines sharding to build an effective Blockchain-based IoT data storage scheme (S-BDS). Sharding can solve the problem of blockchain capacity and scalability. While the blockchain provides data immutability and traceability for the IoT, it also brings huge demands for data credibility verification. The communication delay in the IoT system seriously affects the security of the system, while the Merkle proof of traditional blockchain occupies a lot of communication resources. This paper constructs Insertable Vector Commitment (IVC) in the bilinear group and replaces the Merkle tree with IVC to store IoT data in the blockchain. The construct has small-sized proof. It also has the ability to record the number of updates, which can prevent replay-attacks. Experiments show that each block processes 1,000 transactions, the proof size of a single data piece is 30% of the original scheme, and proofs from different shards can be aggregated. IVC can effectively reduce communication congestion and improve the stability and security of the IoT system.
