Entity Authentication Protocol for P2P Cloud Storage based on Ternary Huffman Merkle Hash Tree

Ningning Song, Xianwei Zhou, Qian LiuApplied Mathematics & Information Sciences 2014 · DOI

TL;DR

This paper proposes a novel entity authentication protocol for P2P cloud storage systems that leverages a Ternary Huffman Merkle Hash Tree (HuffMHT) structure. By incorporating access probability into the tree construction and employing a "signature of knowledge" mechanism, the protocol aims to enhance security, reduce authentication delay, and improve network efficiency compared to existing methods.

What Problem Does This Paper Address?

The rapid growth of cloud storage, particularly P2P cloud storage, presents significant security challenges. Traditional master-slave architectures are vulnerable to single points of failure and grant excessive control to providers, raising user concerns. P2P systems, while offering decentralization, often struggle with efficient content search and robust security. Existing entity authentication schemes for cloud storage, such as those based on trust management or public key certificates, are either unsuitable for large-scale P2P environments or suffer from high maintenance costs and authentication delays. This paper addresses the need for a secure, efficient, and scalable entity authentication protocol specifically for P2P cloud storage.

Methods

The core of the proposed solution is the Ternary Huffman Merkle Hash Tree (HuffMHT). Unlike standard Merkle trees, this approach constructs a ternary tree where the placement of nodes is determined by their access probability. Nodes with higher access probability are placed deeper in the tree, aiming to optimize path lengths for frequent access. The protocol also integrates a "signature of knowledge" mechanism. This allows a user to prove possession of a private key without revealing it, enhancing security and reducing the need to transmit sensitive information. The protocol combines symmetric and public key cryptography to balance security and performance. The system model is layered, including physical, semantic, router, management, and application layers, with a focus on semantic P2P structures.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Access Probability-Driven Tree Structure: Building the Huffman Merkle Hash Tree based on access probability is a novel approach to optimize authentication paths. Placing frequently accessed nodes deeper in the tree can reduce the average path length for authentication requests.
  • "Signature of Knowledge" for Enhanced Security: This cryptographic primitive allows for non-interactive proof of possessing a secret (private key) without revealing it. This is crucial for secure authentication in distributed systems where direct key exchange is risky.
  • Hybrid Cryptography for Efficiency: The combination of symmetric and public key algorithms aims to strike a balance between strong security and reduced authentication latency, a common bottleneck in distributed systems.
  • Dynamic Updates for Scalability: The paper proposes schemes for dynamically updating the HuffMHT when nodes join or leave the cluster, which is essential for the evolving nature of P2P networks.

Key Results

The paper presents performance analysis through figures that compare the proposed protocol with a prior work ([10]). The results suggest that the proposed protocol requires fewer hash computations for:

  • Computing the root hash value: The proposed method shows a lower number of hashes compared to paper [10] as the number of nodes increases.
  • Authentication again: The protocol requires significantly fewer hashes (sum = 1) compared to paper [10] (sum = 2n-1).
  • New node addition: The proposed protocol requires fewer hashes (sum = 2) compared to paper [10] (sum = 2n-1).
  • Node leaves: The number of hashes is also shown to be more efficient, with specific formulas provided for different scenarios.

Qualitatively, the protocol is claimed to resist eavesdropping, replay, and forgery attacks, while maintaining communication reliability, integration, and secrecy without leaking private keys.

Limitations and Future Work

  • Limitations: The paper acknowledges that the actual calculation of the Ternary Huffman Tree is only valid with leaf nodes having a relationship. It also mentions that existing Huffman-based hash tree protocols have high maintenance costs, implying this is an area for improvement. The paper does not explicitly detail the computational complexity of the "signature of knowledge" generation and verification beyond stating it's computationally infeasible to forge without the private key.
  • Future Work: The paper focuses on the design and theoretical analysis of the protocol. Further research could involve implementing the protocol in a real-world P2P cloud storage system and conducting extensive empirical evaluations to validate its performance and security claims under various network conditions. Exploring more advanced dynamic update mechanisms and formal security proofs would also be valuable.

Summary updated

BibTeX
@inproceedings{song2014entity,
  author = {Ningning Song and Xianwei Zhou and Qian Liu},
  title = {{Entity Authentication Protocol for P2P Cloud Storage based on Ternary Huffman Merkle Hash Tree}},
  booktitle = {Applied Mathematics \& Information Sciences},
  year = {2014},
  doi = {10.12785/amis/010134},
}

Loading related content...

Figure