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 new, efficient anonymous Identity-Based Encryption (IBE) scheme paired with a smart grouping strategy to enable secure, private communication in cloud environments. Unlike traditional models that struggle with high overhead or message limits, LacminCC achieves sender, receiver, and relationship anonymity with significantly lower memory and bandwidth requirements.

What Problem Does This Paper Address?

In the era of big data and cloud computing, protecting what you say is only half the battle; protecting who you are talking to is just as critical. Existing anonymous communication models often fall short in cloud settings:

  • Onion Routing (like Tor): Vulnerable to traffic-analysis attacks and exit node vulnerabilities.
  • DC-nets: Highly secure but require complex cooperation from all members, making them fragile if even one participant is dishonest.
  • Flooding Algorithms: Generate massive amounts of network traffic, hogging bandwidth.

The authors identify a specific gap: the need for a "lightweight" system suitable for small-to-medium groups (like whistleblowers or private bidders) that doesn't sacrifice security for speed.

Methods

The researchers built LacminCC on two main pillars:

  1. A New Anonymous IBE Scheme: Identity-Based Encryption allows a user’s identity (like an email or ID string) to act as their public key, eliminating the need for complex certificate management. The authors improved upon existing schemes by shortening the ciphertext and reducing the number of random variables required, which lowers the computational "tax" on the system.
  2. Grouping and Bulletin Board Strategy:
    • The Bulletin Board: Instead of direct peer-to-peer interaction (which leaks metadata), all users upload ciphertexts to a central bulletin board.
  3. Automatic Grouping: Users are partitioned into groups. When a message is sent, it includes a group ID ($C_1$).
  4. Filtering: Users only download and attempt to decrypt messages tagged with their specific group ID. This "screening" process drastically reduces the number of decryption attempts a device must perform.
  5. Time Slicing: The model operates in synchronized phases (Encrypt $\rightarrow$ Upload $\rightarrow$ Download $\rightarrow$ Decrypt) to further mask traffic patterns.

Datasets

The paper does not use a standard external dataset. Instead, the authors implemented the model in Python and conducted simulations on a standard PC (CPU 2.30 GHz, 8 GB RAM) to evaluate performance. They compared their results against established protocols like Onion Routing, DCARPS, and Anonymous Path Routing.

Key Insights and Ideas

  • Identity as the Key: By using the receiver's ID as the public key, the sender doesn't need to query a public key infrastructure (PKI). This prevents an adversary from monitoring "key lookups" to guess who is about to receive a message.
  • Breaking the "One Message" Limit: Many anonymous models (like DC-nets) only allow one message to be sent per round to maintain security. LacminCC removes this bottleneck, allowing users to send an arbitrary number of messages simultaneously without a massive spike in latency.
  • The Power of Noise: To resist traffic analysis, users who aren't sending real messages upload "pseudo-ciphertexts." Because all users are uploading something during the $T_2$ phase, an observer cannot distinguish the real senders from the idle ones.

Key Results

  • Full Anonymity: In a comparative analysis (Table 2), LacminCC was the only model to satisfy all three privacy criteria: sender anonymity, receiver anonymity, and communication relationship anonymity.
  • Efficiency Gains: The communication cost was reduced to a factor of $N$ (the number of users), outperforming Onion Routing ($P+N$) and Anonymous Path Routing ($N+\gamma$).
  • Scalability in Rounds: As the total number of messages increased, LacminCC's processing time remained nearly flat and extremely low (near 0 ms in simulations), while competing models saw time costs skyrocket to over 40,000 ms for 1,000 messages (Figure 2).

Limitations and Future Work

While LacminCC is highly efficient, the authors note it is currently optimized for small and medium-sized groups. In massive, global-scale networks, the "everyone uploads" strategy might eventually hit a bandwidth ceiling.

The authors plan to continue optimizing the model and explore deeper integrations into specific cloud service architectures to further mitigate the risks of privacy leakage in the wild.

Summary updated

Abstract

<title>Abstract</title> 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.To protect people's data privacy, this paper firstly presents a new anonymous Identify-Based Encryption (IBE) scheme and gives the proof of its security under the Bilinear Diffie-Hellman Security Assumption. Then, by introducing the anonymous IBE scheme into anonymous communication fields, this paper introduces a new lightweight anonymous communication model for cloud computing, which guarantees the anonymity of system users and the security of messages 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