scispace - formally typeset
Open AccessProceedings ArticleDOI

Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing

TLDR
This paper utilize and uniquely combine the public key based homomorphic authenticator with random masking to achieve the privacy-preserving public cloud data auditing system, which meets all above requirements.
Abstract
Cloud Computing is the long dreamed vision of computing as a utility, where users can remotely store their data into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources. By data outsourcing, users can be relieved from the burden of local data storage and maintenance. However, the fact that users no longer have physical possession of the possibly large size of outsourced data makes the data integrity protection in Cloud Computing a very challenging and potentially formidable task, especially for users with constrained computing resources and capabilities. Thus, enabling public auditability for cloud data storage security is of critical importance so that users can resort to an external audit party to check the integrity of outsourced data when needed. To securely introduce an effective third party auditor (TPA), the following two fundamental requirements have to be met: 1) TPA should be able to efficiently audit the cloud data storage without demanding the local copy of data, and introduce no additional on-line burden to the cloud user; 2) The third party auditing process should bring in no new vulnerabilities towards user data privacy. In this paper, we utilize and uniquely combine the public key based homomorphic authenticator with random masking to achieve the privacy-preserving public cloud data auditing system, which meets all above requirements. To support efficient handling of multiple auditing tasks, we further explore the technique of bilinear aggregate signature to extend our main result into a multi-user setting, where TPA can perform multiple auditing tasks simultaneously. Extensive security and performance analysis shows the proposed schemes are provably secure and highly efficient.

read more

Citations
More filters
Book ChapterDOI

Efficient dynamic provable data possession with public verifiability and data privacy

TL;DR: In this scheme, no exponentiation and only three pairings are required during the proof of data possession check, which clearly outperforms all the existing schemes in the literature.
Proceedings ArticleDOI

Block Chain-Based Data Audit and Access Control Mechanism in Service Collaboration

TL;DR: This paper builds a blockchain-based solution through research on cloud storage service model and blockchain technology, which solves the single point of trust problem in the traditional data auditing service model by collective trust.
Journal ArticleDOI

NaEPASC: a novel and efficient public auditing scheme for cloud data

TL;DR: This paper combines ID-based aggregate signature and public verification to construct the protocol of provable data integrity, and greatly reduces the time of auditing a single task on the TPA side.
Journal ArticleDOI

Outlook on moving of computing services towards the data sources

TL;DR: The possibilities of providing many of the IoT services which are currently hosted in monolithic cloud centres, moving these computing services into nano data centres (NaDa).
Proceedings ArticleDOI

Supporting Cloud Accountability by Collecting Evidence Using Audit Agents

TL;DR: A cloud-adopted evidence collection process, possible evidence sources and privacy issues in the context of audits are presented and an agent based architecture is introduced, which is able to perform audit processing and reporting continuously.
References
More filters
Journal Article

Above the Clouds: A Berkeley View of Cloud Computing

TL;DR: This work focuses on SaaS Providers (Cloud Users) and Cloud Providers, which have received less attention than SAAS Users, and uses the term Private Cloud to refer to internal datacenters of a business or other organization, not made available to the general public.
Book ChapterDOI

Short Signatures from the Weil Pairing

TL;DR: A short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyperelliptic curves is introduced, designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel.
Journal ArticleDOI

Efficient signature generation by smart cards

TL;DR: An efficient algorithm that preprocesses the exponentiation of a random residue modulo p is presented, which improves the ElGamal signature scheme in the speed of the procedures for the generation and the verification of signatures and also in the bit length of signatures.
Posted Content

Provable Data Possession at Untrusted Stores.

TL;DR: Ateniese et al. as discussed by the authors introduced the provable data possession (PDP) model, which allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it.
Journal ArticleDOI

Security Arguments for Digital Signatures and Blind Signatures

TL;DR: It is proved that a very slight variation of the well-known El Gamal signature scheme resists existential forgeries even against an adaptively chosen-message attack and an appropriate notion of security related to the setting of electronic cash is defined.
Related Papers (5)