{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:11:30Z","timestamp":1771701090952,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,5,30]],"date-time":"2011-05-30T00:00:00Z","timestamp":1306713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s11432-011-4293-9","type":"journal-article","created":{"date-parts":[[2011,5,30]],"date-time":"2011-05-30T13:52:14Z","timestamp":1306763534000},"page":"1608-1617","source":"Crossref","is-referenced-by-count":28,"title":["Zero-knowledge proofs of retrievability"],"prefix":"10.1007","volume":"54","author":[{"given":"Yan","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HuaiXi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZeXing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gail-Joon","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HongXin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,30]]},"reference":[{"key":"4293_CR1","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1145\/1315245.1315317","volume-title":"Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007","author":"A. Juels","year":"2007","unstructured":"Juels A, Kaliski-Jr B S. Pors: Proofs of retrievability for large files. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007. Alexandria: ACM, 2007. 584\u2013597"},{"key":"4293_CR2","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1145\/1315245.1315318","volume-title":"Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007","author":"G. Ateniese","year":"2007","unstructured":"Ateniese G, Burns R C, Curtmola R, et al. Provable data possession at untrusted stores. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007. Alexandria: ACM, 2007. 598\u2013609"},{"key":"4293_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1655008.1655015","volume-title":"Proceedings of the 2009 ACM Workshop on Cloud Computing Security, CCSW 2009","author":"K. D. Bowers","year":"2009","unstructured":"Bowers K D, Juels A, Oprea A. Proofs of retrievability: Theory and implementation. In: Proceedings of the 2009 ACM Workshop on Cloud Computing Security, CCSW 2009. Chicago: ACM, 2009. 43\u201354"},{"key":"4293_CR4","series-title":"Lecture Notes in Computer Science","first-page":"109","volume-title":"Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009","author":"Y. Odis","year":"2009","unstructured":"Odis Y, Vadhan S P, Wichs D. Proofs of retrievability via hardness amplification. In: Reingold O, ed. Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009. Lecture Notes in Computer Science, vol. 5444. San Francisco: Springer-Verlag, 2009. 109\u2013127"},{"key":"4293_CR5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-642-04444-1_22","volume-title":"Proceedings of the 14th European Symposium on Research in Computer Security, ESORICS 2009","author":"Q. Wang","year":"2009","unstructured":"Wang Q, Wang C, Li J, et al. Enabling public verifiability and data dynamics for storage security in cloud computing. In: Proceedings of the 14th European Symposium on Research in Computer Security, ESORICS 2009. Saint-Malo: Springer-Verlag, 2009. 355\u2013370"},{"key":"4293_CR6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security","author":"H. Shacham","year":"2008","unstructured":"Shacham H, Waters B. Compact proofs of retrievability. In: Advances in Cryptology \u2014 ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security. Melbourne: Springer-Verlag, 2008. 90\u2013107"},{"key":"4293_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools. Volume Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich O. Foundations of Cryptography: Basic Tools. Volume Basic Tools. Cambridge: Cambridge University Press, 2001"},{"key":"4293_CR8","first-page":"213","volume-title":"Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009","author":"C. Christopher Erway","year":"2009","unstructured":"Christopher Erway C, K\u00fcp\u00fc A, Papamanthou C, et al. Dynamic provable data possession. In: Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009. Chicago: ACM, 2009. 213\u2013222"},{"key":"4293_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Proceedings of CRYPTO 2004, LNCS series","author":"D. Boneh","year":"2004","unstructured":"Boneh D, Boyen X, Shacham H. Short group signatures. In: Proceedings of CRYPTO 2004, LNCS series. Santa Barbara: Springer-Verlag, 2004. 41\u201355"},{"key":"4293_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/1653662.1653686","volume-title":"ACM Conference on Computer and Communications Security, CCS 2009","author":"K. D. Bowers","year":"2009","unstructured":"Bowers K D, Juels A, Oprea A. Hail: A high-availability and integrity layer for cloud storage. In: ACM Conference on Computer and Communications Security, CCS 2009. Chicago: ACM, 2009. 187\u2013198"},{"key":"4293_CR11","first-page":"213","volume-title":"Advances in Cryptology (CRYPTO\u20192001), vol. 2139 of LNCS","author":"D. Boneh","year":"2001","unstructured":"Boneh D, Franklin M. Identity-based encryption from the weil pairing. In: Advances in Cryptology (CRYPTO\u20192001), vol. 2139 of LNCS. Santa Barbara: Springer-Verlag, 2001. 213\u2013229"},{"key":"4293_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"Schnorr C P. Efficient signature generation by smart cards. J Cryptol, 1991, 4: 161\u2013174","journal-title":"J Cryptol"},{"key":"4293_CR13","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-540-46588-1_24","volume-title":"Public Key Cryptography","author":"R. Cramer","year":"2000","unstructured":"Cramer R, Damg\u00e5rd I D, MacKenzie P D. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Public Key Cryptography. Melbourne: Springer-Verlag, 2000. 354\u2013373"},{"key":"4293_CR14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P. S. L. M. Barreto","year":"2007","unstructured":"Barreto P S L M, Galbraith S D, O\u2019Eigeartaigh C, et al. Efficient pairing computation on supersingular abelian varieties. Des Codes Cryptogr, 2007, 42: 239\u2013271","journal-title":"Des Codes Cryptogr"},{"key":"4293_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-74735-2_17","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2007, 9th International Workshop","author":"J. L. Beuchat","year":"2007","unstructured":"Beuchat J L, Brisebarre N, Detrey J, et al. Arithmetic operators for pairing-based cryptography. In: Cryptographic Hardware and Embedded Systems \u2014 CHES 2007, 9th International Workshop. Vienna: Springer-Verlag, 2007. 239\u2013255"},{"key":"4293_CR16","doi-asserted-by":"crossref","first-page":"2598","DOI":"10.1109\/TIT.2007.899532","volume":"53","author":"H. G. Hu","year":"2007","unstructured":"Hu H G, Hu L, Feng D G. On a class of pseudorandom sequences from elliptic curves over finite fields. IEEE Trans Inf Theory, 2007, 53: 2598\u20132605","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4293-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4293-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4293-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T04:06:50Z","timestamp":1686110810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4293-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,30]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["4293"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4293-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,30]]}}}