{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:57:40Z","timestamp":1742968660451,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388977"},{"type":"electronic","value":"9783319388984"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38898-4_17","type":"book-chapter","created":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T07:44:40Z","timestamp":1462520680000},"page":"283-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Proxy Provable Data Possession with General Access Structure in Public Clouds"],"prefix":"10.1007","author":[{"given":"Huaqun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Debiao","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,7]]},"reference":[{"key":"17_CR1","first-page":"598","volume-title":"CCS 2007","author":"G Ateniese","year":"2007","unstructured":"Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: Capitani, D., di Vimercati, S., Syverson, P. (eds.) CCS 2007, pp. 598\u2013609. ACM, New York (2007)"},{"key":"17_CR2","first-page":"9:1","volume-title":"SecureComm 2008","author":"G Ateniese","year":"2008","unstructured":"Ateniese, G., Di Pietro, R., Mancini, L.V., Tsudik, G.: Scalable and efficient provable data possession. In: Liu, P., Molva, R. (eds.) SecureComm 2008, pp. 9:1\u20139:10. ACM, New York (2008)"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699909","volume":"17","author":"CC Erway","year":"2015","unstructured":"Erway, C.C., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. ACM Trans. Inf. Syst. Secur. 17(4), 1\u201329 (2015). 15","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"8","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/TKDE.2007.190647","volume":"20","author":"F Seb\u00e9","year":"2008","unstructured":"Seb\u00e9, F., Domingo-Ferrer, J., Martinez-Balleste, A., Deswarte, Y., Quisquater, J.J.: Efficient remote data possession checking in critical information infrastructures. IEEE Trans. Knowl. Data Eng. 20(8), 1034\u20131038 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TSC.2012.35","volume":"6","author":"H Wang","year":"2013","unstructured":"Wang, H.: Proxy provable data possession in public clouds. IEEE Trans. Serv. Comput. 6(4), 551\u2013559 (2013)","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1049\/iet-ifs.2012.0271","volume":"8","author":"H Wang","year":"2014","unstructured":"Wang, H., Wu, Q., Qin, B., Domingo-Ferrer, J.: Identity-based remote data possession checking in public clouds. IET Inf. Secur. 8(2), 114\u2013121 (2014)","journal-title":"IET Inf. Secur."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TSC.2014.1","volume":"8","author":"H Wang","year":"2015","unstructured":"Wang, H.: Identity-based distributed provable data possession in multicloud storage. IEEE Trans. Serv. Comput. 8(2), 328\u2013340 (2015)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Khan, O., Burns, R., Ateniese, G.: MR-PDP: multiple-replica provable data possession. In: ICDCS 2008, pp. 411\u2013420. IEEE Press (2008)","DOI":"10.1109\/ICDCS.2008.68"},{"key":"17_CR9","unstructured":"Barsoum, A.F., Hasan, M.A.: Provable possession and replication of data over cloud servers (2010). \n                      http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2010\/cacr2010-32.pdf"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Hao, Z., Yu, N.: A multiple-replica remote data possession checking protocol with public verifiability. In: ISDPE 2010, pp. 84\u201389. IEEE Press (2010)","DOI":"10.1109\/ISDPE.2010.20"},{"key":"17_CR11","unstructured":"Barsoum, A.F., Hasan, M.A.: On Verifying Dynamic Multiple Data Copies over Cloud Servers(2011). \n                      http:\/\/eprint.iacr.org\/2011\/447.pdf"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Juels, A., Kaliski Jr., B.S.: PORs: Proofs of retrievability for large files. In: ACM CCS 2007, pp. 584\u2013597. ACM, New York (2007)","DOI":"10.1145\/1315245.1315317"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H Shacham","year":"2008","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90\u2013107. Springer, Heidelberg (2008)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1049\/iet-ifs.2013.0376","volume":"9","author":"H Wang","year":"2014","unstructured":"Wang, H.: Anonymous multi-receiver remote data retrieval for pay-TV in public clouds. IET Inf. Secur. 9(2), 108\u2013118 (2014)","journal-title":"IET Inf. Secur."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.jbi.2014.02.008","volume":"50","author":"H Wang","year":"2014","unstructured":"Wang, H., Wu, Q., Qin, B., Domingo-Ferrer, J.: FRR: fair remote retrieval of outsourced private medical records in electronic health networks. J. Biomed. Inform. 50, 226\u2013233 (2014)","journal-title":"J. Biomed. Inform."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: theory and implementation. In: ACM CCSW 2009, pp. 43\u201354. ACM, New York (2009)","DOI":"10.1145\/1655008.1655015"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Zheng, Q., Xu, S.: Fair and dynamic proofs of retrievability. In: CODASPY 2011, pp. 237\u2013248. ACM, New York (2011)","DOI":"10.1145\/1943513.1943546"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-00457-5_8","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109\u2013127. Springer, Heidelberg (2009)"},{"issue":"8","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1007\/s11432-011-4293-9","volume":"54","author":"Y Zhu","year":"2011","unstructured":"Zhu, Y., Wang, H., Hu, Z., Ahn, G.J., Hu, H.: Zero-knowledge proofs of retrievability. Sci. China Inf. Sci. 54(8), 1608\u20131617 (2011)","journal-title":"Sci. China Inf. Sci."},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"issue":"5","key":"17_CR21","first-page":"1234","volume":"84","author":"A Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundam. Electron. commun. comput. sci. 84(5), 1234\u20131243 (2001)","journal-title":"IEICE Trans. Fundam. Electron. commun. comput. sci."},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1090\/conm\/324\/05731","volume":"324","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Silverberg, A.: Applications of multilinear forms to cryptography. Contemp. Math. 324(1), 71\u201390 (2003)","journal-title":"Contemp. Math."},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/conm\/518\/10210","volume":"518","author":"MD Huang","year":"2010","unstructured":"Huang, M.D., Raskind, W.: A multilinear generalization of the tate pairing. Contemp. Math. 518, 255\u2013263 (2010)","journal-title":"Contemp. Math."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal latt-ices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013)"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-642-40041-4_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Hohenberger","year":"2013","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 494\u2013512. Springer, Heidelberg (2013)"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-642-40041-4_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"ESV Freire","year":"2013","unstructured":"Freire, E.S.V., Hofheinz, D., Paterson, K.G., Striecks, C.: Programmable hash functions in the multilinear setting. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 513\u2013530. Springer, Heidelberg (2013)"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013)"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-13013-7_28","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"A Bagherzandi","year":"2010","unstructured":"Bagherzandi, A., Jarecki, S.: Identity-based aggregate and multi-signature schemes based on RSA. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 480\u2013498. Springer, Heidelberg (2010)"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","first-page":"175","volume-title":"Information Security and Cryptology - ICISC 2001","author":"K Kawauchi","year":"2002","unstructured":"Kawauchi, K., Minato, H., Miyaji, A., Tada, M.: A multi-signature scheme with signers\u2019 intentions secure against active attacks. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 175\u2013196. Springer, Heidelberg (2002)"},{"key":"17_CR31","first-page":"479","volume-title":"Number Theory with Computer Applications","author":"R Kumanduri","year":"1998","unstructured":"Kumanduri, R., Romero, C.: Number Theory with Computer Applications, pp. 479\u2013508. Prentice Hall, New Jersey (1998)"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"issue":"7","key":"17_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/129902.129905","volume":"35","author":"RL Rivest","year":"1992","unstructured":"Rivest, R.L., Hellman, M.E., Anderson, J.C., Lyons, J.W.: Responses to NIST\u2019s proposal. Commun. ACM 35(7), 41\u201354 (1992)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38898-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T23:05:19Z","timestamp":1559430319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38898-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388977","9783319388984"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38898-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"7 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}