{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:25:52Z","timestamp":1745987152510,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371189"},{"type":"electronic","value":"9783642371196"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37119-6_2","type":"book-chapter","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T00:34:59Z","timestamp":1364344499000},"page":"18-32","source":"Crossref","is-referenced-by-count":2,"title":["Proofs of Retrievability via Fountain Code"],"prefix":"10.1007","author":[{"given":"Sumanta","family":"Sarkar","sequence":"first","affiliation":[]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Ateniese, G., Burns, R.C., Curtmola, R., Herring, J., Kissner, L., Peterson, Z.N.J., Song, D.X.: Provable data possession at untrusted stores. In: Ning, et al. (eds.) [9], pp. 598\u2013609","key":"2_CR1"},{"doi-asserted-by":"crossref","unstructured":"Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: theory and implementation. In: Sion, R., Song, D. (eds.) CCSW, pp. 43\u201354. ACM (2009)","key":"2_CR2","DOI":"10.1145\/1655008.1655015"},{"key":"2_CR3","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.\u00a05444, pp. 109\u2013127. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. PhD thesis, MIT Press, Cambridge, MA (1963)","key":"2_CR4","DOI":"10.7551\/mitpress\/4347.001.0001"},{"unstructured":"Juels, A., Kaliski Jr., B.S.: PORs: proofs of retrievability for large files. In: Ning, et al. (eds.) [9], pp. 584\u2013597","key":"2_CR5"},{"unstructured":"Luby, M.: LT codes. In: FOCS, p. 271. IEEE Computer Society (2002)","key":"2_CR6"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1049\/ip-com:20050237","volume":"152","author":"D.J.C. Mackay","year":"2005","unstructured":"Mackay, D.J.C.: Fountain codes. IEEE Communications\u00a0152, 1062\u20131068 (2005)","journal-title":"IEEE Communications"},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Rothblum, G.N.: The complexity of online memory checking. In: FOCS, pp. 573\u2013584. IEEE Computer Society (2005)","key":"2_CR8","DOI":"10.1109\/SFCS.2005.71"},{"unstructured":"Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.): Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31. ACM (2007)","key":"2_CR9"},{"key":"2_CR10","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.\u00a05350, pp. 90\u2013107. Springer, Heidelberg (2008)"},{"issue":"6","key":"2_CR11","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A. Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor codes. IEEE Transactions on Information Theory\u00a052(6), 2551\u20132567 (2006)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37119-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T02:13:07Z","timestamp":1745979187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37119-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371189","9783642371196"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37119-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}