A Provable data possession scheme with data hierarchy in cloud

Changlu Lin; Fucai Luo; Huaxiong Wang; Yan Zhu

doi:10.1007/978-3-319-38898-4_18

A Provable data possession scheme with data hierarchy in cloud

Changlu Lin^*, Fucai Luo, Huaxiong Wang, Yan Zhu

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

3 Citations (Scopus)

Abstract

In recent years, numerous provable data possession (PDP) schemes have been proposed for checking the availability and integrity of data stored on cloud storage server (CSS) which is not fully trusted. However, these schemes do not work with specific subsets of verifiers, and they do not efficiently support dynamic enrollment and revocation of verifiers. In this paper, we propose a novel provable data possession scheme under hierarchical data framework in cloud environment. Our scheme can be considered as a generalization of privately verifiable PDP schemes. Specifically, data of different values are integrated into a data hierarchy, and clients are classified and authorized different access permissions according to their amounts of payment. Furthermore, our scheme allows the data owner to efficiently enroll and revoke clients. The scheme satisfies existential unforgeability against malicious CSS based on the hardness of the computational Diffie-Hellman problem.

Original language	English
Title of host publication	Information security and cryptology
Subtitle of host publication	11th International Conference, Inscrypt 2015, Beijing, China, November 1-3, 2015 ; proceedings
Editors	Dongdai Lin, XiaoFeng Wang, Moti Yung
Place of Publication	Cham
Publisher	Springer, Springer Nature
Pages	301-321
Number of pages	21
ISBN (Electronic)	9783319388984
ISBN (Print)	9783319388977
DOIs	https://doi.org/10.1007/978-3-319-38898-4_18
Publication status	Published - 2016
Externally published	Yes
Event	11th International Conference on Information Security and Cryptology, Inscrypt 2015 - Beijing, China Duration: 1 Nov 2015 → 3 Nov 2015

Publication series

Name	Lecture Notes in Computer Science
Volume	9589
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	11th International Conference on Information Security and Cryptology, Inscrypt 2015
Country/Territory	China
City	Beijing
Period	1/11/15 → 3/11/15

Keywords

Cloud storage server
Computational Diffie-Hellman assumption
Data hierarchy
Provable data possession

Access to Document

10.1007/978-3-319-38898-4_18

Cite this

Lin, C., Luo, F., Wang, H., & Zhu, Y. (2016). A Provable data possession scheme with data hierarchy in cloud. In D. Lin, X. Wang, & M. Yung (Eds.), Information security and cryptology: 11th International Conference, Inscrypt 2015, Beijing, China, November 1-3, 2015 ; proceedings (pp. 301-321). (Lecture Notes in Computer Science; Vol. 9589). Springer, Springer Nature. https://doi.org/10.1007/978-3-319-38898-4_18

Lin, Changlu ; Luo, Fucai ; Wang, Huaxiong et al. / A Provable data possession scheme with data hierarchy in cloud. Information security and cryptology: 11th International Conference, Inscrypt 2015, Beijing, China, November 1-3, 2015 ; proceedings. editor / Dongdai Lin ; XiaoFeng Wang ; Moti Yung. Cham : Springer, Springer Nature, 2016. pp. 301-321 (Lecture Notes in Computer Science).

@inproceedings{fe5fcfe6093f4b079b62e6bc2149dc38,

title = "A Provable data possession scheme with data hierarchy in cloud",

abstract = "In recent years, numerous provable data possession (PDP) schemes have been proposed for checking the availability and integrity of data stored on cloud storage server (CSS) which is not fully trusted. However, these schemes do not work with specific subsets of verifiers, and they do not efficiently support dynamic enrollment and revocation of verifiers. In this paper, we propose a novel provable data possession scheme under hierarchical data framework in cloud environment. Our scheme can be considered as a generalization of privately verifiable PDP schemes. Specifically, data of different values are integrated into a data hierarchy, and clients are classified and authorized different access permissions according to their amounts of payment. Furthermore, our scheme allows the data owner to efficiently enroll and revoke clients. The scheme satisfies existential unforgeability against malicious CSS based on the hardness of the computational Diffie-Hellman problem.",

keywords = "Cloud storage server, Computational Diffie-Hellman assumption, Data hierarchy, Provable data possession",

author = "Changlu Lin and Fucai Luo and Huaxiong Wang and Yan Zhu",

year = "2016",

doi = "10.1007/978-3-319-38898-4_18",

language = "English",

isbn = "9783319388977",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Springer Nature",

pages = "301--321",

editor = "Dongdai Lin and XiaoFeng Wang and Moti Yung",

booktitle = "Information security and cryptology",

address = "United States",

note = "11th International Conference on Information Security and Cryptology, Inscrypt 2015 ; Conference date: 01-11-2015 Through 03-11-2015",

}

