{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:29:59Z","timestamp":1778128199259,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DGE-1650441"],"award-info":[{"award-number":["DGE-1650441"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EPSRC","award":["EP\/M013472\/1"],"award-info":[{"award-number":["EP\/M013472\/1"]}]},{"name":"Horizon 2020","award":["H2020-MSCA-ITN-2014-643161 ECRYPT-NET"],"award-info":[{"award-number":["H2020-MSCA-ITN-2014-643161 ECRYPT-NET"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3243864","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T12:56:36Z","timestamp":1539694596000},"page":"315-331","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":101,"title":["Pump up the Volume"],"prefix":"10.1145","author":[{"given":"Paul","family":"Grubbs","sequence":"first","affiliation":[{"name":"Cornell University, New York, NY, USA"}]},{"given":"Marie-Sarah","family":"Lacharite","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, London, United Kingdom"}]},{"given":"Brice","family":"Minaud","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, London, United Kingdom"}]},{"given":"Kenneth G.","family":"Paterson","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236217"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_2_6_1","volume-title":"Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator. The Annals of Mathematical Statistics","author":"Dvoretzky Aryeh","year":"1956","unstructured":"Aryeh Dvoretzky , Jack Kiefer , and Jacob Wolfowitz . 1956. Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator. The Annals of Mathematical Statistics ( 1956 ). Aryeh Dvoretzky, Jack Kiefer, and Jacob Wolfowitz. 1956. Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator. The Annals of Mathematical Statistics (1956)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.28"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90177-C"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3103007"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.44"},{"key":"e_1_3_2_2_12_1","volume":"200","author":"Hagberg Aric A.","unstructured":"Aric A. Hagberg , Daniel A. Schult , and Pieter J. Swart. 200 8. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference . Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference .","journal-title":"Pieter J. Swart."},{"key":"e_1_3_2_2_13_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_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978386"},{"key":"e_1_3_2_2_15_1","volume-title":"Accessing data while preserving privacy. arXiv 1706.01552","author":"Kellaris Georgios","year":"2017","unstructured":"Georgios Kellaris , George Kollios , Kobbi Nissim , and Adam O'Neill . 2017. Accessing data while preserving privacy. arXiv 1706.01552 ( 2017 ). Georgios Kellaris, George Kollios, Kobbi Nissim, and Adam O'Neill. 2017. Accessing data while preserving privacy. arXiv 1706.01552 (2017)."},{"key":"e_1_3_2_2_16_1","volume-title":"Paterson","author":"Lacharit\u00e9 Marie-Sarah","year":"2018","unstructured":"Marie-Sarah Lacharit\u00e9 , Brice Minaud , and Kenneth G . Paterson . 2018 . Improved Reconstruction Attacks on Encrypted Data Using Range Query Leakage. In 2018 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society Press , 1--18. Marie-Sarah Lacharit\u00e9, Brice Minaud, and Kenneth G. Paterson. 2018. Improved Reconstruction Attacks on Encrypted Data Using Range Query Leakage. In 2018 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society Press, 1--18."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_2_2_18_1","volume-title":"Probability and computing: Randomized algorithms and probabilistic analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal . 2005. Probability and computing: Randomized algorithms and probabilistic analysis . Cambridge university press . Michael Mitzenmacher and Eli Upfal. 2005. Probability and computing: Randomized algorithms and probabilistic analysis .Cambridge university press."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"J. W. Moon and L. Moser. 1965. On cliques in graphs. Israel Journal of Mathematics (1965).  J. W. Moon and L. Moser. 1965. On cliques in graphs. Israel Journal of Mathematics (1965).","DOI":"10.1007\/BF02760024"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813651"},{"key":"e_1_3_2_2_21_1","unstructured":"Tiago P. Peixoto. 2014. The graph-tool python library. (2014).  Tiago P. Peixoto. 2014. The graph-tool python library. (2014)."},{"key":"e_1_3_2_2_22_1","unstructured":"Roei Schuster Vitaly Shmatikov and Eran Tromer. 2017. Beauty and the Burst: Remote Identification of Encrypted Video Streams. In USENIX Security .   Roei Schuster Vitaly Shmatikov and Eran Tromer. 2017. Beauty and the Burst: Remote Identification of Encrypted Video Streams. In USENIX Security ."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.21"},{"key":"e_1_3_2_2_25_1","unstructured":"George Kingsley Zipf. 1935. The psychobiology of language. (1935).  George Kingsley Zipf. 1935. The psychobiology of language. (1935)."}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243864","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243864","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:47Z","timestamp":1750208267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243864"}},"subtitle":["Practical Database Reconstruction from Volume Leakage on Range Queries"],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":25,"alternative-id":["10.1145\/3243734.3243864","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243864","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}