Leakage Resilient Proofs of Ownership in Cloud Storage, Revisited

نویسندگان

  • Jia Xu
  • Jianying Zhou
چکیده

Client-side deduplication is a very effective mechanism to reduce both storage and communication cost in cloud storage service. Halevi et al. (CCS ’11) discovered security vulnerability in existing implementation of client-side deduplication and proposed a cryptographic primitive called “proofs of ownership” (PoW) as a countermeasure. In a proof of ownership scheme, any owner of the same file can prove to the cloud storage server that he/she owns that file in an efficient and secure manner, even if a bounded amount of any efficiently extractable information of that file has been leaked. We revisit Halevi et al.’s formulation of PoW and significantly improve the understanding and construction of PoW. Our contribution is twofold: • Firstly, we propose a generic and conceptually simple approach to construct Privacy-Preserving Proofs of Ownership scheme, by leveraging on well-known primitives (i.e. Randomness Extractor and Proofs of Retrievability) and technique (i.e. sample-then-extract). Our approach can be roughly described as Privacy-Preserving PoW = Randomness Extractor + Proofs of Retrievability. • Secondly, in order to provide a better instantiation of Privacy-Preserving-PoW, we propose a novel design of randomness extractor with large output size, which improves the state of art by reducing both the random seed length and entropy loss (i.e. the difference between the entropy of input and output) simultaneously.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leakage-Resilient Client-side Deduplication of Encrypted Data in Cloud Storage

Cloud storage service is gaining popularity in recent years. Clientside deduplication is an effective approach to save bandwidth and storage, and adopted by many cloud storage services including Dropbox, MozyHome and Wuala. Security flaws, which may lead to private data leakage, in the existing client-side deduplication mechanism are found recently by Harnik et al. (S&P Magazine, ’10) and Halev...

متن کامل

Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage

We provide a framework for constructing leakage-resilient identification (ID) protocols in the bounded retrieval model (BRM) from proofs of storage (PoS) that hide partial information about the file. More precisely, we describe a generic transformation from any zero-knowledge PoS to a leakage-resilient ID protocol in the BRM. We then describe a ZK-PoS based on RSA which, under our transformatio...

متن کامل

Towards Secure Cloud Storage

In this extended abstract, we explain a demo of the leakage-resilient authentication and data (key) management system which can be regarded as a prominent solution for secure cloud storage.

متن کامل

A new security proof for FMNV continuous non-malleable encoding scheme

A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...

متن کامل

Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP

Garg, Jain, and Sahai first consider zero knowledge proofs in the presence of leakage on the local state of the prover, and present a leakageresilient-zero-knowledge proof system for HC (Hamiltonian Cycle) problem. Their construction is called (1 + ε)-leakage-resilient zero-knowledge, for any constant ε > 0, because the total length of the leakage the simulator needs is (1 + ε) times as large a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013