Lin, C, Luo, F, Wang, H & Zhu, Y 2016, A Provable data possession scheme with data hierarchy in cloud. in D Lin, X Wang & M Yung (eds), Information security and cryptology: 11th International Conference, Inscrypt 2015, Beijing, China, November 1-3, 2015 ; proceedings. Lecture Notes in Computer Science, vol. 9589, Springer, Springer Nature, Cham, pp. 301-321, 11th International Conference on Information Security and Cryptology, Inscrypt 2015, Beijing, China, 1/11/15. https://doi.org/10.1007/978-3-319-38898-4_18

A Provable data possession scheme with data hierarchy in cloud. / Lin, Changlu; Luo, Fucai; Wang, Huaxiong et al.
Information security and cryptology: 11th International Conference, Inscrypt 2015, Beijing, China, November 1-3, 2015 ; proceedings. ed. / Dongdai Lin; XiaoFeng Wang; Moti Yung. Cham: Springer, Springer Nature, 2016. p. 301-321 (Lecture Notes in Computer Science; Vol. 9589).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - A Provable data possession scheme with data hierarchy in cloud

AU - Lin, Changlu

AU - Luo, Fucai

AU - Wang, Huaxiong

AU - Zhu, Yan

PY - 2016

Y1 - 2016

N2 - In recent years, numerous provable data possession (PDP) schemes have been proposed for checking the availability and integrity of data stored on cloud storage server (CSS) which is not fully trusted. However, these schemes do not work with specific subsets of verifiers, and they do not efficiently support dynamic enrollment and revocation of verifiers. In this paper, we propose a novel provable data possession scheme under hierarchical data framework in cloud environment. Our scheme can be considered as a generalization of privately verifiable PDP schemes. Specifically, data of different values are integrated into a data hierarchy, and clients are classified and authorized different access permissions according to their amounts of payment. Furthermore, our scheme allows the data owner to efficiently enroll and revoke clients. The scheme satisfies existential unforgeability against malicious CSS based on the hardness of the computational Diffie-Hellman problem.

AB - In recent years, numerous provable data possession (PDP) schemes have been proposed for checking the availability and integrity of data stored on cloud storage server (CSS) which is not fully trusted. However, these schemes do not work with specific subsets of verifiers, and they do not efficiently support dynamic enrollment and revocation of verifiers. In this paper, we propose a novel provable data possession scheme under hierarchical data framework in cloud environment. Our scheme can be considered as a generalization of privately verifiable PDP schemes. Specifically, data of different values are integrated into a data hierarchy, and clients are classified and authorized different access permissions according to their amounts of payment. Furthermore, our scheme allows the data owner to efficiently enroll and revoke clients. The scheme satisfies existential unforgeability against malicious CSS based on the hardness of the computational Diffie-Hellman problem.

KW - Cloud storage server

KW - Computational Diffie-Hellman assumption

KW - Data hierarchy

KW - Provable data possession

UR - http://www.scopus.com/inward/record.url?scp=84969249032&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-38898-4_18

DO - 10.1007/978-3-319-38898-4_18

M3 - Conference proceeding contribution

AN - SCOPUS:84969249032

SN - 9783319388977

T3 - Lecture Notes in Computer Science

SP - 301

EP - 321

BT - Information security and cryptology

A2 - Lin, Dongdai

A2 - Wang, XiaoFeng

A2 - Yung, Moti

PB - Springer, Springer Nature

CY - Cham

T2 - 11th International Conference on Information Security and Cryptology, Inscrypt 2015

Y2 - 1 November 2015 through 3 November 2015

ER -

Lin C, Luo F, Wang H, Zhu Y. A Provable data possession scheme with data hierarchy in cloud. In Lin D, Wang X, Yung M, editors, Information security and cryptology: 11th International Conference, Inscrypt 2015, Beijing, China, November 1-3, 2015 ; proceedings. Cham: Springer, Springer Nature. 2016. p. 301-321. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-38898-4_18

A Provable data possession scheme with data hierarchy in cloud

Abstract

Publication series

Other

Keywords

Access to Document

Other files and links

Fingerprint

Cite this