LacminCC: Lightweight Anonymous Communication Model In Cloud Computing

Fengyin Li, Yanli Wang, Hongwei Ju, Xinying Yu, Zhaojie Wang, Huiyu Zhou

TL;DR

LacminCC introduces a lightweight anonymous communication model for cloud computing that combines a novel anonymous Identity-Based Encryption (IBE) scheme with a group-based bulletin board system. By leveraging bilinear maps and time-sliced communication, it achieves sender, receiver, and relationship anonymity with significantly lower computational and storage overhead than traditional methods like Onion Routing or DC-nets.

What Problem Does This Paper Address?

In the era of big data and cloud computing, protecting the content of a message is no longer enough. Metadata—who is talking to whom, when, and how often—can be just as revealing. Existing anonymous communication systems struggle to balance security with efficiency:

  • Onion Routing (e.g., Tor): Vulnerable to sophisticated traffic-analysis attacks and exit node vulnerabilities.
  • DC-nets: Highly secure but computationally expensive and vulnerable to internal "dishonest" members.
  • Flooding Algorithms: Generate massive amounts of network traffic, consuming excessive bandwidth.

The authors identify a specific need for a "lightweight" solution suitable for small-to-medium groups (such as whistleblowers or corporate bidders) where users need high levels of privacy without the massive resource requirements of global-scale networks.

Methods

The authors propose a two-part solution:

  1. A New Anonymous IBE Scheme: Standard IBE allows a sender to use a recipient's identity (like an email address) as a public key. However, standard IBE often leaks that identity within the ciphertext. The authors' new scheme uses bilinear maps and is mathematically proven to be secure under the Bilinear Diffie-Hellman (BDH) Assumption. Crucially, it ensures that an adversary cannot extract the recipient's identity from the ciphertext (ANON-IND-ID-CCA security).

  2. The LacminCC Communication Model:

    • Grouping: A trusted Private Key Generator (PKG) divides users into $M$ groups of $N$ members.
  3. Bulletin Board: Instead of direct peer-to-peer transmission, all communication goes through a central bulletin board.
  4. Time-Slicing: The process is divided into four phases ($T_1$ to $T_4$).
  5. Encryption ($T_1$): Senders encrypt messages using the recipient's ID.
  6. Upload ($T_2$): Every user in the system uploads a ciphertext (either a real message or dummy traffic) to the board simultaneously. This hides the real sender in a crowd.
  7. Download ($T_3$): Users check the group ID ($C_1$) attached to ciphertexts. They only download messages meant for their specific group, drastically reducing bandwidth.
  8. Decryption ($T_4$): Users attempt to decrypt the downloaded messages with their private keys.

Datasets

The paper does not utilize external datasets. Instead, it focuses on the mathematical proof of the algorithm and a performance simulation. The model was implemented in Python and tested on a standard PC (CPU 2.30 GHz, 8 GB RAM) to measure storage and communication costs against theoretical benchmarks.

Key Insights and Ideas

  • Identity as the Key: By using the user's ID as the public key, the system eliminates the need for complex certificate management or the overhead of querying a Public Key Infrastructure (PKI) before sending a message.
  • The "Crowd" Defense: Forcing all users to upload at the same time ($T_2$) makes traffic analysis nearly impossible for an external observer, as they cannot distinguish between real communication and "noise" (dummy traffic).
  • Efficient Filtering via Grouping: One of the most clever aspects is the inclusion of a group identifier ($C_1$) in the ciphertext. This allows users to quickly filter out the 90% of messages not intended for their group without needing to attempt a full decryption, saving significant local memory and CPU cycles.
  • Dynamic Security: The PKG periodically (e.g., every 100–1000 rounds) regroups users and regenerates private keys, preventing adversaries from performing long-term correlation attacks.

Key Results

The authors compared LacminCC against three established models: Onion Routing, DCARPS, and Anonymous Path Routing.

  • Anonymity: LacminCC was the only model to satisfy all three criteria: sender anonymity, receiver anonymity, and communication relationship anonymity.
  • Communication Cost: The communication cost is simplified to $N$ (the number of users), which is lower than Onion Routing ($P + N$) or Anonymous Path Routing ($N + \gamma$).
  • Storage/Computation: LacminCC requires only one hashing, one encryption, and one decryption operation per message cycle. This is significantly "lighter" than the multiple layers of encryption/decryption required by Onion Routing.

Limitations and Future Work

  • The Trusted PKG: The model relies on a "credible" Private Key Generator. If the PKG is compromised, the anonymity of the entire system could be at risk. Future iterations might look into decentralized key generation.
  • Scalability vs. Anonymity: While the grouping method improves efficiency, the "anonymity set" is limited to the size of the group ($N$). If $N$ is too small, the privacy guarantees weaken.
  • Future Work: The authors plan to further optimize the model and apply it to specific cloud-based privacy leakage scenarios to test its robustness in "wild" network environments.

Summary updated

Abstract

Abstract With increasing application of cloud computing and big data technologies, a large amount of personal information is stored on the Internet, which raises the issue of privacy leakage. In order to protect people's data privacy, this paper firstly presents a new anonymous Identify-Based Encryption (IBE) scheme and shows the proof of its security under the Bilinear Diffie-Hellman Security Assumption. Then, by introducing the anonymous IBE scheme into an anonymous communication model, this paper introduces a new lightweight anonymous communication model for cloud computing, which guarantees the anonymity of system users and the security of messages during the communication in small groups. Our analysis shows that, the proposed communication model cannot only reduce memory consumption and improve message transmission efficiency, but also effectively resist traffic-analysis attacks, node eavesdropping, and finally achieve secure anonymous communication in cloud computing.
BibTeX
@article{li2021lacmincc,
  author = {Fengyin Li and Yanli Wang and Hongwei Ju and Xinying Yu and Zhaojie Wang and Huiyu Zhou},
  title = {{LacminCC: Lightweight Anonymous Communication Model In Cloud Computing}},
  journal = {EURASIP J. Wirel. Commun. Netw.},
  year = {2021},
  doi = {10.1186/s13638-021-01953-z},
}
Figure