{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T14:05:06Z","timestamp":1743775506981,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780226"},{"type":"electronic","value":"9783031780233"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78023-3_2","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:50:35Z","timestamp":1733136635000},"page":"37-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards General-Purpose Program Obfuscation via\u00a0Local Mixing"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Chamon","sequence":"additional","affiliation":[]},{"given":"Eduardo R.","family":"Mucciolo","sequence":"additional","affiliation":[]},{"given":"Andrei E.","family":"Ruckenstein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-46497-7_21","volume-title":"Theory of Cryptography","author":"B Applebaum","year":"2015","unstructured":"Applebaum, B., Brakerski, Z.: Obfuscating circuits via composite-order graded encoding. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 528\u2013556. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_21"},{"key":"2_CR2","unstructured":"Alagic, G., Jeffery, S. and Jordan, S.P.: Circuit obfuscation using braids. In: Flammia, S.T., Harrow, A.W. (eds.) 9th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2014, 21-23 May 2014, Singapore, LIPIcs, vol.\u00a027 , pp. 141\u2013160. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2014)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Sahai, A.: Achieving compactness generically: indistinguishability obfuscation from non-compact functional encryption. IACR Cryptol. ePrint Arch., pp. 730 (2015)","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC$${^1}$$. In: Hartmanis, J. (ed.) Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA, pp. 1\u20135. ACM (1986)","DOI":"10.1145\/12130.12131"},{"key":"2_CR5","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-57048-8_2","volume-title":"Tutorials on the Foundations of Cryptography","author":"B Barak","year":"2017","unstructured":"Barak, B.: The complexity of public-key cryptography. In: Tutorials on the Foundations of Cryptography. ISC, pp. 45\u201377. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_2"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18(4), 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"key":"2_CR8","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., et al.: 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":"2_CR9","doi-asserted-by":"crossref","unstructured":"Boaz et al.: On the (Im)possibility of obfuscating programs. J. ACM, 59(2), 6:1\u20136:48 (2012)","DOI":"10.1145\/2160158.2160159"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-55220-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B Barak","year":"2014","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 221\u2013238. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_13"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Ball, M., Liu, Y., Mazor, N., Pass, R.: Kolmogorov comes to cryptomania: on interactive Kolmogorov complexity and key-agreement. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 458\u2013483 (2023)","DOI":"10.1109\/FOCS57990.2023.00034"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-662-49096-9_20","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2016","unstructured":"Bitansky, N., Paneth, O., Wichs, D.: Perfect structure on the edge of chaos. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 474\u2013502. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_20"},{"key":"2_CR13","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/1-4020-8141-3_8","volume-title":"Exploring New Frontiers of Theoretical Informatics","author":"A Brodsky","year":"2004","unstructured":"Brodsky, A.: Reversible circuit realizations of Boolean functions. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IIFIP, vol. 155, pp. 67\u201380. Springer, Boston, MA (2004). https:\/\/doi.org\/10.1007\/1-4020-8141-3_8"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. IACR Cryptol. ePrint Arch., pp. 163 (2015)","DOI":"10.1109\/FOCS.2015.20"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Chamon, C., Mucciolo, E., Ruckenstein, A.: Towards general-purpose program obfuscation via local mixing. Cryptology ePrint Archive, Paper 2024\/006 (2024)","DOI":"10.1007\/978-3-031-78023-3_2"},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1137\/0129051","volume":"29","author":"D Coppersmith","year":"1975","unstructured":"Coppersmith, D., Grossman, E.: Generators for certain alternating groups with applications to crytography. SIAM J. Appl. Math. 29(4), 624\u2013627 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-662-47989-6_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"J-S Coron","year":"2015","unstructured":"Coron, J.-S., et al.: Zeroizing without low-level zeroes: new MMAP attacks and their limitations. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 247\u2013266. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_12"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-36030-6_3","volume-title":"Theory of Cryptography","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Hhan, M., Vaikuntanathan, V., Wee, H.: Matrix PRFs: constructions, attacks, and applications to obfuscation. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 55\u201380. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_3"},{"key":"2_CR19","unstructured":"Chamon, C., Jakes-Schauer, J., Mucciolo, E.R., Ruckenstein, A.E.: Encrypted operator computing: an alternative to fully homomorphic encryption. CoRR, abs\/2203.08876 (2022)"},{"key":"2_CR20","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"},{"key":"2_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.aop.2022.169086","volume":"446","author":"C Chamon","year":"2022","unstructured":"Chamon, C., Mucciolo, E.R., Ruckenstein, A.E.: Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers. Ann. Phys. 446, 169086 (2022)","journal-title":"Ann. Phys."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Chamon, C., Ruckenstein, A.E., Mucciolo, E.R., Canetti, R.: Circuit complexity and functionality: a thermodynamic perspective. arXiv preprint arXiv:2309.05731, 2023","DOI":"10.21203\/rs.3.rs-3346487\/v1"},{"key":"2_CR23","unstructured":"Canetti, R., Vaikuntanathan, V.:D Obfuscating branching programs using black-box pseudo-free groups. IACR Cryptol. ePrint Arch., pp. 500 (2013)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-96881-0_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Vaikuntanathan, V., Wee, H.: GGH15 beyond permutation branching programs: proofs, attacks, and candidates. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 577\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_20"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-90453-1_9","volume-title":"Theory of Cryptography","author":"L Devadas","year":"2021","unstructured":"Devadas, L., Quach, W., Vaikuntanathan, V., Wee, H., Wichs, D.: Succinct LWE sampling, random polynomials, and obfuscation. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 256\u2013287. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_9"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-662-46497-7_20","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Gorbunov, S., Halevi, S.: Graph-induced multilinear maps from lattices. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 498\u2013527. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_20"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_4"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1-4 June 2013, pp. 467\u2013476 (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"2_CR29","unstructured":"Gretta, L., He, W., Pelecanos, A.: More efficient k-wise independent permutations from random reversible circuits via log-sobolev inequalitie, manuscript (2024)"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0963548300001917","volume":"5","author":"WT Gowers","year":"1996","unstructured":"Gowers, W.T.: An almost m-wise independed random permutation of the cube. Comb. Probab. Comput. 5, 119\u2013130 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. In: Khuller, S., Williams, V.V. (eds.) STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, 21-25 June 2021, pp. 736\u2013749. ACM (2021)","DOI":"10.1145\/3406325.3451070"},{"issue":"3","key":"2_CR32","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s00145-013-9151-z","volume":"27","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser, S., Rothblum, G.N.: On best-possible obfuscation. J. Cryptol. 27(3), 480\u2013505 (2014)","journal-title":"J. Cryptol."},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-44448-3_34","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"S Hada","year":"2000","unstructured":"Hada, S.: Zero-knowledge and code obfuscation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 443\u2013457. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_34"},{"key":"2_CR34","unstructured":"Brodsky, A., Hoory, S.: Simple permutations mix even better (2005)"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Hoory, S., Magen, A., Myers, S., Rackoff, C.: Simple permutations mix well. Theor. Comput. Sci. 348(2):251\u2013261 (2005). Automata, Languages and Programming: Algorithms and Complexity (ICALP-A 2004)","DOI":"10.1016\/j.tcs.2005.09.016"},{"key":"2_CR36","unstructured":"He, W., O\u2019Donnell, R.: Pseudorandom permutations from random reversible circuits (2024)"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Ilango, R., Li, J., Williams, R.R.: Indistinguishability obfuscation, range avoidance, and bounded arithmetic. Electron. Colloquium Comput. Complex. TR23-038 (2023)","DOI":"10.1145\/3564246.3585187"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Ilango, R., Ren, H., Santhanam, R.: Robustness of average-case meta-complexity via pseudorandomness. In: Leonardi, S., Gupta, A. (eds.) STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, 20-24 June 2022, pp. 1575\u20131583. ACM (2022)","DOI":"10.1145\/3519935.3520051"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, 21-25 June 2021, pp. 60\u201373. ACM (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"issue":"3","key":"2_CR41","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-022-09429-z","volume":"35","author":"F Kitagawa","year":"2022","unstructured":"Kitagawa, F., Nishimaki, R., Tanaka, K.: Obfustopia built on secret-key functional encryption. J. Cryptol. 35(3), 19 (2022)","journal-title":"J. Cryptol."},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and Kolmogorov complexity. In: Irani, S. (ed.) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16-19 November 2020, pp. 1243\u20131254. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass. R.: Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity. In: Khuller, S., Williams, V.V. (eds.) STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, 21-25 June 2021, pp. 722\u2013735. ACM (2021)","DOI":"10.1145\/3406325.3451121"},{"key":"2_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-662-49387-8_17","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"H Lin","year":"2016","unstructured":"Lin, H., Pass, R., Seth, K., Telang, S.: Indistinguishability obfuscation with non-trivial efficiency. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 447\u2013462. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_17"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Liu, T., Pelecanos, A., Tessaro, S., Vaikuntanathan, V.: Layout graphs, random walks and the t-wise independence of SPN block ciphers. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part III, LNCS, vol. 14083, pp. 694\u2013726. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_23","DOI":"10.1007\/978-3-031-38548-3_23"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-030-84259-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"T Liu","year":"2021","unstructured":"Liu, T., Tessaro, S., Vaikuntanathan, V.: The t-wise independence of\u00a0substitution-permutation networks. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 454\u2013483. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_16"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Ragavan, S., Vafa, N. and Vaikuntanathan, V.: Indistinguishability obfuscation from bilinear maps and LPN variants. Theory of Cryptography Conference (TCC) (2024)","DOI":"10.1007\/978-3-031-78023-3_1"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pp. 475\u2013484. ACM (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"2_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_104"},{"key":"2_CR50","unstructured":"Wikipedia contributors: White-box cryptography \u2014 Wikipedia, the free encyclopedia (2024). [Online; accessed 24-September-2024]"},{"key":"2_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-77883-5_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"H Wee","year":"2021","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5"}],"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-78023-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T14:09:30Z","timestamp":1733148570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}