DOI: 10.1007/978-0-387-09699-5_44
|View full text |Cite
|
Sign up to set email alerts
|

A Security Protocol for Self-Organizing Data Storage

Abstract: This paper describes a cryptographic protocol for securing self-organized data storage through periodic verifications. The proposed verification protocol, which goes beyond simple integrity checks and proves data conservation, is deterministic, efficient, and scalable. The security of this scheme relies both on the ECDLP intractability assumption and on the difficulty of finding the order of some specific elliptic curve over Z n. The protocol also makes it possible to personalize replicas and to delegate verif… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(18 citation statements)
references
References 9 publications
0
18
0
Order By: Relevance
“…Even if behaving in a stable way, it is conceivable that untrusted users may cheat, by erasing the data they are supposed to store: to avoid this problem, provable data possession protocols exist [23,24]: these protocols allow to verify whether a given peer is actually holding the data it is claiming to store. In addition, game-theoretic incentive models [25,26] have been devised to encourage peers to participate to the network according to the protocol: users who do not behave fairly will lose their backup.…”
Section: Peer Behavior and Trustmentioning
confidence: 99%
“…Even if behaving in a stable way, it is conceivable that untrusted users may cheat, by erasing the data they are supposed to store: to avoid this problem, provable data possession protocols exist [23,24]: these protocols allow to verify whether a given peer is actually holding the data it is claiming to store. In addition, game-theoretic incentive models [25,26] have been devised to encourage peers to participate to the network according to the protocol: users who do not behave fairly will lose their backup.…”
Section: Peer Behavior and Trustmentioning
confidence: 99%
“…To ensure integrity, below two properties need to be fulfilled, those are: Completeness, Soundness [18]. Completeness: Whenever the user sends challenge to server, server needs to compute response.…”
Section: A Integritymentioning
confidence: 99%
“…A lot of researchers have worked on the issue of remote verification of integrity in the storage mechanism adopted by cloud, all them have focused on different scenario of applications and tried to attain various objectives [4][5][6][7][8][9][10][11][12][13][14]. A model to ensure the control of data files in an environment which is not trustworthy is proposed by researcher and is known is provable data possession [6,10].…”
Section: Review Of Related Literaturementioning
confidence: 99%