Visible to the public Privacy-Preserving and Unforgeable Searchable Encrypted Audit Logs for Cloud Storage

TitlePrivacy-Preserving and Unforgeable Searchable Encrypted Audit Logs for Cloud Storage
Publication TypeConference Paper
Year of Publication2018
AuthorsZhao, W., Qiang, L., Zou, H., Zhang, A., Li, J.
Conference Name2018 5th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/2018 4th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)
Date Publishedjun
Keywordsaudit log, auditing, cloud computing, cloud storage, compositionality, data privacy, Encryption, encryption audits, fine-grained conjunctive query, IP networks, Metrics, peks, privacy, Privacy-preserving, pubcrawl, public key cryptography, public key encryption with keyword search, query processing, remote servers, resilience, Resiliency, Searchable encryption, Servers, unforgeability, unforgeable searchable encrypted audit logs

Audit logs are widely used in information systems nowadays. In cloud computing and cloud storage environment, audit logs are required to be encrypted and outsourced on remote servers to protect the confidentiality of data and the privacy of users. The searchable encrypted audit logs support a search on the encrypted audit logs. In this paper, we propose a privacy-preserving and unforgeable searchable encrypted audit log scheme based on PEKS. Only the trusted data owner can generate encrypted audit logs containing access permissions for users. The semi-honest server verifies the audit logs in a searchable encryption way before granting the operation rights to users and storing the audit logs. The data owner can perform a fine-grained conjunctive query on the stored audit logs, and accept only the valid audit logs. The scheme is immune to the collusion tamper or fabrication conducted by server and user. Concrete implementations of the scheme is put forward in detail. The correct of the scheme is proved, and the security properties, such as privacy-preserving, searchability, verifiability and unforgeability are analyzed. Further evaluation of computation load shows that the design is of considerable efficiency.

Citation Keyzhao_privacy-preserving_2018