{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:29:58Z","timestamp":1768314598103,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031171420","type":"print"},{"value":"9783031171437","type":"electronic"}],"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-17143-7_27","type":"book-chapter","created":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T04:04:22Z","timestamp":1663905862000},"page":"554-573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Hash-Based Redactable Signature for\u00a0Smart Grid Applications"],"prefix":"10.1007","author":[{"given":"Fei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xun","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alsharif","family":"Abuadbba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junwei","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Surya","family":"Nepal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,24]]},"reference":[{"issue":"6","key":"27_CR1","doi-asserted-by":"publisher","first-page":"9722","DOI":"10.1109\/JIOT.2019.2930742","volume":"6","author":"E Ahene","year":"2019","unstructured":"Ahene, E., Qin, Z., Adusei, A.K., Li, F.: Efficient signcryption with proxy re-encryption and its application in smart grid. IEEE Internet Things J. 6(6), 9722\u20139737 (2019)","journal-title":"IEEE Internet Things J."},{"key":"27_CR2","unstructured":"Bernstein, D.J., et al.: SPHINCS+, submission to the NIST post-quantum project, vol. 3 (2020). www.sphincs.org\/data\/sphincs+-round3-specification.pdf"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-46800-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"D Bernstein","year":"2015","unstructured":"Bernstein, D., et al.: SPHINCS: practical stateless hash-based signatures. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 368\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_15"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Rosen, A.: Pseudorandom functions: three decades later. IACR Cryptol. ePrint Arch. 2017, 652 (2017)","DOI":"10.1007\/978-3-319-57048-8_3"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcrstinghaus-Steinbach, K., Krau\u00df, C., Niederhagen, R., Schneider, M.: Post-quantum TLS on embedded systems: integrating and evaluating kyber and SPHINCS+ with mbed TLS. In: ASIA CCS 2020, Taipei, Taiwan, 5\u20139 Oct 2020, pp. 841\u2013852. ACM (2020)","DOI":"10.1145\/3320269.3384725"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-662-48800-3_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"J Camenisch","year":"2015","unstructured":"Camenisch, J., Dubovitskaya, M., Haralambiev, K., Kohlweiss, M.: Composable and modular anonymous credentials: definitions and practical constructions. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 262\u2013288. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_11"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-00862-7_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"E-C Chang","year":"2009","unstructured":"Chang, E.-C., Lim, C.L., Xu, J.: Short redactable signatures using random trees. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 133\u2013147. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_9"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-79063-3_9","volume-title":"Post-Quantum Cryptography","author":"J Czajkowski","year":"2018","unstructured":"Czajkowski, J., Groot Bruinderink, L., H\u00fclsing, A., Schaffner, C., Unruh, D.: Post-quantum security of the sponge construction. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 185\u2013204. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_9"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30840-1_1","volume-title":"Information Security and Cryptology - ICISC 2015","author":"D Derler","year":"2016","unstructured":"Derler, D., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: A general framework for redactable signatures and new constructions. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 3\u201319. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_1"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Gennaro","year":"1999","unstructured":"Gennaro, R., Halevi, S., Rabin, T.: Secure hash-and-sign signatures without the random oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123\u2013139. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_9"},{"key":"27_CR11","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: FOCS 1984, West Palm Beach, Florida, USA, 24\u201326 Oct 1984, pp. 464\u2013479. IEEE (1984)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Gope, P., Sikdar, B.: An efficient privacy-preserving dynamic pricing-based billing scheme for smart grids. In: CNS 2018, Beijing, China, May 30 - June 1 2018. pp. 1\u20132. IEEE (2018)","DOI":"10.1109\/CNS.2018.8433191"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Haber, S., et al.: Efficient signature schemes supporting redaction, pseudonymization, and data deidentification. In: ASIACCS 2008, Tokyo, Japan, 18\u201320 Mar 2008, pp. 353\u2013362. ACM (2008)","DOI":"10.1145\/1368310.1368362"},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1109\/TC.2014.2315619","volume":"64","author":"X Huang","year":"2015","unstructured":"Huang, X., et al.: Cost-effective authentic and anonymous data sharing with forward security. IEEE Trans. Computers 64(4), 971\u2013983 (2015)","journal-title":"IEEE Trans. Computers"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Jeske, T.: Privacy-preserving smart metering without a trusted-third-party. In: SECRYPT 2011, Seville, Spain, 18\u201321 July 2011, pp. 114\u2013123 (2011)","DOI":"10.5220\/0003513001140123"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"R Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_17"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Kar, J.: Provably secure certificateless deniable authenticated encryption scheme. J. Inf. Secur. Appl. 54, 102581 (2020)","DOI":"10.1016\/j.jisa.2020.102581"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jpdc.2019.09.016","volume":"136","author":"W Kong","year":"2020","unstructured":"Kong, W., Shen, J., Vijayakumar, P., Cho, Y., Chang, V.: A practical group blind signature scheme for privacy protection in smart grid. J. Parallel Distributed Comput. 136, 29\u201339 (2020)","journal-title":"J. Parallel Distributed Comput."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Lahoti, G., Mashima, D., Chen, W.: Customer-centric energy usage data management and sharing in smart grid systems. In: SEGS2013, 8 Nov 2013, Berlin, Germany, pp. 53\u201364. ACM (2013)","DOI":"10.1145\/2516930.2516935"},{"issue":"3","key":"27_CR20","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1109\/TNET.2021.3062766","volume":"29","author":"T Limbasiya","year":"2021","unstructured":"Limbasiya, T., Das, D., Das, S.K.: Mcomiov: secure and energy-efficient message communication protocols for internet of vehicles. IEEE\/ACM Trans. Netw. 29(3), 1349\u20131361 (2021)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Liu, J., Hou, J., Huang, X., Xiang, Y., Zhu, T.: Secure and efficient sharing of authenticated energy usage data with privacy preservation. Comput. Secur. 92, 101756 (2020)","DOI":"10.1016\/j.cose.2020.101756"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"McCallister, E., Grance, T., Scarfone, K.: Guide to protecting the confidentiality of personally identifiable information (PII), SP 800\u2013122. In: NIST (2010)","DOI":"10.6028\/NIST.SP.800-122"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44750-4_15","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"S Micali","year":"1995","unstructured":"Micali, S., Sidney, R.: A simple method for generating and sharing pseudo-random functions, with applications to clipper-like key escrow systems. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 185\u2013196. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_15"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Miyazaki, K., Hanaoka, G., Imai, H.: Digitally signed document sanitizing scheme based on bilinear maps. In: ASIACCS 2006, Taipei, Taiwan, 21\u201324 Mar 2006, pp. 343\u2013354. ACM (2006)","DOI":"10.1145\/1128817.1128868"},{"key":"27_CR25","unstructured":"NIST: Report on post-quantum cryptography (2016). www.dx.doi.org\/10.6028\/NIST.IR.8105"},{"key":"27_CR26","unstructured":"NIST: Recommendation for stateful hash-based signature schemes (2020). www.doi.org\/10.6028\/NIST.SP.800-208"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-04474-8_26","volume-title":"Information Security","author":"R Nojima","year":"2009","unstructured":"Nojima, R., Tamura, J., Kadobayashi, Y., Kikuchi, H.: A storage efficient redactable signature in the standard model. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 326\u2013337. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04474-8_26"},{"key":"27_CR28","unstructured":"PG &E: PG &E smart grid annual report 2020 (2020). www.pge.com\/pge_global\/common\/pdfs\/safety\/how-the-system-works\/electric-systems\/smart-grid\/AnnualReport2020.pdf"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-319-07536-5_27","volume-title":"Applied Cryptography and Network Security","author":"HC P\u00f6hls","year":"2014","unstructured":"P\u00f6hls, H.C., Samelin, K.: On updatable redactable signatures. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 457\u2013475. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_27"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"P\u00f6hls, H.C., Samelin, K.: Accountable redactable signatures. In: ARES 2015, Toulouse, France, 24\u201327 Aug 2015, pp. 60\u201369. IEEE (2015)","DOI":"10.1109\/ARES.2015.10"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-030-45388-6_22","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"O Sanders","year":"2020","unstructured":"Sanders, O.: Efficient redactable signature and application to anonymous credentials. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 628\u2013656. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_22"},{"issue":"5","key":"27_CR32","doi-asserted-by":"publisher","first-page":"4323","DOI":"10.1109\/TSG.2017.2655014","volume":"9","author":"N Saxena","year":"2018","unstructured":"Saxena, N., Grijalva, S.: Efficient signature scheme for delivering authentic control commands in the smart grid. IEEE Trans. Smart Grid 9(5), 4323\u20134334 (2018)","journal-title":"IEEE Trans. Smart Grid"},{"key":"27_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45861-1_22","volume-title":"Information Security and Cryptology \u2014 ICISC 2001","author":"R Steinfeld","year":"2002","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 285\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45861-1_22"},{"issue":"1","key":"27_CR34","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/JSAC.2019.2951965","volume":"38","author":"Z Sui","year":"2020","unstructured":"Sui, Z., de Meer, H.: An efficient signcryption protocol for hop-by-hop data aggregations in smart grids. IEEE J. Sel. Areas Commun. 38(1), 132\u2013140 (2020)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"27_CR35","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.cose.2019.03.014","volume":"84","author":"S Sultan","year":"2019","unstructured":"Sultan, S.: Privacy-preserving metering in smart grid for billing, operational metering, and incentive-based schemes: a survey. Comput. Secur. 84, 148\u2013165 (2019)","journal-title":"Comput. Secur."},{"key":"27_CR36","doi-asserted-by":"crossref","unstructured":"Tang, F., Pang, J., Cheng, K., Gong, Q.: Multiauthority traceable ring signature scheme for smart grid based on blockchain. Wirel. Commun. Mob. Comput. 2021, 1\u20139 (2021)","DOI":"10.1155\/2021\/5566430"},{"issue":"9","key":"27_CR37","doi-asserted-by":"publisher","first-page":"6855","DOI":"10.1109\/JIOT.2021.3113469","volume":"9","author":"M Tanveer","year":"2022","unstructured":"Tanveer, M., Khan, A.U., Kumar, N., Naushad, A., Chaudhry, S.A.: A robust access control protocol for the smart grid systems. IEEE Internet Things J. 9(9), 6855\u20136865 (2022)","journal-title":"IEEE Internet Things J."},{"key":"27_CR38","unstructured":"Union, E.: The EU general data protection regulation (GDPR) (2018). www.eugdpr.org"},{"key":"27_CR39","unstructured":"X, E.: Enernoc, global leader in smart energy management (2017). www.corporate.enelx.com\/en\/stories\/2017\/08\/enernoc-global-leader-in-smart-energy-management"},{"key":"27_CR40","unstructured":"Zhang, K., Cui, H., Yu, Y.: SPHINCS-$$\\alpha $$: a compact stateless hash-based signature scheme. IACR Cryptol. ePrint Arch. 059 (2022)"},{"issue":"14","key":"27_CR41","doi-asserted-by":"publisher","first-page":"11678","DOI":"10.1109\/JIOT.2021.3059570","volume":"8","author":"F Zhu","year":"2021","unstructured":"Zhu, F., Yi, X., Abuadbba, A., Khalil, I., Nepal, S., Huang, X.: Cost-effective authenticated data redaction with privacy protection in iot. IEEE Internet Things J. 8(14), 11678\u201311689 (2021)","journal-title":"IEEE Internet Things J."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17143-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T13:05:57Z","timestamp":1728047157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17143-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171420","9783031171437"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17143-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2022.compute.dtu.dk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"562","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":"104","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":"6","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":"19% - 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.4","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":"12","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)"}}]}}