{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,15]],"date-time":"2026-11-15T12:20:50Z","timestamp":1794745250514,"version":"4.9.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00145-012-9129-2","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T17:19:22Z","timestamp":1346519962000},"page":"442-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":361,"title":["Compact Proofs of Retrievability"],"prefix":"10.1007","volume":"26","author":[{"given":"Hovav","family":"Shacham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,1]]},"reference":[{"key":"9129_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05412-3","volume-title":"Proofs from the Book","author":"M. Aigner","year":"2004","unstructured":"M. Aigner, G. Ziegler, Proofs from the Book, 3rd edn. (Springer, Berlin, 2004)","edition":"3"},{"issue":"6","key":"9129_CR2","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1109\/18.556669","volume":"42","author":"N. Alon","year":"1996","unstructured":"N. Alon, M. Luby, A linear time erasure-resilient code with nearly optimal recovery. IEEE Trans. Inf. Theory\n                  42(6), 1732\u20131736 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9129_CR3","doi-asserted-by":"crossref","unstructured":"G. Ateniese, R. Burns, R. Curtmola, J. Herring, O. Khan, L. Kissner, Z. Peterson, D. Song, Remote data checking using provable data possession. ACM Trans. Inf. Syst. Security\n                  14(1) (2011)","DOI":"10.1145\/1952982.1952994"},{"key":"9129_CR4","first-page":"1","volume-title":"Proceedings of SecureComm 2008, ICST","author":"G. Ateniese","year":"2008","unstructured":"G. Ateniese, R. Di Pietro, L. Mancini, G. Tsudik, Scalable and efficient provable data possession, in Proceedings of SecureComm 2008, ICST, ed. by P.\u00a0Liu, R.\u00a0Molva (2008), pp. 1\u201310"},{"key":"9129_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-10366-7_19","volume-title":"Proceedings of Asiacrypt 2009","author":"G. Ateniese","year":"2009","unstructured":"G. Ateniese, S. Kamara, J. Katz, Proofs of storage from homomorphic identification protocols, in Proceedings of Asiacrypt 2009, ed. by M. Matsui. LNCS, vol. 5912 (Springer, Berlin, 2009), pp. 319\u2013333"},{"key":"9129_CR6","series-title":"LNCS","first-page":"319","volume-title":"Proceedings of SAC 2005","author":"P. Barreto","year":"2006","unstructured":"P. Barreto, M. Naehrig, Pairing-friendly elliptic curves of prime order, in Proceedings of SAC 2005, ed. by B. Preneel, S. Tavares. LNCS, vol. 3897 (Springer, Berlin, 2006), pp. 319\u2013331"},{"key":"9129_CR7","first-page":"394","volume-title":"Proceedings of FOCS 2007","author":"M. Bellare","year":"1997","unstructured":"M. Bellare, A. Desai, E. Jokipii, P. Rogaway, A\u00a0concrete security treatment of symmetric encryption, in Proceedings of FOCS 2007, ed. by A.R. Karlin (IEEE Computer Society, Los Alamitos, 1997), pp. 394\u2013403"},{"key":"9129_CR8","unstructured":"M. Bellare, O. Goldreich, A. Mityagin, The power of verification queries in message authentication and authenticated encryption. Cryptology ePrint Archive, Report 2004\/309, 2004. \n                    http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"9129_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing. J. Cryptol.\n                  17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"9129_CR10","first-page":"43","volume-title":"Proceedings of CCSW 2009","author":"K.D. Bowers","year":"2009","unstructured":"K.D. Bowers, A. Juels, A. Oprea, Proofs of retrievability: theory and implementation, in Proceedings of CCSW 2009, ed. by R.\u00a0Sion, D.\u00a0Song (ACM Press, New York, 2009), pp. 43\u201354"},{"key":"9129_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A\u00a0Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1993","unstructured":"H. Cohen, A\u00a0Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol.\u00a0138 (Springer, Berlin, 1993)"},{"issue":"3","key":"9129_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, V. Shoup, Signature schemes based on the strong RSA assumption. ACM Trans. Inf. Syst. Secur.\n                  3(3), 161\u2013185 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"1","key":"9129_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"R. Cramer, V. Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput.\n                  33(1), 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"9129_CR14","series-title":"IFIP","first-page":"1","volume-title":"Proceedings of IICIS 2003","author":"Y. Deswarte","year":"2004","unstructured":"Y. Deswarte, J.-J. Quisquater, A. Sa\u00efdane, Remote integrity checking, in Proceedings of IICIS 2003, ed. by S. Jajodia, L. Strous. IFIP, vol. 140 (Kluwer Academic, Dordrecht, 2004), pp. 1\u201311"},{"key":"9129_CR15","series-title":"LNCS","first-page":"109","volume-title":"Proceedings of TCC 2009","author":"Y. Dodis","year":"2009","unstructured":"Y. Dodis, S. Vadhan, D. Wichs, Proofs of retrievability via hardness amplification, in Proceedings of TCC 2009, ed. by O. Reingold. LNCS, vol. 5444 (Springer, Berlin, 2009), pp. 109\u2013127"},{"issue":"2","key":"9129_CR16","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"D. Freeman, M. Scott, E. Teske, A\u00a0taxonomy of pairing-friendly elliptic curves. J. Cryptol.\n                  23(2), 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"9129_CR17","unstructured":"D. Gazzoni Filho, P. Barreto, Demonstrating data possession and uncheatable data transfer. Cryptology ePrint Archive, Report 2006\/150, 2006. \n                    http:\/\/eprint.iacr.org\/"},{"key":"9129_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-22670-0_24","volume-title":"Studies in Complexity and Cryptography: Miscellanea on the Interplay Between Randomness and Computation","author":"O. Goldreich","year":"2011","unstructured":"O. Goldreich, A\u00a0sample of samplers: A\u00a0computational perspective on sampling, in Studies in Complexity and Cryptography: Miscellanea on the Interplay Between Randomness and Computation. LNCS, vol. 6650 (Springer, Berlin, 2011), pp. 302\u2013332"},{"key":"9129_CR19","series-title":"LNCS","first-page":"123","volume-title":"Proceedings of Eurocrypt 1988","author":"L. Guillou","year":"1988","unstructured":"L. Guillou, J.-J. Quisquater, A\u00a0practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory, in Proceedings of Eurocrypt 1988, ed. by C.\u00a0G\u00fcnther. LNCS, vol. 330 (Springer, Berlin, 1988), pp. 123\u2013128"},{"key":"9129_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32009-5_1","volume-title":"Proceedings of Crypto 2012","author":"V.T. Hoang","year":"2012","unstructured":"V.T. Hoang, B. Morris, P. Rogaway, An enciphering scheme based on a card shuffle, in Proceedings of Crypto 2012, ed. by R. Safavi-Naini. LNCS, vol.\u00a07417 (Springer, Berlin, 2012), pp. 1\u201313"},{"key":"9129_CR21","volume-title":"Proceedings of USENIX ATC 2012, USENIX","author":"C. Huang","year":"2012","unstructured":"C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, S. Yekhanin, Erasure coding in Windows Azure storage, in Proceedings of USENIX ATC 2012, USENIX, ed. by G. Heiser, W. Hsieh (2012)"},{"key":"9129_CR22","first-page":"584","volume-title":"Proceedings of CCS 2007","author":"A. Juels","year":"2007","unstructured":"A. Juels, B. Kaliski, PORs: Proofs of retrievability for large files, in Proceedings of CCS 2007, ed. by S. De Capitani\u00a0di\u00a0Vimercati, P. Syverson (ACM Press, New York, 2007), pp. 584\u2013597. Full version: \n                    http:\/\/www.rsa.com\/rsalabs\/node.asp?id=3357"},{"key":"9129_CR23","first-page":"29","volume-title":"Proceedings of USENIX Technical 2003, USENIX","author":"M. Lillibridge","year":"2003","unstructured":"M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, M. Isard, A cooperative Internet backup scheme, in Proceedings of USENIX Technical 2003, USENIX, ed. by B. Noble (2003), pp. 29\u201341."},{"issue":"3","key":"9129_CR24","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00145-010-9073-y","volume":"24","author":"M. Liskov","year":"2011","unstructured":"M. Liskov, R. Rivest, D. Wagner, Tweakable block ciphers. J. Cryptol.\n                  24(3), 588\u2013613 (2011)","journal-title":"J. Cryptol."},{"key":"9129_CR25","first-page":"271","volume-title":"Proceedings of ITW 2004","author":"M. Mitzenmacher","year":"2004","unstructured":"M. Mitzenmacher, Digital fountains: A\u00a0survey and look forward, in Proceedings of ITW 2004, ed. by R. Calderbank, A. Orlitsky (IEEE Information Theory Society, New York, 2004), pp. 271\u2013276."},{"key":"9129_CR26","doi-asserted-by":"crossref","unstructured":"M. Naor, G. Rothblum, The complexity of online memory checking. J.\u00a0ACM\n                  56(1) (2009)","DOI":"10.1145\/1462153.1462155"},{"issue":"2","key":"9129_CR27","first-page":"335","volume":"36","author":"M. Rabin","year":"1989","unstructured":"M. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance. J.\u00a0ACM\n                  36(2), 335\u2013348 (1989)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"9129_CR28","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/263876.263881","volume":"27","author":"L. Rizzo","year":"1997","unstructured":"L. Rizzo, Effective erasure codes for reliable computer communication protocols. ACM SIGCOMM Comput. Commun. Rev.\n                  27(2), 24\u201336 (1997)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"9129_CR29","volume-title":"Proceedings of ICDCS 2006","author":"T. Schwarz","year":"2006","unstructured":"T. Schwarz, E. Miller, Store, forget, and check: Using algebraic signatures to check remotely administered storage, in Proceedings of ICDCS 2006, ed. by M. Ahamad, L. Rodrigues (IEEE Computer Society, New York, 2006)"},{"key":"9129_CR30","volume-title":"Proceedings of HotOS 2007, USENIX","author":"M. Shah","year":"2007","unstructured":"M. Shah, M. Baker, J. Mogul, R. Swaminathan, Auditing to keep online storage services honest, in Proceedings of HotOS 2007, USENIX, ed. by G. Hunt (2007)"},{"key":"9129_CR31","unstructured":"M. Shah, R. Swaminathan, M. Baker, Privacy-preserving audit and extraction of digital contents. Cryptology ePrint Archive. Report 2008\/186, 2008. \n                    http:\/\/eprint.iacr.org\/"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9129-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-012-9129-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9129-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9129-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:08:50Z","timestamp":1586333330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-012-9129-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,1]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9129"],"URL":"https:\/\/doi.org\/10.1007\/s00145-012-9129-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,1]]},"assertion":[{"value":"30 November 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2012","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}