{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:48:23Z","timestamp":1729651703413,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/glocom.2013.6831485","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T22:05:38Z","timestamp":1403301938000},"page":"2717-2722","source":"Crossref","is-referenced-by-count":2,"title":["Proofs of data possession and pollution checking for Regenerating Codes"],"prefix":"10.1109","author":[{"given":"Juan Camilo","family":"Corena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoaki","family":"Ohtsuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","article-title":"Compact proofs of retrievability","volume":"5350","author":"shacham","year":"2008","journal-title":"Advances in Cryptology-ASIACRYPT 2008 Ser LNCS"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/TIT.2010.2054295"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1145\/62044.62050"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/INFCOM.2011.5934876"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1145\/1653662.1653686"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/SRDS.2012.24"},{"key":"5","first-page":"693","article-title":"Lt codes-based secure and reliable cloud storage service","author":"cao","year":"2012","journal-title":"IEEE INFOCOM"},{"key":"4","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1145\/1315245.1315318","article-title":"Provable data possession at untrusted stores","author":"ateniese","year":"2007","journal-title":"ACM CCS'07"},{"key":"9","first-page":"109","article-title":"Proofs of retrievability via hardness amplification","author":"dodis","year":"2009","journal-title":"Proc of TCC '09"},{"key":"8","article-title":"Auditing for network coding storage","author":"le","year":"2012","journal-title":"IEEE International Symposium on Network Coding (NetCod)"},{"key":"11","first-page":"783","article-title":"Coding constructions for blacklisting problems without computational assumptions","author":"kumar","year":"1999","journal-title":"Advances in Cryptology-CRYPTO ' 99 Ser LNCS"},{"key":"12","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-642-01957-9_18","article-title":"Homomorphic macs: Mac-based integrity for network coding","volume":"5536","author":"agrawal","year":"2009","journal-title":"Proc LNCS Applied Cryptography Net Security"}],"event":{"name":"2013 IEEE Global Communications Conference (GLOBECOM 2013)","start":{"date-parts":[[2013,12,9]]},"location":"Atlanta, GA","end":{"date-parts":[[2013,12,13]]}},"container-title":["2013 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6821297\/6831034\/06831485.pdf?arnumber=6831485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T11:20:17Z","timestamp":1498130417000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6831485\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/glocom.2013.6831485","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}