Return
Efficient incremental authentication for the updated data in fog computing
DOI:10.1016/j.future.2020.07.039.png)
Abstract
En 中文
The data update is a basic processing mechanism in fog computing, because the data of fog computing is usually dynamic and variable. In order to resist the forgery attack, incremental signature scheme can achieve the efficient incremental authentication of the updated data in fog computing. This paper constructs a lattice-based multi-blocks and mixed incremental signature scheme. All the known incremental operations, such as displacement, deletion and insertion, are supported to update multiblocks data in the proposed scheme. We prove that the unforgeability property in the random oracle model is based on the shortest integer solution (SIS) problem. The analysis of the proposed scheme shows that the public key size and the signature length are both controlled in reasonable intervals. Additionally, most of the time-consuming computing in the proposed scheme can be finished by the parallel computing or the pre-computing, which can improve the running speed of the proposed scheme. The design results are simulated by using Java program on a personal computer Intel(R) Core (TM) i7-8700K (3.7 GHz), 32G RAM. At last, an efficient incremental authentication scheme for the updated data in fog computing is presented by using the proposed incremental signature. The system resources of the fog computing, like computing, storage and bandwidth resources, can be saved efficiently in our proposed scheme. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Incremental signature
Lattice-based cryptography
Fog computing
Data update
Authentication
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.9K
Citations:
2.3W

