{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:13Z","timestamp":1779174793387,"version":"3.51.4"},"publisher-location":"Cham","reference-count":75,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306198","type":"print"},{"value":"9783031306204","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30620-4_1","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T11:03:05Z","timestamp":1681470185000},"page":"3-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Theory of\u00a0Composition for\u00a0Differential Obliviousness"],"prefix":"10.1007","author":[{"given":"Mingxun","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.-H. Hubert","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shir","family":"Maimon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M Abe","year":"1999","unstructured":"Abe, M.: Mix-networks on permutation networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 258\u2013273. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_21"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I., Pinkas, B., Yanai, A.: Blinder - scalable, robust anonymous committed broadcast. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1233\u20131252. ACM Press, November 2020. https:\/\/doi.org\/10.1145\/3372297.3417261","DOI":"10.1145\/3372297.3417261"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Afshani, P., Freksen, C.B., Kamma, L., Larsen, K.G.: Lower bounds for multiplication via network coding. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) ICALP 2019. LIPIcs, vol. 132, pp. 10:1\u201310:12. Schloss Dagstuhl, July 2019. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.10","DOI":"10.4230\/LIPIcs.ICALP.2019.10"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2010.08.002","volume":"101","author":"R Aharoni","year":"2011","unstructured":"Aharoni, R., Berger, E., Georgakopoulos, A., Perlstein, A., Spr\u00fcssel, P.: The max-flow min-cut theorem for countable networks. J. Combin. Theory Ser. B 101(1), 1\u201317 (2011). https:\/\/doi.org\/10.1016\/j.jctb.2010.08.002","journal-title":"J. Combin. Theory Ser. B"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: Practical and provably secure onion routing. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018. LIPIcs, vol. 107, pp. 144:1\u2013144:14. Schloss Dagstuhl, July 2018. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.144","DOI":"10.4230\/LIPIcs.ICALP.2018.144"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Arasu, A., Kaushik, R.: Oblivious query processing. In: Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24\u201328, 2014. pp. 26\u201337. OpenProceedings.org (2014). https:\/\/doi.org\/10.5441\/002\/icdt.2014.07","DOI":"10.5441\/002\/icdt.2014.07"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Balle, B., Barthe, G., Gaboardi, M.: Privacy amplification by subsampling: tight analyses via couplings and divergences. In: NeurIPS (2018). https:\/\/doi.org\/10.5555\/3327345.3327525","DOI":"10.5555\/3327345.3327525"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-030-26951-7_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"B Balle","year":"2019","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: The privacy blanket of the shuffle model. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 638\u2013667. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_22"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-29011-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Bayer","year":"2012","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 263\u2013280. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Beimel, A., Nissim, K., Zaheri, M.: Exploring differential obliviousness. In: Approx\/Random. LIPIcs, vol. 145, pp. 65:1\u201365:20 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2019.65, https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2019.65","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2019.65 10.4230\/LIPIcs.APPROX-RANDOM.2019.65"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Bittau, A., et al.: Prochlo: strong privacy for analytics in the crowd. In: SOSP, New York, NY, USA, pp. 441\u2013459. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3132747.3132769","DOI":"10.1145\/3132747.3132769"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Bogatov, D., Kellaris, G., Kollios, G., Nissim, K., O\u2019Neill, A.: $$\\epsilon $$psolute: Efficiently querying databases while providing differential privacy. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2262\u20132276. ACM Press, November 2021. https:\/\/doi.org\/10.1145\/3460120.3484786","DOI":"10.1145\/3460120.3484786"},{"key":"1_CR13","unstructured":"B\u00fcnz, B., Hu, Y., Matsuo, S., Shi, E.: Non-interactive differentially anonymous router. Cryptology ePrint Archive, Report 2021\/1242 (2021). https:\/\/eprint.iacr.org\/2021\/1242"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11535218_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J Camenisch","year":"2005","unstructured":"Camenisch, J., Lysyanskaya, A.: A formal treatment of onion routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 169\u2013187. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_11"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 668\u2013679. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813700","DOI":"10.1145\/2810103.2813700"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Cecchetti, E., Zhang, F., Ji, Y., Kosba, A.E., Juels, A., Shi, E.: Solidus: confidential distributed ledger transactions via PVORM. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 701\u2013717. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3134010","DOI":"10.1145\/3133956.3134010"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Chan, T.H.H., Chung, K.M., Maggs, B.M., Shi, E.: Foundations of differentially oblivious algorithms. In: Chan, T.M. (ed.) 30th SODA, pp. 2448\u20132467. ACM-SIAM, January 2019. https:\/\/doi.org\/10.1137\/1.9781611975482.150","DOI":"10.1137\/1.9781611975482.150"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Chan, T.H.H., Guo, Y., Lin, W.K., Shi, E.: Cache-oblivious and data-oblivious sorting and applications. In: Czumaj, A. (ed.) 29th SODA, pp. 2201\u20132220. ACM-SIAM, January 2018. https:\/\/doi.org\/10.1137\/1.9781611975031.143","DOI":"10.1137\/1.9781611975031.143"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-14162-1_34","volume-title":"Automata, Languages and Programming","author":"T-H Hubert Chan","year":"2010","unstructured":"Hubert Chan, T.-H., Shi, E., Song, D.: Private and continual release of statistics. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 405\u2013417. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_34"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988). https:\/\/doi.org\/10.1007\/BF00206326","journal-title":"J. Cryptol."},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981). https:\/\/doi.org\/10.1145\/358549.358563","journal-title":"Commun. ACM"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Cheu, A.: Differential privacy in the shuffle model: a survey of separations. arXiv preprint arXiv:2107.11839 (2021). https:\/\/doi.org\/10.48550\/arXiv.2107.11839","DOI":"10.48550\/arXiv.2107.11839"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-17653-2_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Cheu","year":"2019","unstructured":"Cheu, A., Smith, A., Ullman, J., Zeber, D., Zhilyaev, M.: Distributed differential privacy via shuffling. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 375\u2013403. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_13"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Chu, S., Zhuo, D., Shi, E., Chan, T.H.: Differentially oblivious database joins: Overcoming the worst-case curse of fully oblivious algorithms. In: Tessaro, S. (ed.) ITC (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.19","DOI":"10.4230\/LIPIcs.ITC.2021.19"},{"key":"1_CR25","unstructured":"Connell, G.: Technology deep dive: Building a faster oram layer for enclaves. https:\/\/signal.org\/blog\/building-faster-oram\/"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: an anonymous messaging system handling millions of users. In: 2015 IEEE Symposium on Security and Privacy, pp. 321\u2013338. IEEE Computer Society Press, May 2015. https:\/\/doi.org\/10.1109\/SP.2015.27","DOI":"10.1109\/SP.2015.27"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs, H., Ford, B.: Dissent: accountable anonymous group messaging. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, pp. 340\u2013350. ACM Press, October 2010. https:\/\/doi.org\/10.1145\/1866307.1866346","DOI":"10.1145\/1866307.1866346"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Crooks, N., Burke, M., Cecchetti, E., Harel, S., Agarwal, R., Alvisi, L.: Obladi: oblivious serializable transactions in the cloud. In: 13th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2018, Carlsbad, CA, USA, October 8\u201310, 2018. pp. 727\u2013743. USENIX Association (2018). https:\/\/doi.org\/10.5555\/3291168.3291222","DOI":"10.5555\/3291168.3291222"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-78372-7_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"JP Degabriele","year":"2018","unstructured":"Degabriele, J.P., Stam, M.: Untagging tor: a formal treatment of onion encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 259\u2013293. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_9"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M., Pitassi, T., Rothblum, G.N.: Differential privacy under continual observation. In: Schulman, L.J. (ed.) 42nd ACM STOC, pp. 715\u2013724. ACM Press, June 2010. https:\/\/doi.org\/10.1145\/1806689.1806787","DOI":"10.1145\/1806689.1806787"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014). https:\/\/doi.org\/10.1561\/0400000042","DOI":"10.1561\/0400000042"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Erlingsson, \u00da., Feldman, V., Mironov, I., Raghunathan, A., Talwar, K., Thakurta, A.: Amplification by shuffling: From local to central differential privacy via anonymity. In: Chan, T.M. (ed.) 30th SODA, pp. 2468\u20132479. ACM-SIAM, January 2019. https:\/\/doi.org\/10.1137\/1.9781611975482.151","DOI":"10.1137\/1.9781611975482.151"},{"key":"1_CR34","unstructured":"Eskandarian, S., Boneh, D.: Clarion: Anonymous communication from multiparty shuffling protocols. Cryptology ePrint Archive, Report 2021\/1514 (2021). https:\/\/eprint.iacr.org\/2021\/1514"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Eskandarian, S., Zaharia, M.: Oblidb: oblivious query processing for secure databases. Proc. VLDB Endow. 13(2), 169\u2013183 (2019). https:\/\/doi.org\/10.14778\/3364324.3364331","DOI":"10.14778\/3364324.3364331"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Farhadi, A., Hajiaghayi, M., Larsen, K.G., Shi, E.: Lower bounds for external memory integer sorting via network coding. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 997\u20131008. ACM Press, June 2019. https:\/\/doi.org\/10.1145\/3313276.3316337","DOI":"10.1145\/3313276.3316337"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Feldman, V., McMillan, A., Talwar, K.: Hiding among the clones: a simple and nearly optimal analysis of privacy amplification by shuffling. In: FOCS (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00096","DOI":"10.1109\/FOCS52979.2021.00096"},{"key":"1_CR38","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276723","author":"Y Gertner","year":"2000","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. JCSS (2000). https:\/\/doi.org\/10.1145\/276698.276723","journal-title":"JCSS"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Ghazi, B., Golowich, N., Kumar, R., Pagh, R., Velingker, A.: On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 463\u2013488. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_16","DOI":"10.1007\/978-3-030-77883-5_16"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Ghazi, B., Kumar, R., Manurangsi, P., Pagh, R.: Private counting from anonymous messages: Near-optimal accuracy with vanishing communication overhead (2021). https:\/\/doi.org\/10.48550\/ARXIV.2106.04247","DOI":"10.48550\/ARXIV.2106.04247"},{"issue":"1","key":"1_CR41","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1109\/JSAIT.2021.3056102","volume":"2","author":"AM Girgis","year":"2021","unstructured":"Girgis, A.M., Data, D., Diggavi, S., Kairouz, P., Suresh, A.T.: Shuffled model of federated learning: privacy, accuracy and communication trade-offs. IEEE J. Sel. Areas Inf. Theory 2(1), 464\u2013478 (2021). https:\/\/doi.org\/10.1109\/JSAIT.2021.3056102","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: Aho, A. (ed.) 19th ACM STOC. pp. 182\u2013194. ACM Press, May 1987. https:\/\/doi.org\/10.1145\/28395.28416","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"1_CR43","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431\u2013473 (1996). https:\/\/doi.org\/10.1145\/233551.233553","journal-title":"J. ACM"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., Vahlis, Y.: Secure two-party computation in sublinear (amortized) time. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 513\u2013524. ACM Press, October 2012. https:\/\/doi.org\/10.1145\/2382196.2382251","DOI":"10.1145\/2382196.2382251"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Katz, J., Liang, M., Xu, J.: Spreading the privacy blanket: - differentially oblivious shuffling for differential privacy. In: Ateniese, G., Venturi, D. (eds.) ACNS 22. LNCS, vol. 13269, pp. 501\u2013520. Springer, Heidelberg, June 2022. https:\/\/doi.org\/10.1007\/978-3-031-09234-3_25","DOI":"10.1007\/978-3-031-09234-3_25"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Grubbs, P., Lacharit\u00e9, M.S., Minaud, B., Paterson, K.G.: Learning to reconstruct: Statistical learning theory and encrypted database attacks. In: 2019 IEEE Symposium on Security and Privacy, pp. 1067\u20131083. IEEE Computer Society Press, May 2019. https:\/\/doi.org\/10.1109\/SP.2019.00030","DOI":"10.1109\/SP.2019.00030"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Grubbs, P., McPherson, R., Naveed, M., Ristenpart, T., Shmatikov, V.: Breaking web applications built on top of encrypted data. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1353\u20131364. ACM Press, October 2016. https:\/\/doi.org\/10.1145\/2976749.2978351","DOI":"10.1145\/2976749.2978351"},{"issue":"1","key":"1_CR48","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"1","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 1(1), 26\u201330 (1935). https:\/\/doi.org\/10.1112\/jlms\/s1-10.37.26","journal-title":"J. Lond. Math. Soc."},{"issue":"10","key":"1_CR49","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1090\/S0002-9904-1948-09098-X","volume":"54","author":"M Hall Jr","year":"1948","unstructured":"Hall, M., Jr.: Distinct representatives of subsets. Bull. Am. Math. Soc. 54(10), 922\u2013926 (1948). https:\/\/doi.org\/10.1090\/S0002-9904-1948-09098-X","journal-title":"Bull. Am. Math. Soc."},{"key":"1_CR50","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS 2012. The Internet Society, February 2012"},{"key":"1_CR51","doi-asserted-by":"publisher","unstructured":"Jacob, R., Larsen, K.G., Nielsen, J.B.: Lower bounds for oblivious data structures. In: Chan, T.M. (ed.) 30th SODA, pp. 2439\u20132447. ACM-SIAM, Jan 2019. https:\/\/doi.org\/10.1137\/1.9781611975482.149","DOI":"10.1137\/1.9781611975482.149"},{"key":"1_CR52","doi-asserted-by":"publisher","unstructured":"Kellaris, G., Kollios, G., Nissim, K., O\u2019Neill, A.: Generic attacks on secure outsourced databases. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016. pp. 1329\u20131340. ACM Press, October 2016. https:\/\/doi.org\/10.1145\/2976749.2978386","DOI":"10.1145\/2976749.2978386"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Lin, W.K., Shi, E., Xie, T.: Can we overcome the n log n barrier for oblivious sorting? In: Chan, T.M. (ed.) 30th SODA, pp. 2419\u20132438. ACM-SIAM, January 2019. https:\/\/doi.org\/10.1137\/1.9781611975482.148","DOI":"10.1137\/1.9781611975482.148"},{"key":"1_CR54","doi-asserted-by":"publisher","unstructured":"Liu, C., Hicks, M., Harris, A., Tiwari, M., Maas, M., Shi, E.: Ghostrider: a hardware-software system for memory trace oblivious computation. In: ASPLOS (2015). https:\/\/doi.org\/10.1145\/2694344.2694385","DOI":"10.1145\/2694344.2694385"},{"key":"1_CR55","doi-asserted-by":"publisher","unstructured":"Liu, C., Wang, X.S., Nayak, K., Huang, Y., Shi, E.: ObliVM: a programming framework for secure computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 359\u2013376. IEEE Computer Society Press, May 2015. https:\/\/doi.org\/10.1109\/SP.2015.29","DOI":"10.1109\/SP.2015.29"},{"key":"1_CR56","doi-asserted-by":"publisher","unstructured":"Lochbihler, A.: A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory. Journal of Automated Reasoning, pp. 1\u201326 (2022). https:\/\/doi.org\/10.1007\/s10817-022-09616-4","DOI":"10.1007\/s10817-022-09616-4"},{"key":"1_CR57","doi-asserted-by":"publisher","unstructured":"Maas, M., et al.: PHANTOM: practical oblivious computation in a secure processor. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 311\u2013324. ACM Press, November 2013. https:\/\/doi.org\/10.1145\/2508859.2516692","DOI":"10.1145\/2508859.2516692"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126\u2013142. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_8"},{"key":"1_CR59","doi-asserted-by":"publisher","unstructured":"Mishra, P., Poddar, R., Chen, J., Chiesa, A., Popa, R.A.: Oblix: An efficient oblivious search index. In: 2018 IEEE Symposium on Security and Privacy, pp. 279\u2013296. IEEE Computer Society Press, May 2018. https:\/\/doi.org\/10.1109\/SP.2018.00045","DOI":"10.1109\/SP.2018.00045"},{"key":"1_CR60","doi-asserted-by":"publisher","unstructured":"Naveed, M., Kamara, S., Wright, C.V.: Inference attacks on property-preserving encrypted databases. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 644\u2013655. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813651","DOI":"10.1145\/2810103.2813651"},{"key":"1_CR61","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage (extended abstract). In: 29th ACM STOC, pp. 294\u2013303. ACM Press, May 1997. https:\/\/doi.org\/10.1145\/258533.258606","DOI":"10.1145\/258533.258606"},{"issue":"4","key":"1_CR62","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"M Reed","year":"1998","unstructured":"Reed, M., Syverson, P., Goldschlag, D.: Anonymous connections and onion routing. IEEE J. Sel. Areas Commun. 16(4), 482\u2013494 (1998). https:\/\/doi.org\/10.1109\/49.668972","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1_CR63","doi-asserted-by":"publisher","unstructured":"Ren, L., Yu, X., Fletcher, C.W., van Dijk, M., Devadas, S.: Design space exploration and optimization of path oblivious RAM in secure processors. In: ISCA, pp. 571\u2013582 (2013). https:\/\/doi.org\/10.1145\/2485922.2485971","DOI":"10.1145\/2485922.2485971"},{"key":"1_CR64","doi-asserted-by":"publisher","unstructured":"Roughgarden, T.: Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press (2020). https:\/\/doi.org\/10.1017\/9781108637435","DOI":"10.1017\/9781108637435"},{"key":"1_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E Shi","year":"2011","unstructured":"Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_11"},{"key":"1_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-77883-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"E Shi","year":"2021","unstructured":"Shi, E., Wu, K.: Non-interactive anonymous router. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 489\u2013520. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_17"},{"key":"1_CR67","doi-asserted-by":"publisher","unstructured":"Stefanov, E., Shi, E.: ObliviStore: high performance oblivious cloud storage. In: 2013 IEEE Symposium on Security and Privacy. pp. 253\u2013267. IEEE Computer Society Press, May 2013. https:\/\/doi.org\/10.1109\/SP.2013.25","DOI":"10.1109\/SP.2013.25"},{"key":"1_CR68","doi-asserted-by":"publisher","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 299\u2013310. ACM Press, November 2013. https:\/\/doi.org\/10.1145\/2508859.2516660","DOI":"10.1145\/2508859.2516660"},{"key":"1_CR69","unstructured":"Tinoco, A., Gao, S., Shi, E.: EnigMap: Signal should use oblivious algorithms for private contact discovery. Cryptology ePrint Archive, Report 2022\/1083 (2022). https:\/\/eprint.iacr.org\/2022\/1083"},{"key":"1_CR70","doi-asserted-by":"publisher","unstructured":"Wang, X., Chan, T.H.H., Shi, E.: Circuit ORAM: On tightness of the Goldreich-Ostrovsky lower bound. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 850\u2013861. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813634","DOI":"10.1145\/2810103.2813634"},{"key":"1_CR71","doi-asserted-by":"publisher","unstructured":"Wang, Y.X., Balle, B., Kasiviswanathan, S.: Subsampled r\u00e9nyi differential privacy and analytical moments accountant. J. Privacy Confident. 10(2) (2021). https:\/\/doi.org\/10.29012\/jpc.723","DOI":"10.29012\/jpc.723"},{"key":"1_CR72","doi-asserted-by":"publisher","unstructured":"Williams, P., Sion, R., Tomescu, A.: PrivateFS: a parallel oblivious file system. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 977\u2013988. ACM Press, October 2012. https:\/\/doi.org\/10.1145\/2382196.2382299","DOI":"10.1145\/2382196.2382299"},{"key":"1_CR73","unstructured":"Zhou, M., Shi, E.: The power of the differentially oblivious shuffle in distributed privacy mechanisms. Cryptology ePrint Archive, Report 2022\/177 (2022). https:\/\/eprint.iacr.org\/2022\/177"},{"key":"1_CR74","unstructured":"Zhou, M., Shi, E., Chan, T.H.H., Maimon, S.: A theory of composition for differential obliviousness. Cryptology ePrint Archive, Report 2022\/1357 (2022). https:\/\/eprint.iacr.org\/2022\/1357"},{"key":"1_CR75","doi-asserted-by":"publisher","unstructured":"Zhuang, L., Zhou, F., Zhao, B.Y., Rowstron, A.: Cashmere: Resilient anonymous routing. In: NSDI (2005). https:\/\/doi.org\/10.5555\/1251203.1251225","DOI":"10.5555\/1251203.1251225"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30620-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:17Z","timestamp":1744754597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30620-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306198","9783031306204"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30620-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","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":"109","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":"0","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":"26% - 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":"16","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)"}}]}}