Introduction
Digital forensics in the cloud era faces a significant challenge: balancing the need for thorough investigation with the privacy rights of innocent users. Traditional methods like cloning hard drives are no longer feasible due to the distributed and co-mingled nature of cloud data. While previous research introduced "server-aided privacy-preserving confidential forensic investigation," it left a critical legal gap regarding the admissibility of evidence. Because administrators never saw the plaintext during the search, they could not traditionally vouch for the integrity of the retrieved data.
System Architecture and Methodology
The authors propose a "double encryption" scheme that leverages Commutative Encryption. In this scheme, the order of encryption does not affect the final result: $E_A(E_B(m)) = E_B(E_A(m))$. This property allows an investigator to search for evidence without the administrator knowing the search terms, and without the investigator seeing irrelevant private data.
The process involves three primary phases:
- Search Phase: The investigator encrypts a keyword with their public key. The administrator encrypts server documents with the same key. Matches are identified by comparing ciphertexts.
- Double Encryption: Matching documents are encrypted a second time by the administrator using their secret key. Due to commutativity, the investigator can remove their own encryption layer, leaving the document in a state encrypted only by the administrator ($E_{eA}(W)$).
- Verification: This "digital seal" allows the administrator to act as a Designated Verifier in court, confirming that the evidence presented by the investigator matches the original data without having seen it during the search.
Performance Evaluation
The system was implemented using an unconventional application of the RSA cryptosystem and MD5 hashing for fixed-length block processing. Evaluation was conducted using Microsoft Word documents of 250, 1000, and 5000 words.
As shown in the results, processing time scales linearly with document size. For a 5000-word document, the administrative overhead (preprocessing, double encryption, and searching) totaled approximately 77 seconds. The investigator's decryption phase took roughly 58 seconds, while the final courtroom verification step was completed in approximately 54 seconds. While RSA is computationally intensive, these times are considered reasonable for forensic applications.
Conclusion and Future Directions
The proposed scheme successfully addresses the admissibility gap in privacy-preserving forensics by turning the administrator into a "blind witness." However, limitations remain, particularly regarding the performance of public-key encryption and the restriction to simple keyword matching. Future work aims to explore more efficient commutative ciphers and multi-dimensional search capabilities, such as range and equality searches over encrypted data.
Summary updated