4.7 Article

Secure Data Sequence Query Framework Based on Multiple Fogs

Journal

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING
Volume 9, Issue 4, Pages 1883-1900

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TETC.2019.2943524

Keywords

Fog computing; Merkle hashing tree; data sequence query; security

Funding

  1. National Natural Science Foundation of China [61402055, 61902040]
  2. Natural Science Foundation of Hunan Province [2018JJ2445]
  3. FDCT Project [0007/2018/A1]
  4. DCT-MoST Joint Project of SAR Macau [FDCT/025/2015/AMJ]
  5. University of Macau [CPG2018-00032-FST, SRG 2018-00111-FST]
  6. National Natural Science Key Foundation of China [61532013]
  7. National China 973 Project [2015CB352401]
  8. Shanghai Scientific Innovation Act of STCSM [15JC1402400]

Ask authors/readers for more resources

The proposed secure data sequence query framework in fog computing utilizes Merkle hashing tree topologies and (t, n) threshold secret sharing scheme to ensure fast, accurate, and reliable data access for users. It guarantees data reliability and effectively protects data against various attacks.
Fog computing is used to process a large amount of data produced by terminal devices where fog nodes are the closest acquirers to the terminal devices. In fog computing, the processed data may be tampered with or illegally captured by some malicious nodes while the data is transferred or stored. So, when some applications need to require data process with high security, fog computing must provide a security approach to secure and check the final results. In this paper, we propose a secure data sequence query framework based on multiple fog servers, where we use multiple fog servers to store and provide data hashing values to verify corresponding data sequence. In the proposed scheme, the cloud server needs to pre-designate some Merkle hashing tree topologies to the fog network, then the fog server directly acquires related data from leaf-nodes (fog nodes) according to one of the pre-designated Merkle hashing tree topologies; at the same time, an actual Merkle hashing tree is constructed according to the selected Merkle hashing tree topology in the fog network. In fog computing, the related fog nodes participate in computing and transferring the hashing values on data, then the corresponding root node uses the (t, n) threshold secret sharing scheme to compute and distribute the sub-secrets of the root value to other fog servers. Therefore, when a user requests a data sequence from a fog server, the fog server may immediately respond to the request and the other fog servers can provide the sub-secrets of hashing root value to verify the corresponding data sequence. Our proposed framework can ensure that users may obtain required data fast, accurately and reliably. Additionally, based on the data query security requirements of fog computing, we analyze the security of our proposed scheme. Our proposed scheme not only guarantees the reliability of data but also effectively protects data against various attacks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available