Proceedings of the 27th Annual ACM Symposium on Applied Computing 2012
DOI: 10.1145/2245276.2245361
|View full text |Cite
|
Sign up to set email alerts
|

Private data deduplication protocols in cloud storage

Abstract: In this paper, a new notion which we call private data deduplication protocol, a deduplication technique for private data storage is introduced and formalized. Intuitively, a private data deduplication protocol allows a client who holds a private data proves to a server who holds a summary string of the data that he/she is the owner of that data without revealing further information to the server. Our notion can be viewed as a complement of the state-of-the-art public data deduplication protocols of Halevi et … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 89 publications
(44 citation statements)
references
References 10 publications
(7 reference statements)
0
40
0
Order By: Relevance
“…Previous work by Ng et al [22] made the first attempt towards this goal, but gave an unsatisfactory solution: As pointed out by Xu et al [20], Ng et al [22] formulates the privacy property locally for each block and their scheme suffers from "divide and conquer" attack: If an input file with N blocks has 1 bit min-entropy in each block independently, then this file could be recovered by an outside adversary via brute force search in time O(N ) instead of O(2 N ).…”
Section: Generic Construction Of Privacy-preserving-powmentioning
confidence: 96%
“…Previous work by Ng et al [22] made the first attempt towards this goal, but gave an unsatisfactory solution: As pointed out by Xu et al [20], Ng et al [22] formulates the privacy property locally for each block and their scheme suffers from "divide and conquer" attack: If an input file with N blocks has 1 bit min-entropy in each block independently, then this file could be recovered by an outside adversary via brute force search in time O(N ) instead of O(2 N ).…”
Section: Generic Construction Of Privacy-preserving-powmentioning
confidence: 96%
“…For example, the PoW schemes in [24,25,26,15,17,27] are designed to work with honest-but-curious servers. Due to the use of CE in many existing PoW schemes such as [25,26,16,17,22], these schemes are not secure against content analysis attacks as previously discussed [16].…”
Section: Related Workmentioning
confidence: 99%
“…It transfer the data based on the query. [5] S. Quinlan and S. Dorward, describes the archival data storage. It imposes a write-once policy, thwarting fortuitous or malevolent obliteration of data.…”
Section: Literature Surveymentioning
confidence: 99%