{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:58:54Z","timestamp":1783562334827,"version":"3.55.0"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T00:00:00Z","timestamp":1520812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["ICT-FP7-LEADS-318809"],"award-info":[{"award-number":["ICT-FP7-LEADS-318809"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"name":"a configurable real-time data-processing infrastructure mastering autonomous quality adaptation"},{"name":"NetApp faculty fellowship"},{"name":"Large-Scale Elastic Architecture for Data-as-a-Service","award":["ICT-FP7-QualiMaster-619525"],"award-info":[{"award-number":["ICT-FP7-QualiMaster-619525"]}]},{"name":"European Union\u2019 Horizon 2020 research and innovation programme","award":["732907 (MyHealthMyData)"],"award-info":[{"award-number":["732907 (MyHealthMyData)"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1526950, 1514261 and 1652259"],"award-info":[{"award-number":["1526950, 1514261 and 1652259"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2018,3,31]]},"abstract":"<jats:p>\n            We consider a data\n            <jats:italic>owner<\/jats:italic>\n            that outsources its dataset to an\n            <jats:italic>untrusted server<\/jats:italic>\n            . The owner wishes to enable the server to answer\n            <jats:italic>range<\/jats:italic>\n            queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on\n            <jats:italic>\u201cpractical\u201d<\/jats:italic>\n            private range search (mainly in database venues) that attempt to strike a trade-off between efficiency and security. Nevertheless, these methods either lack provable security guarantees or permit unacceptable privacy leakages. In this article, we take an\n            <jats:italic>interdisciplinary<\/jats:italic>\n            approach, which combines the rigor of security formulations and proofs with efficient data management techniques. We construct a wide set of novel schemes with realistic security\/performance trade-offs, adopting the notion of\n            <jats:italic>Searchable Symmetric Encryption<\/jats:italic>\n            (SSE), primarily proposed for keyword search. We reduce range search to\n            <jats:italic>multi-keyword<\/jats:italic>\n            search using\n            <jats:italic>range-covering<\/jats:italic>\n            techniques with tree-like indexes, and formalize the problem as\n            <jats:italic>Range Searchable Symmetric Encryption<\/jats:italic>\n            (RSSE). We demonstrate that, given\n            <jats:italic>any<\/jats:italic>\n            secure SSE scheme, the challenge boils down to (i) formulating leakages that arise from the index\n            <jats:italic>structure<\/jats:italic>\n            and (ii)\u00a0minimizing\n            <jats:italic>false positives<\/jats:italic>\n            incurred by some schemes under heavy data\n            <jats:italic>skew<\/jats:italic>\n            . We also explain an important concept in the recent SSE bibliography, namely\n            <jats:italic>locality<\/jats:italic>\n            , and design generic and specialized ways to attribute locality to our RSSE schemes. Moreover, we are the first to devise secure schemes for answering\n            <jats:italic>range aggregate<\/jats:italic>\n            queries, such as range sums and range min\/max. We analytically detail the superiority of our proposals over prior work and experimentally confirm their practicality.\n          <\/jats:p>","DOI":"10.1145\/3167971","type":"journal-article","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T12:49:54Z","timestamp":1520858994000},"page":"1-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Practical Private Range Search in Depth"],"prefix":"10.1145","volume":"43","author":[{"given":"Ioannis","family":"Demertzis","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stavros","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"TileDB Inc., Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Odysseas","family":"Papapetrou","sequence":"additional","affiliation":[{"name":"Epfl, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonios","family":"Deligiannakis","sequence":"additional","affiliation":[{"name":"Technical University of Crete, Chania, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minos","family":"Garofalakis","sequence":"additional","affiliation":[{"name":"ATHENA Research Center 8 Technical University of Crete, Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,3,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007632"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897562"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.08.001"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3088723.3088749"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Alexandra Boldyreva Nathan Chenette and Adam O\u2019Neill. 2011. Order-preserving encryption revisited: Improved security analysis and alternative solutions. In CRYPTO.   Alexandra Boldyreva Nathan Chenette and Adam O\u2019Neill. 2011. Order-preserving encryption revisited: Improved security analysis and alternative solutions. In CRYPTO.","DOI":"10.1007\/978-3-642-22792-9_33"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_19"},{"key":"e_1_2_1_9_1","volume-title":"Theory of Cryptography","author":"Boneh Dan","unstructured":"Dan Boneh and Brent Waters . 2007. Conjunctive , subset, and range queries on encrypted data . In Theory of Cryptography . Springer , 535--554. Dan Boneh and Brent Waters. 2007. Conjunctive, subset, and range queries on encrypted data. In Theory of Cryptography. Springer, 535--554."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978303"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"David Cash Joseph Jaeger Stanislaw Jarecki Charanjit Jutla Hugo Krawczyk M. Rosu and Michael Steiner. 2014. Dynamic searchable encryption in very-large databases: Data structures and implementation. In NDSS.  David Cash Joseph Jaeger Stanislaw Jarecki Charanjit Jutla Hugo Krawczyk M. Rosu and Michael Steiner. 2014. Dynamic searchable encryption in very-large databases: Data structures and implementation. In NDSS.","DOI":"10.14722\/ndss.2014.23264"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"David Cash Stanislaw Jarecki Charanjit Jutla Hugo Krawczyk Marcel-C\u0103t\u0103lin Ro\u015fu and Michael Steiner. 2013. Highly-scalable searchable symmetric encryption with support for boolean queries. In CRYPTO.  David Cash Stanislaw Jarecki Charanjit Jutla Hugo Krawczyk Marcel-C\u0103t\u0103lin Ro\u015fu and Michael Steiner. 2013. Highly-scalable searchable symmetric encryption with support for boolean queries. In CRYPTO.","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"David Cash and Stefano Tessaro. 2014. The locality of searchable symmetric encryption. In EUROCRYPT.  David Cash and Stefano Tessaro. 2014. The locality of searchable symmetric encryption. In EUROCRYPT.","DOI":"10.1007\/978-3-642-55220-5_20"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase and Seny Kamara. 2010. Structured encryption and controlled disclosure. In ASIACRYPT.  Melissa Chase and Seny Kamara. 2010. Structured encryption and controlled disclosure. In ASIACRYPT.","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52993-5_24"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Reza Curtmola Juan Garay Seny Kamara and Rafail Ostrovsky. 2011. Searchable symmetric encryption: Improved definitions and efficient constructions. J. Comput. Sec. (2011).   Reza Curtmola Juan Garay Seny Kamara and Rafail Ostrovsky. 2011. Searchable symmetric encryption: Improved definitions and efficient constructions. J. Comput. Sec. (2011).","DOI":"10.3233\/JCS-2011-0426"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452397"},{"key":"e_1_2_1_21_1","volume-title":"Searchable encryption with optimal locality: Achieving sublogarithmic read efficiency. arXiv Preprint","author":"Demertzis Ioannis","year":"2017","unstructured":"Ioannis Demertzis , Dimitrios Papadopoulos , and Charalampos Papamanthou . 2017. Searchable encryption with optimal locality: Achieving sublogarithmic read efficiency. arXiv Preprint ( 2017 ). Ioannis Demertzis, Dimitrios Papadopoulos, and Charalampos Papamanthou. 2017. Searchable encryption with optimal locality: Achieving sublogarithmic read efficiency. arXiv Preprint (2017)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882911"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064057"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Sky Faber Stanislaw Jarecki Hugo Krawczyk Quan Nguyen Marcel Rosu and Michael Steiner. 2015. Rich queries on encrypted data: Beyond exact matches. In ESORICS.  Sky Faber Stanislaw Jarecki Hugo Krawczyk Quan Nguyen Marcel Rosu and Michael Steiner. 2015. Rich queries on encrypted data: Beyond exact matches. In ESORICS.","DOI":"10.1007\/978-3-319-24177-7_7"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_5"},{"key":"e_1_2_1_26_1","volume-title":"HardIDX: Practical and secure index with SGX. arXiv Preprint","author":"Fuhry Benny","year":"2017","unstructured":"Benny Fuhry , Raad Bahmani , Ferdinand Brasser , Florian Hahn , Florian Kerschbaum , and Ahmad-Reza Sadeghi . 2017. HardIDX: Practical and secure index with SGX. arXiv Preprint ( 2017 ). Benny Fuhry, Raad Bahmani, Ferdinand Brasser, Florian Hahn, Florian Kerschbaum, and Ahmad-Reza Sadeghi. 2017. HardIDX: Practical and secure index with SGX. arXiv Preprint (2017)."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1666420.1666444"},{"key":"e_1_2_1_29_1","unstructured":"Eu-Jin Goh etal 2003. Secure indexes. IACR Cryptology ePrint Archive (2003).  Eu-Jin Goh et al. 2003. Secure indexes. IACR Cryptology ePrint Archive (2003)."},{"key":"e_1_2_1_30_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2006. Foundations of Cryptography , Vol. 1 . Cambridge University Press . Oded Goldreich. 2006. Foundations of Cryptography, Vol. 1. Cambridge University Press."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564717"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996429.2996437"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0245-7"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Bijit Hore Sharad Mehrotra and Gene Tsudik. 2004. A privacy-preserving index for range queries. In VLDB.   Bijit Hore Sharad Mehrotra and Gene Tsudik. 2004. A privacy-preserving index for range queries. In VLDB.","DOI":"10.1016\/B978-012088469-8.50064-4"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035948"},{"key":"e_1_2_1_38_1","unstructured":"Mohammad Saiful Islam Mehmet Kuzu and Murat Kantarcioglu. 2014. Inference attack against encrypted range queries on outsourced databases. In CODASPY.  Mohammad Saiful Islam Mehmet Kuzu and Murat Kantarcioglu. 2014. Inference attack against encrypted range queries on outsourced databases. In CODASPY."},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Seny Kamara and Tarik Moataz. 2017. Boolean searchable symmetric encryption with worst-case sub-linear complexity. In EUROCRYPT.  Seny Kamara and Tarik Moataz. 2017. Boolean searchable symmetric encryption with worst-case sub-linear complexity. In EUROCRYPT.","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Seny Kamara and Charalampos Papamanthou. 2013. Parallel and dynamic searchable symmetric encryption. In Financial Cryptography.  Seny Kamara and Charalampos Papamanthou. 2013. Parallel and dynamic searchable symmetric encryption. In Financial Cryptography.","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882932"},{"key":"e_1_2_1_43_1","volume-title":"Introduction to Modern Cryptography","author":"Katz Jonathan","unstructured":"Jonathan Katz and Yehuda Lindell . 2014. Introduction to Modern Cryptography . CRC press . Jonathan Katz and Yehuda Lindell. 2014. Introduction to Modern Cryptography. CRC press."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978386"},{"key":"e_1_2_1_45_1","volume-title":"Accessing data while preserving privacy. arXiv Preprint","author":"Kellaris Georgios","year":"2017","unstructured":"Georgios Kellaris , George Kollios , Kobbi Nissim , and Adam O\u2019Neill . 2017. Accessing data while preserving privacy. arXiv Preprint ( 2017 ). Georgios Kellaris, George Kollios, Kobbi Nissim, and Adam O\u2019Neill. 2017. Accessing data while preserving privacy. arXiv Preprint (2017)."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660277"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516668"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367518"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978376"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733100"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749455"},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Ian Miers and Payman Mohassel. 2017. IO-DSSE: Scaling dynamic searchable encryption to millions of indexes by improving locality. In NDSS.  Ian Miers and Payman Mohassel. 2017. IO-DSSE: Scaling dynamic searchable encryption to millions of indexes by improving locality. In NDSS.","DOI":"10.14722\/ndss.2017.23394"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813651"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.47"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"e_1_2_1_57_1","volume-title":"The Design of Dynamic Data Structures","author":"Overmars Mark H.","unstructured":"Mark H. Overmars . 1983. The Design of Dynamic Data Structures . Springer Science 8 Business Media. Mark H. Overmars. 1983. The Design of Dynamic Data Structures. Springer Science 8 Business Media."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.38"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.29"},{"key":"e_1_2_1_61_1","unstructured":"Dawn Xiaoding Song David Wagner and Adrian Perrig. 2000. Practical techniques for searches on encrypted data. In SP.  Dawn Xiaoding Song David Wagner and Adrian Perrig. 2000. Practical techniques for searches on encrypted data. In SP."},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Emil Stefanov Charalampos Papamanthou and Elaine Shi. 2014. Practical dynamic searchable encryption with small leakage. In NDSS.  Emil Stefanov Charalampos Papamanthou and Elaine Shi. 2014. Practical dynamic searchable encryption with small leakage. In NDSS.","DOI":"10.14722\/ndss.2014.23298"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"e_1_2_1_64_1","volume-title":"Towards practical oblivious RAM. NDSS","author":"Stefanov Emil","year":"2012","unstructured":"Emil Stefanov , Elaine Shi , and Dawn Song . 2012. Towards practical oblivious RAM. NDSS ( 2012 ). Emil Stefanov, Elaine Shi, and Dawn Song. 2012. Towards practical oblivious RAM. NDSS (2012)."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488336"},{"key":"e_1_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Peter Van Liesdonk Saeed Sedghi Jeroen Doumen Pieter Hartel and Willem Jonker. 2010. Computationally efficient searchable symmetric encryption. In SDM.   Peter Van Liesdonk Saeed Sedghi Jeroen Doumen Pieter Hartel and Willem Jonker. 2010. Computationally efficient searchable symmetric encryption. In SDM.","DOI":"10.1007\/978-3-642-15546-8_7"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813634"},{"key":"e_1_2_1_69_1","volume-title":"USENIX Security Symposium.","author":"Zhang Yupeng","year":"2016","unstructured":"Yupeng Zhang , Jonathan Katz , and Charalampos Papamanthou . 2016 . All your queries are belong to us: The power of file-injection attacks on searchable encryption . In USENIX Security Symposium. Yupeng Zhang, Jonathan Katz, and Charalampos Papamanthou. 2016. All your queries are belong to us: The power of file-injection attacks on searchable encryption. In USENIX Security Symposium."},{"key":"e_1_2_1_70_1","volume-title":"Joseph E. Gonzalez, and Ion Stoica.","author":"Zheng Wenting","year":"2017","unstructured":"Wenting Zheng , Ankur Dave , Jethro G. Beekman , Raluca Ada Popa , Joseph E. Gonzalez, and Ion Stoica. 2017 . Opaque : An oblivious and encrypted distributed analytics platform. In NSDI. Wenting Zheng, Ankur Dave, Jethro G. Beekman, Raluca Ada Popa, Joseph E. Gonzalez, and Ion Stoica. 2017. Opaque: An oblivious and encrypted distributed analytics platform. In NSDI."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167971","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3167971","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3167971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:07Z","timestamp":1750213567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,12]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3,31]]}},"alternative-id":["10.1145\/3167971"],"URL":"https:\/\/doi.org\/10.1145\/3167971","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,12]]},"assertion":[{"value":"2017-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}