{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T08:06:50Z","timestamp":1759565210476,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031209734"},{"type":"electronic","value":"9783031209741"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20974-1_19","type":"book-chapter","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T08:06:38Z","timestamp":1668067598000},"page":"361-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Proofs of\u00a0Retrievability Using Expander Codes"],"prefix":"10.1007","author":[{"given":"Fran\u00e7oise","family":"Levy-dit-Vehel","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Rom\u00e9as","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,10]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Maurer, U.: Composable and robust outsourced storage. In: Proceedings of Topics in Cryptology - CT-RSA 2018 - The Cryptographers\u2019 Track at the RSA Conference 2018, San Francisco, CA, USA, 16\u201320 April 2018, pp. 354\u2013373 (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_19","DOI":"10.1007\/978-3-319-76953-0_19"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Beelen, P., H\u00f8holdt, T., Pi\u00f1ero, F., Justesen, J.: On the dimension of graph codes with reed-Solomon component codes. In: 2013 IEEE International Symposium on Information Theory, pp. 1227\u20131231 (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620422","DOI":"10.1109\/ISIT.2013.6620422"},{"key":"19_CR3","doi-asserted-by":"publisher","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, pp. 43\u201354. CCSW 2009, ACM, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1655008.1655015","DOI":"10.1145\/1655008.1655015"},{"key":"19_CR4","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. 5444, pp. 109\u2013127. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_8"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Guo, A., Kopparty, S., Sudan, M.: New affine-invariant codes from lifting. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS 2013, pp. 529\u2013540. ACM, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2422436.2422494","DOI":"10.1145\/2422436.2422494"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"H\u00f8holdt, T., Justesen, J.: Graph codes with reed-Solomon component codes. In: 2006 IEEE International Symposium on Information Theory, pp. 2022\u20132026 (2006). https:\/\/doi.org\/10.1109\/ISIT.2006.261904","DOI":"10.1109\/ISIT.2006.261904"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-20901-7_12","volume-title":"Coding and Cryptology","author":"T H\u00f8holdt","year":"2011","unstructured":"H\u00f8holdt, T., Justesen, J.: The minimum distance of graph codes. In: Chee, Y.M., et al. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 201\u2013212. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_12"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Juels, A., Kaliski, Jr., B.S.: PORs: proofs of retrievability for large files. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS 2007, pp. 584\u2013597. ACM, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1315245.1315317","DOI":"10.1145\/1315245.1315317"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Lavauzelle, J., Levy-Dit-Vehel, F.: New proofs of retrievability using locally decodable codes. In: International Symposium on Information Theory ISIT 2016, pp. 1809\u20131813. Barcelona, Spain (2016). https:\/\/doi.org\/10.1109\/ISIT.2016.7541611","DOI":"10.1109\/ISIT.2016.7541611"},{"key":"19_CR10","unstructured":"Levy-Dit-Vehel, F., Rom\u00e9as, M.: A framework for the design of secure and efficient proofs of retrievability. Cryptology ePrint Archive, report 2022\/064 (2022). https:\/\/ia.cr\/2022\/064"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27375-9_3","volume-title":"Theory of Security and Applications","author":"U Maurer","year":"2012","unstructured":"Maurer, U.: Constructive cryptography \u2013 a new paradigm for security definitions and proofs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 33\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27375-9_3"},{"key":"19_CR12","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: In Innovations In Computer Science. Tsinghua University Press (2011)"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Paterson, M., Stinson, D., Upadhyay, J.: A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. J. Math. Cryptol. 7(3), 183\u2013216 (2013). https:\/\/doi.org\/10.1515\/jmc-2013-5002","DOI":"10.1515\/jmc-2013-5002"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Ron-Zewi, N., Wootters, M., Z\u00e9mor, G.: Linear-time erasure list-decoding of expander codes. In: 2020 IEEE International Symposium on Information Theory (ISIT), pp. 379\u2013383 (2020). https:\/\/doi.org\/10.1109\/ISIT44484.2020.9174325","DOI":"10.1109\/ISIT44484.2020.9174325"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Shacham, H., Waters, B.: Compact Proofs of Retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90\u2013107. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_7","DOI":"10.1007\/978-3-540-89255-7_7"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.: Expander codes. IEEE Trans. Inf. Theory 42(6), 1710\u20131722 (1996). https:\/\/doi.org\/10.1109\/18.556667","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/LCOMM.2020.2965453","volume":"24","author":"N Tang","year":"2020","unstructured":"Tang, N., Lin, Y.: Fast encoding and decoding algorithms for arbitrary $$(n, k)$$ Reed-Solomon codes over $$\\mathbb{F} _{2^m}$$. IEEE Commun. Lett. 24(4), 716\u2013719 (2020). https:\/\/doi.org\/10.1109\/LCOMM.2020.2965453","journal-title":"IEEE Commun. Lett."},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Tanner, R.M.: Explicit concentrators from generalized n-gons. SIAM Journal on Algebraic Discrete Methods 5(3), 287\u2013293 (1984). https:\/\/doi.org\/10.1137\/0605030","DOI":"10.1137\/0605030"},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/18.910593","volume":"47","author":"G Z\u00e9mor","year":"2001","unstructured":"Z\u00e9mor, G.: On expander codes. IEEE Trans. Inf. Theory 47(2), 835\u2013837 (2001). https:\/\/doi.org\/10.1109\/18.910593","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20974-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:04:42Z","timestamp":1672344282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20974-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031209734","9783031209741"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20974-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cans2022.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}