Towards Proofs of Ownership Beyond Bounded Leakage

Cloud servers save their storage cost by applying deduplication. Duplicated copies of the same file uploaded by the cloud service clients can be reduced to a single copy by maintaining a list of clients who own the same file. Nowadays it is a common practice to rely on the message digest of the file for showing its possession. Yet, this property has been exploited to make the cloud storage service effectively become a content distribution network, by sharing a short message digest. Proof of ownership PoW has been proposed to address this problem. PoW is an interactive protocol by which the prover can prove to the verifier about the ownership of a file. Under this setting, the adversary is motivated to leak some knowledge of the file, for helping a non-owner to also claim ownership. We are intrigued to ask, what is the strongest possible form of leakage, such that a PoW protocol can be provably secure? In this paper, we propose a leakage-resilient PoW under a strong model, such that any adversary who holds leakage derived from a form of one-way function cannot falsely claim the file ownership.

[1]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[2]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[3]  Han-Chieh Chao,et al.  Proof of ownership in deduplicated cloud storage with mobile device efficiency , 2015, IEEE Network.

[4]  Jia Xu,et al.  Weak leakage-resilient client-side deduplication of encrypted data in cloud storage , 2013, ASIA CCS '13.

[5]  Roberto Di Pietro,et al.  Boosting efficiency and security in proof of ownership for deduplication , 2012, ASIACCS '12.

[6]  Jia Xu,et al.  Leakage Resilient Proofs of Ownership in Cloud Storage, Revisited , 2014, ACNS.

[7]  Roberto Di Pietro,et al.  Proof of ownership for deduplication systems: A secure, scalable, and efficient solution , 2016, Comput. Commun..

[8]  Amit Sahai,et al.  On the (im)possibility of obfuscating programs , 2012, JACM.

[9]  Oded Goldreich Foundations of Cryptography: Index , 2001 .

[10]  Roberto Di Pietro,et al.  A tunable proof of ownership scheme for deduplication using Bloom filters , 2014, 2014 IEEE Conference on Communications and Network Security.

[11]  Yael Tauman Kalai,et al.  On cryptography with auxiliary input , 2009, STOC '09.

[12]  Yevgeniy Dodis,et al.  Proofs of Retrievability via Hardness Amplification , 2009, IACR Cryptol. ePrint Arch..

[13]  Siu-Ming Yiu,et al.  Identity-Based Encryption Resilient to Continual Auxiliary Leakage , 2012, EUROCRYPT.

[14]  Benny Pinkas,et al.  Proofs of ownership in remote storage systems , 2011, CCS '11.

[15]  Mark Zhandry,et al.  Differing-Inputs Obfuscation and Applications , 2013, IACR Cryptol. ePrint Arch..

[16]  Gil Segev,et al.  Chosen-Ciphertext Security via Correlated Products , 2010, SIAM J. Comput..

[17]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[18]  Oded Goldreich,et al.  The Foundations of Cryptography - Volume 1: Basic Techniques , 2001 .

[19]  Oded Goldreich,et al.  Foundations of Cryptography: List of Figures , 2001 .

[20]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[21]  Mihir Bellare,et al.  Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation , 2014, ASIACRYPT.