{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:08:05Z","timestamp":1764133685450,"version":"3.46.0"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486203"},{"type":"electronic","value":"9783031486210"}],"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-48621-0_3","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"62-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-Interactive Anonymous Router with\u00a0Quasi-Linear Router Computation"],"prefix":"10.1007","author":[{"given":"Rex","family":"Fernando","sequence":"first","affiliation":[]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Pratik","family":"Soni","sequence":"additional","affiliation":[]},{"given":"Nikhil","family":"Vanjani","sequence":"additional","affiliation":[]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"3_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":"3_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of byzantine agreement, revisited. In: PODC (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Pinkas, B., Yanai, A.: Blinder: MPC based scalable and robust anonymous committed broadcast. In: ACM CCS (2020)","DOI":"10.1145\/3372297.3417261"},{"key":"3_CR4","unstructured":"Alexopoulos, N., Kiayias, A., Talviste, R., Zacharias, T.: MCMix: anonymous messaging via secure multiparty computation. In: Usenix Security (2017)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-63715-0_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"P Ananth","year":"2017","unstructured":"Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation for turing machines: constant overhead and amortization. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 252\u2013279. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_9"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Asharov, G., Chan, T.H., Nayak, K., Pass, R., Ren, L., Shi, E.: Bucket oblivious sort: an extremely simple oblivious sort. In: SOSA (2020)","DOI":"10.1137\/1.9781611976014.2"},{"key":"3_CR7","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: Differentially private summation with multi-message shuffling. CoRR, abs\/1906.09116 (2019)"},{"key":"3_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":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"3_CR10","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":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-662-49896-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Bellare","year":"2016","unstructured":"Bellare, M., Stepanovs, I., Waters, B.: New negative results on differing-inputs obfuscation. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 792\u2013821. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_28"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 439\u2013448 (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Bittau, A., et al.: Prochlo: strong privacy for analytics in the crowd. CoRR, abs\/1710.00901 (2017)","DOI":"10.1145\/3132747.3132769"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29"},{"key":"3_CR16","unstructured":"Brakerski, Z., Dottling, N., Garg, S., Malavolta, G.: Factoring and pairings are not necessary for IO: circular-secure LWE suffices. Cryptology ePrint Archive, Report 2020\/1024 (2020)"},{"key":"3_CR17","unstructured":"Bunn, P., Kushilevitz, E., Ostrovsky, R.: Anonymous permutation routing. Cryptology ePrint Archive, Paper 2022\/1353 (2022). https:\/\/eprint.iacr.org\/2022\/1353"},{"key":"3_CR18","unstructured":"B\u00fcnz, B., Hu, Y., Matsuo, S., Shi, E.: Non-interactive differentially anonymous router. Cryptology ePrint Archive, Paper 2021\/1242 (2021). https:\/\/eprint.iacr.org\/2021\/1242"},{"key":"3_CR19","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":"3_CR20","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Indistinguishability obfuscation of iterated circuits and ram programs. Cryptology ePrint Archive (2014)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-46497-7_19","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 468\u2013497. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_19"},{"issue":"2","key":"3_CR22","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)","journal-title":"Commun. ACM"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"DL Chaum","year":"1988","unstructured":"Chaum, D.L.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"3_CR24","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":"3_CR25","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval (extended abstract). In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, New York, NY, USA, pp. 304\u2013313. ACM (1997)","DOI":"10.1145\/258533.258609"},{"key":"3_CR26","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 41\u201350 (1995)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: an anonymous messaging system handling millions of users. In: S & P (2015)","DOI":"10.1109\/SP.2015.27"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Ford, B.: Dissent: accountable anonymous group messaging. In: CCS, pp. 340\u2013350 (2010)","DOI":"10.1145\/1866307.1866346"},{"key":"3_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":"3_CR30","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: USENIX Security Symposium (2004)","DOI":"10.21236\/ADA465464"},{"key":"3_CR31","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":"3_CR32","doi-asserted-by":"crossref","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: SODA (2019)","DOI":"10.1137\/1.9781611975482.151"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M. Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: IEEE Symposium on Foundations of Computer Science (FOCS) (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"3_CR34","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. Cryptology ePrint Archive, Report 2020\/1010 (2020)"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci. 60(3) (2000)","DOI":"10.1006\/jcss.1999.1689"},{"key":"3_CR36","unstructured":"Ghazi, B., Pagh, R., Velingker, A.: Scalable and differentially private distributed aggregation in the shuffled model. CoRR, abs\/1906.08320 (2019)"},{"issue":"4","key":"3_CR37","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM (JACM) 33(4), 792\u2013807 (1986)","journal-title":"J. ACM (JACM)"},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"D Goldschlag","year":"1999","unstructured":"Goldschlag, D., Reed, M., Syverson, P.: Onion routing for anonymous and private internet connections. Commun. ACM 42, 39\u201341 (1999)","journal-title":"Commun. ACM"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-031-09234-3_25","volume-title":"Applied Cryptography and Network Security","author":"SD Gordon","year":"2022","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 2022. LNCS, vol. 13269, pp. 501\u2013520. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_25"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-031-06944-4_24","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"J Guan","year":"2022","unstructured":"Guan, J., Wichs, D., Zhandry, M.: Incompressible cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 700\u2013730. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_24"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-70700-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"S Halevi","year":"2017","unstructured":"Halevi, S., Ishai, Y., Jain, A., Komargodski, I., Sahai, A., Yogev, E.: Non-interactive multiparty computation without correlated randomness. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 181\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_7"},{"key":"3_CR42","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In NDSS (2012)"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Jain, A., Jin, Z.: Indistinguishability obfuscation via mathematical proofs of equivalence. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, 31 October\u20133 November 2022, pp. 1023\u20131034. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00100"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 60\u201373 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, pp. 669\u2013684 (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for turing machines with unbounded memory. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 419\u2013428 (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"3_CR47","unstructured":"Lamport, L.: Constructing digital signatures from a one way function (1979)"},{"key":"3_CR48","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems. Stanford University (1979)"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage (extended abstract). In: STOC, pp. 294\u2013303 (1997)","DOI":"10.1145\/258533.258606"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Ramachandran, V., Shi, E.: Data oblivious algorithms for multicores. In: Agrawal, K., Azar, Y. (eds.) SPAA 2021: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6\u20138 July 2021, pp. 373\u2013384. ACM (2021)","DOI":"10.1145\/3409964.3461783"},{"key":"3_CR51","unstructured":"Sherwood, R., Bhattacharjee, B., Srinivasan, A.: P5: a protocol for scalable anonymous communication. In: IEEE Symposium on Security and Privacy (2002)"},{"key":"3_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-031-31368-4_22","volume-title":"Public-Key Cryptography - PKC 2023","author":"E Shi","year":"2023","unstructured":"Shi, E., Vanjani, N.: Multi-client inner product encryption: function-hiding instantiations without random oracles. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023. LNCS, vol. 13940, pp. 622\u2013651. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_22"},{"key":"3_CR53","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":"3_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-35199-1_17","volume-title":"Cryptography and Coding","author":"NP Smart","year":"2019","unstructured":"Smart, N.P., Talibi Alaoui, Y.: Distributing any elliptic curve based protocol. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 342\u2013366. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_17"},{"key":"3_CR55","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Gilad, Y., Leung, D., Zaharia, M., Zeldovich, N.: Stadium: a distributed metadata-private messaging system. In: SOSP (2017)","DOI":"10.1145\/3132747.3132783"},{"key":"3_CR56","doi-asserted-by":"crossref","unstructured":"van den Hooff, J., Lazar, D., Zaharia, M., Zeldovich, N.: Vuvuzela: scalable private messaging resistant to traffic analysis. In: SOSP (2015)","DOI":"10.1145\/2815400.2815417"},{"key":"3_CR57","doi-asserted-by":"crossref","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. Cryptology ePrint Archive, Report 2020\/1042 (2020)","DOI":"10.1007\/978-3-030-77883-5_5"},{"key":"3_CR58","unstructured":"Zhuang, L., Zhou, F., Zhao, B.Y., Rowstron, A.: Cashmere: resilient anonymous routing. In: NSDI (2005)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48621-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:09Z","timestamp":1764118989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48621-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486203","9783031486210"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48621-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}