{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:26:07Z","timestamp":1738819567882,"version":"3.37.0"},"reference-count":14,"publisher":"Academy Publisher","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.8.2.339-344","type":"journal-article","created":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T13:18:03Z","timestamp":1362403083000},"source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Proof of Retrievability Scheme for Fully Homomorphic Encrypted Data"],"prefix":"10.4304","volume":"8","author":[{"given":"Guang","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhu","family":"Yue-Fei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gu","family":"Chun-Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Yong-Hui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Jin-long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2838","published-online":{"date-parts":[[2013,2,1]]},"reference":[{"key":"ref1","first-page":"90","article-title":"Compact proofs of retrievability.","volume-title":"Proceeding of 14th International Conference on the Theory and Application of Cryptology and Information Security","author":"Shacham","year":"2008","unstructured":"[5] Shacham H, Waters B. Compact proofs of retrievability. In Proceeding of 14th International Conference on the Theory and Application of Cryptology and Information Security. Melbourne: Springer-Verlag, 2008. 90-107."},{"key":"ref2","first-page":"850","article-title":"Homomorphic Evaluation of the AES Circuit.","volume-title":"Proceeding of CRYPTO","author":"Gentry","year":"2012","unstructured":"[14] Craig Gentry, Shai Halevi, Nigel P. Smart: Homomorphic Evaluation of the AES Circuit. In Proceeding of CRYPTO 2012. 850-867"},{"key":"ref2","unstructured":"[1] 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. Alexandria: ACM, 2007. 584-597"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[2] Ateniese G, Burns R C, Curtmola R, et al. Provable data possession at untrusted stores. In Proceedings of the 2007ACM Conference on Computer and Communications Security. Alexandria: ACM, 2007. 598-609.","DOI":"10.1145\/1315245.1315318"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[3] Erway .C, Kupcu. A, Papamanthou. C, et al. Dynamic Provable Data Possession. In Proceedings of the 16th ACM conference on Computer and communications security: November 13, 2009, Chicago, IL, USA. NY, USA, ACM Press, 2009: 213-222.","DOI":"10.1145\/1653662.1653688"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[4] 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. Saint-Malo: Springer-Verlag, 2009. 355-370.","DOI":"10.1007\/978-3-642-04444-1_22"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[6] Craig Gentry. Fully homomorphic encryption using ideal lattices. In Proceeding of STOC09, pages 169-178, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[7] Odis Y, Vadhan S P, Wichs D. Proofs of retrievability via hardness amplification. In Proceeding of Theory of Cryptography, 6th Theory of Cryptography Conference. San Francisco: Springer-Verlag, 2009. 109\u2013127","DOI":"10.1007\/978-3-642-00457-5_8"},{"key":"ref2","unstructured":"[8] Bowers K D, Juels A, Oprea A. Hail: A high-availability and integrity layer for cloud storage. In Proceeding of ACM Conference on Computer and Communications Security. Chicago: ACM, 2009. 187\u2013198"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[9] Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Mengyang Yu and Shimin Chen. Cooperative provable data possession for integrity verification in multi-cloud storage. In IEEE Transactions on Parallel and Distributed Systems (TPDS), No. 99, February, 2012.","DOI":"10.1109\/TPDS.2012.66"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[10] M. Van Dijk, C. Gentry, S. Halevi, and V. aikuntanathan, Fully homomorphic encryption over the integers,. In Proceedings of Advances in Cryptology. EUROCRYPT 2010. 24-43, 2010.","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[11] Z. Brakerski, C. Gentry, and V. Vaikuntanathan, .Fully homomorphic encryption without bootstrapping. In novations in Theoretical Computer Science, 2012.","DOI":"10.1145\/2090236.2090262"},{"key":"ref2","unstructured":"[12] A. Bogdanov and C. Lee. Homomorphic encryption from codes. In Arxiv preprint arXiv:1111.4301, 2011."},{"key":"ref2","unstructured":"[13] V. Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332, 2004."}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:14:38Z","timestamp":1738775678000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,1]]},"references-count":14,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,2,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.8.2.339-344","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2013,2,1]]}}}