{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:03:04Z","timestamp":1743091384109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319998060"},{"type":"electronic","value":"9783319998077"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99807-7_17","type":"book-chapter","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T09:44:46Z","timestamp":1536140686000},"page":"282-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Keyword-Based Delegable Proofs of Storage"],"prefix":"10.1007","author":[{"given":"Binanda","family":"Sengupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushmita","family":"Ruj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,6]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Bohli, J., Karame, G.O., Liu, Z., Reuter, C.A.: Outsourced proofs of retrievability. In: ACM Conference on Computer and Communications Security, CCS, pp. 831\u2013843 (2014)","DOI":"10.1145\/2660267.2660310"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., et al.: Provable data possession at untrusted stores. In: ACM Conference on Computer and Communications Security, CCS, pp. 598\u2013609 (2007)","DOI":"10.1145\/1315245.1315318"},{"key":"17_CR3","unstructured":"Back, A.: Hashcash - a denial of service counter-measure, August 2002. http:\/\/www.hashcash.org\/papers\/hashcash.pdf"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, CCS, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: theory and implementation. In: ACM Cloud Computing Security Workshop, CCSW, pp. 43\u201354 (2009)","DOI":"10.1145\/1655008.1655015"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: Network and Distributed System Security Symposium, NDSS (2014). http:\/\/www.internetsociety.org\/doc\/dynamic-searchable-encryption-very-large-databases-data-structures-and-implementation","DOI":"10.14722\/ndss.2014.23264"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-38348-9_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D Cash","year":"2013","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic proofs of retrievability via oblivious RAM. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 279\u2013295. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_17"},{"issue":"8","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1093\/ietisy\/e88-d.8.1852","volume":"E88-D","author":"H.-C. CHANG","year":"2005","unstructured":"Chang, H., Hsu, C.: Using topic keyword clusters for automatic document clustering. IEICE Trans. 88-D(8), 1852\u20131860 (2005)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: ACM Conference on Computer and Communications Security, CCS, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-00457-5_8","volume-title":"Theory of Cryptography","author":"Yevgeniy Dodis","year":"2009","unstructured":"Dodis, Y., Vadhan, S.P., Wichs, D.: Proofs of retrievability via hardness amplification. In: Theory of Cryptography Conference, TCC, pp. 109\u2013127 (2009)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Erway, C.C., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: ACM Conference on Computer and Communications Security, CCS, pp. 213\u2013222 (2009)","DOI":"10.1145\/1653662.1653688"},{"issue":"16","key":"17_CR13","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discret. Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discret. Appl. Math."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-319-72359-4_29","volume-title":"Information Security Practice and Experience","author":"Cl\u00e9mentine Gritti","year":"2017","unstructured":"Gritti, C., Chen, R., Susilo, W., Plantard, T.: Dynamic provable data possession protocols with public verifiability and data privacy. In: International Conference on Information Security Practice and Experience, ISPEC, pp. 485\u2013505 (2017)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Juels, A., Kaliski, B.S.: PORs: Proofs of retrievability for large files. In: ACM Conference on Computer and Communications Security, CCS, pp. 584\u2013597 (2007)","DOI":"10.1145\/1315245.1315317"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Kang, S.: Keyword-based document clustering. In: International Workshop on Information Retrieval with Asian Languages, IRAL, pp. 132\u2013137 (2003)","DOI":"10.3115\/1118935.1118952"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13\u201336. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_2"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Miller, A., Juels, A., Shi, E., Parno, B., Katz, J.: Permacoin: repurposing bitcoin work for data preservation. In: IEEE Symposium on Security and Privacy, S&P, pp. 475\u2013490 (2014)","DOI":"10.1109\/SP.2014.37"},{"key":"17_CR20","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). http:\/\/bitcoin.org\/bitcoin.pdf"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Sengupta, B., Bag, S., Ruj, S., Sakurai, K.: Retricoin: bitcoin based on compact proofs of retrievability. In: International Conference on Distributed Computing and Networking, ICDCN, pp. 14:1\u201314:10 (2016)","DOI":"10.1145\/2833312.2833317"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Sengupta, B., Ruj, S.: Publicly verifiable secure cloud storage for dynamic data using secure network coding. In: ACM Asia Conference on Computer and Communications Security, ASIACCS, pp. 107\u2013118 (2016)","DOI":"10.1145\/2897845.2897915"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Sengupta, B., Ruj, S.: Efficient proofs of retrievability with public verifiability for dynamic cloud storage. IEEE Trans. Cloud Comput. PP(99) (2017). https:\/\/doi.org\/10.1109\/TCC.2017.2767584","DOI":"10.1109\/TCC.2017.2767584"},{"issue":"3","key":"17_CR25","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00145-012-9129-2","volume":"26","author":"H Shacham","year":"2013","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. J. Cryptol. 26(3), 442\u2013483 (2013)","journal-title":"J. Cryptol."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Shi, E., Stefanov, E., Papamanthou, C.: Practical dynamic proofs of retrievability. In: ACM Conference on Computer and Communications Security, CCS, pp. 325\u2013336 (2013)","DOI":"10.1145\/2508859.2516669"},{"key":"17_CR27","unstructured":"Tao, J.J.: Hybrid and iterative keyword and category search technique. US Patent 8667007 B2, March 2014. https:\/\/www.google.com\/patents\/US8667007"},{"key":"17_CR28","unstructured":"Tao, J.J.: Semantic context based keyword search techniques. US Patent 9589050 B2, March 2017. https:\/\/www.google.com\/patents\/US9589050"},{"issue":"2","key":"17_CR29","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2011.245","volume":"62","author":"C Wang","year":"2013","unstructured":"Wang, C., Chow, S.S.M., Wang, Q., Ren, K., Lou, W.: Privacy-preserving public auditing for secure cloud storage. IEEE Trans. Comput. 62(2), 362\u2013375 (2013)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"17_CR30","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1109\/TPDS.2010.183","volume":"22","author":"Q Wang","year":"2011","unstructured":"Wang, Q., Wang, C., Ren, K., Lou, W., Li, J.: Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans. Parallel Distrib. Syst. 22(5), 847\u2013859 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99807-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T14:08:13Z","timestamp":1571839693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99807-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319998060","9783319998077"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99807-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISPEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Practice and Experience","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.risk.tsukuba.ac.jp\/ispec2018\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34% - 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"}},{"value":"3.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2 invited papers were accepted for publication","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}