Proceedings of the 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing 2011
DOI: 10.4108/icst.collaboratecom.2011.247089
|View full text |Cite
|
Sign up to set email alerts
|

Collaborative Integrity Verification in Hybrid Clouds

Abstract: Abstract-A hybrid cloud is a cloud computing environment in which an organization provides and manages some internal resources and the others provided externally. However, this new environment could bring irretrievable losses to the clients due to lack of integrity verification mechanism for distributed data outsourcing. In this paper, we address the construction of a collaborative integrity verification mechanism in hybrid clouds to support the scalable service and data migration, in which we consider the exi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(25 citation statements)
references
References 16 publications
0
25
0
Order By: Relevance
“…The concerns while designing the data integrity schemes because they are vulnerable to different attacks [44]- [46]. The possible attacks against the schemes are discussed as follows:…”
Section: ) Securitymentioning
confidence: 99%
“…The concerns while designing the data integrity schemes because they are vulnerable to different attacks [44]- [46]. The possible attacks against the schemes are discussed as follows:…”
Section: ) Securitymentioning
confidence: 99%
“…It is also easy to perform brute-force attacks on the passwords that have kept for data, it does not take long time for them to open the resources [19].…”
Section: Major Challenges/issuesmentioning
confidence: 99%
“…So that, we have the following definition: Definition 3 (Collision-Resistant Hash): A hash family ℍ is ( , )-collision-resistant if no -time adversary has advantage at least in breaking collision resistance of ℍ. We set up our system using bilinear pairings proposed by Boneh and Franklin [12]. Let and be two multiplicative groups using elliptic curve conventions with a large prime order .…”
Section: Storage Layermentioning
confidence: 99%
“…We use [ ] to denote the computation cost of an exponent operation in , namely, , where is a positive integer in ℤ and ∈ or . We neglect the computation cost of algebraic operations and simple modular arithmetic operations because they run fast enough [12]. The most complex operation is the computation of a bilinear map (⋅, ⋅) between two elliptic points (denoted as [ ]).…”
Section: Performance Analysis For Cddrmentioning
confidence: 99%
See 1 more Smart Citation