{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:48:28Z","timestamp":1770900508147,"version":"3.50.1"},"publisher-location":"Cham","reference-count":78,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030360290","type":"print"},{"value":"9783030360306","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36030-6_16","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T17:02:36Z","timestamp":1574442156000},"page":"393-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["The Function-Inversion Problem: Barriers and Opportunities"],"prefix":"10.1007","author":[{"given":"Henry","family":"Corrigan-Gibbs","sequence":"first","affiliation":[]},{"given":"Dmitry","family":"Kogan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-70697-9_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"H Abusalah","year":"2017","unstructured":"Abusalah, H., Alwen, J., Cohen, B., Khilko, D., Pietrzak, K., Reyzin, L.: Beyond Hellman\u2019s time-memory trade-offs with applications to proofs of space. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 357\u2013379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_13"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms 3(3), 289\u2013304 (1992). https:\/\/doi.org\/10.1002\/rsa.3240030308","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s004930100009","volume":"21","author":"L Babai","year":"2001","unstructured":"Babai, L., Hayes, T.P., Kimmel, P.G.: The cost of the missing bit: communication complexity with help. Combinatorica 21(4), 455\u2013488 (2001). https:\/\/doi.org\/10.1007\/s004930100009","journal-title":"Combinatorica"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"52:1","DOI":"10.1145\/2000807.2000820","volume":"7","author":"J Barbay","year":"2011","unstructured":"Barbay, J., He, M., Munro, J.I., Satti, S.R.: Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms 7(4), 52:1\u201352:27 (2011). https:\/\/doi.org\/10.1145\/2000807.2000820","journal-title":"ACM Trans. Algorithms"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11818175_1","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"E Barkan","year":"2006","unstructured":"Barkan, E., Biham, E., Shamir, A.: Rigorous bounds on cryptanalytic time\/memory tradeoffs. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 1\u201321. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_1"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/BF01263423","volume":"4","author":"R Beigel","year":"1994","unstructured":"Beigel, R., Tarui, J.: On ACC. Comput. Complex. 4, 350\u2013366 (1994). https:\/\/doi.org\/10.1007\/BF01263423","journal-title":"Comput. Complex."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"A Biryukov","year":"2000","unstructured":"Biryukov, A., Shamir, A.: Cryptanalytic time\/memory\/data tradeoffs for stream ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 1\u201313. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_1"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44706-7_1","volume-title":"Fast Software Encryption","author":"A Biryukov","year":"2001","unstructured":"Biryukov, A., Shamir, A., Wagner, D.: Real time cryptanalysis of A5\/1 on a PC. In: Goos, G., Hartmanis, J., van Leeuwen, J., Schneier, B. (eds.) FSE 2000. LNCS, vol. 1978, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44706-7_1"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., Naor, M.: Is there an oblivious RAM lower bound? In: ITCS (2016). https:\/\/doi.org\/10.1145\/2840728.2840761","DOI":"10.1145\/2840728.2840761"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Brody, J.: The maximum communication complexity of multi-party pointer jumping. In: CCC (2009). https:\/\/doi.org\/10.1109\/CCC.2009.30","DOI":"10.1109\/CCC.2009.30"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Brody, J., Chakrabarti, A.: Sublinear communication protocols for multi-party pointer jumping and a related lower bound. In: STACS (2008). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2008.1341","DOI":"10.4230\/LIPIcs.STACS.2008.1341"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-70500-2_3","volume-title":"Theory of Cryptography","author":"J Brody","year":"2017","unstructured":"Brody, J., Dziembowski, S., Faust, S., Pietrzak, K.: Position-based cryptography and multiparty communication complexity. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 56\u201381. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_3"},{"issue":"19","key":"16_CR13","doi-asserted-by":"publisher","first-page":"471","DOI":"10.4086\/toc.2015.v011a019","volume":"11","author":"J Brody","year":"2015","unstructured":"Brody, J., Larsen, K.G.: Adapt or die: polynomial lower bounds for non-adaptive dynamic data structures. Theory Comput. 11(19), 471\u2013489 (2015). https:\/\/doi.org\/10.4086\/toc.2015.v011a019","journal-title":"Theory Comput."},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Brody, J., Sanchez, M.: Dependent random graphs and multi-party pointer jumping. In: APPROX\/RANDOM (2015). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2015.606","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2015.606"},{"key":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808737","author":"AK Chandra","year":"1983","unstructured":"Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: STOC (1983). https:\/\/doi.org\/10.1145\/800061.808737","journal-title":"Multi-party protocols. In: STOC"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1515\/dma.2011.031","volume":"23","author":"DY Cherukhin","year":"2011","unstructured":"Cherukhin, D.Y.: Lower bounds for the complexity of Boolean circuits of finite depth with arbitrary elements. Discret. Math. Appl. 23(4), 39\u201347 (2011). https:\/\/doi.org\/10.1515\/dma.2011.031","journal-title":"Discret. Math. Appl."},{"key":"16_CR17","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: SODA (1996)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-319-96884-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Coretti","year":"2018","unstructured":"Coretti, S., Dodis, Y., Guo, S.: Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 693\u2013721. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_23"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-78381-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Coretti","year":"2018","unstructured":"Coretti, S., Dodis, Y., Guo, S., Steinberger, J.: Random oracles and non-uniformity. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 227\u2013258. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_9"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/PL00001595","volume":"7","author":"C Damm","year":"1998","unstructured":"Damm, C., Jukna, S., Sgall, J.: Some bounds on multiparty communication complexity of pointer jumping. Comput. Complex. 7(2), 109\u2013127 (1998). https:\/\/doi.org\/10.1007\/PL00001595","journal-title":"Comput. Complex."},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-14623-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A De","year":"2010","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 649\u2013665. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_35"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0196-6774(03)00043-9","volume":"48","author":"ED Demaine","year":"2003","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A.: A linear lower bound on index size for text retrieval. J. Algorithms 48(1), 2\u201315 (2003). https:\/\/doi.org\/10.1016\/S0196-6774(03)00043-9","journal-title":"J. Algorithms"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-319-56614-6_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Y Dodis","year":"2017","unstructured":"Dodis, Y., Guo, S., Katz, J.: Fixing cracks in the concrete: random oracles with auxiliary input, revisited. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 473\u2013495. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_16"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-03356-8_16","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Steinberger, J.: Message authentication codes from unpredictable block ciphers. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 267\u2013285. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_16"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Drucker, A.: Limitations of lower-bound methods for the wire complexity of Boolean operators. In: CCC (2012). https:\/\/doi.org\/10.1109\/CCC.2012.39","DOI":"10.1109\/CCC.2012.39"},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Dvir, Z., Golovnev, A., Weinstein, O.: Static data structure lower bounds imply rigidity. In: STOC (2019). https:\/\/doi.org\/10.1145\/3313276.3316348","DOI":"10.1145\/3313276.3316348"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Fiat, A., Naor, M.: Rigorous time\/space tradeoffs for inverting functions. In: STOC (1991). https:\/\/doi.org\/10.1145\/103418.103473","DOI":"10.1145\/103418.103473"},{"issue":"3","key":"16_CR28","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1137\/S0097539795280512","volume":"29","author":"A Fiat","year":"1999","unstructured":"Fiat, A., Naor, M.: Rigorous time\/space trade-offs for inverting functions. SIAM J. Comput. 29(3), 790\u2013803 (1999). https:\/\/doi.org\/10.1137\/S0097539795280512","journal-title":"SIAM J. Comput."},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-45061-0_28","volume-title":"Automata, Languages and Programming","author":"Anna G\u00e1l","year":"2003","unstructured":"G\u00e1l, A., Miltersen, P.B.: The cell probe complexity of succinct data structures. In: ICALP (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_28"},{"issue":"3","key":"16_CR30","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.tcs.2007.02.047","volume":"379","author":"A G\u00e1l","year":"2007","unstructured":"G\u00e1l, A., Miltersen, P.B.: The cell probe complexity of succinct data structures. Theoret. Comput. Sci. 379(3), 405\u2013417 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.02.047","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"16_CR31","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/1198513.1198516","volume":"2","author":"RF Geary","year":"2006","unstructured":"Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms 2(4), 510\u2013534 (2006). https:\/\/doi.org\/10.1145\/1198513.1198516","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"16_CR32","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/S0097539704443276","volume":"35","author":"R Gennaro","year":"2005","unstructured":"Gennaro, R., Gertner, Y., Katz, J., Trevisan, L.: Bounds on the efficiency of generic cryptographic constructions. SIAM J. Comput. 35(1), 217\u2013246 (2005). https:\/\/doi.org\/10.1137\/S0097539704443276","journal-title":"SIAM J. Comput."},{"key":"16_CR33","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: FOCS (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892119","DOI":"10.1109\/SFCS.2000.892119"},{"key":"16_CR34","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: STOC (1987). https:\/\/doi.org\/10.1145\/28395.28416","DOI":"10.1145\/28395.28416"},{"key":"16_CR35","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 1. Cambridge University Press, New York (2006)"},{"issue":"6","key":"16_CR36","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM J. Comput. 22(6), 1163\u20131175 (1993). https:\/\/doi.org\/10.1137\/0222069","journal-title":"SIAM J. Comput."},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC (1989). https:\/\/doi.org\/10.1145\/73007.73010","DOI":"10.1145\/73007.73010"},{"issue":"3","key":"16_CR38","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":"16_CR39","unstructured":"Golovnev, A., Guo, S., Horel, T., Park, S., Vaikuntanathan, V.: 3SUM with preprocessing: algorithms, lower bounds and cryptographic applications. arXiv:1907.08355 [cs.DS] (2019). http:\/\/arxiv.org\/abs\/1907.08355"},{"key":"16_CR40","unstructured":"Golynski, A.: Stronger lower bounds for text searching and polynomial evaluation (2007). https:\/\/cs.uwaterloo.ca\/research\/tr\/2007\/CS-2007-25.pdf"},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"Golynski, A.: Cell probe lower bounds for succinct data structures. In: SODA (2009). https:\/\/doi.org\/10.1137\/1.9781611973068.69","DOI":"10.1137\/1.9781611973068.69"},{"issue":"2","key":"16_CR42","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/rsa.20068","volume":"27","author":"N Goyal","year":"2005","unstructured":"Goyal, N., Saks, M.: A parallel search game. Random Struct. Algorithms 27(2), 227\u2013234 (2005). https:\/\/doi.org\/10.1002\/rsa.20068","journal-title":"Random Struct. Algorithms"},{"key":"16_CR43","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-642-14165-2_57","volume-title":"Automata, Languages and Programming","author":"Roberto Grossi","year":"2010","unstructured":"Grossi, R., Orlandi, A., Raman, R.: Optimal trade-offs for succinct string indexes. In: ICALP (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_57"},{"key":"16_CR44","doi-asserted-by":"publisher","unstructured":"Haitner, I., Mazor, N., Oshman, R., Reingold, O., Yehudayoff, A.: On the communication complexity of key-agreement protocols. In: ITCS (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.40","DOI":"10.4230\/LIPIcs.ITCS.2019.40"},{"issue":"4","key":"16_CR45","doi-asserted-by":"publisher","first-page":"42:1","DOI":"10.1145\/2344422.2344432","volume":"8","author":"M He","year":"2012","unstructured":"He, M., Munro, J.I., Satti, S.R.: Succinct ordinal trees based on tree covering. ACM Trans. Algorithms 8(4), 42:1\u201342:32 (2012). https:\/\/doi.org\/10.1145\/2344422.2344432","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"16_CR46","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M Hellman","year":"1980","unstructured":"Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4), 401\u2013406 (1980). https:\/\/doi.org\/10.1109\/TIT.1980.1056220","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR47","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01272517","volume":"1","author":"J H\u00e5stad","year":"1991","unstructured":"H\u00e5stad, J., Goldmann, M.: On the power of small-depth threshold circuits. Comput. Complex. 1, 113\u2013129 (1991). https:\/\/doi.org\/10.1007\/BF01272517","journal-title":"Comput. Complex."},{"key":"16_CR48","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R.: Relativized separations of worst-case and average-case complexities for NP. In: CCC (2011). https:\/\/doi.org\/10.1109\/CCC.2011.34","DOI":"10.1109\/CCC.2011.34"},{"key":"16_CR49","doi-asserted-by":"publisher","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: FOCS (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63533","DOI":"10.1109\/SFCS.1989.63533"},{"key":"16_CR50","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity","author":"S Jukna","year":"2012","unstructured":"Jukna, S.: Boolean Function Complexity. Algorithms and Combinatorics, vol. 27. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24508-4"},{"issue":"6","key":"16_CR51","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1016\/j.jcss.2009.09.003","volume":"77","author":"S Jukna","year":"2011","unstructured":"Jukna, S., Schnitger, G.: Min-rank conjecture for log-depth circuits. J. Comput.Syst. Sci. 77(6), 1023\u20131038 (2011). https:\/\/doi.org\/10.1016\/j.jcss.2009.09.003","journal-title":"J. Comput.Syst. Sci."},{"key":"16_CR52","unstructured":"Kopelowitz, T., Porat, E.: The strong 3SUM-INDEXING conjecture is false. arXiv:1907.11206 [cs.DS] (2019). http:\/\/arxiv.org\/abs\/1907.11206"},{"key":"16_CR53","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, New York (1997)"},{"key":"16_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-96881-0_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"KG Larsen","year":"2018","unstructured":"Larsen, K.G., Nielsen, J.B.: Yes, there is an oblivious RAM lower bound!. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 523\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_18"},{"issue":"4","key":"16_CR55","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"LA Levin","year":"1987","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica 7(4), 357\u2013363 (1987). https:\/\/doi.org\/10.1007\/BF02579323","journal-title":"Combinatorica"},{"issue":"1","key":"16_CR56","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00224-013-9476-x","volume":"54","author":"H Liang","year":"2014","unstructured":"Liang, H.: Optimal collapsing protocol for multiparty pointer jumping. Theory Comput. Syst. 54(1), 13\u201323 (2014). https:\/\/doi.org\/10.1007\/s00224-013-9476-x","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"16_CR57","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0304-3975(95)80032-5","volume":"143","author":"PB Miltersen","year":"1995","unstructured":"Miltersen, P.B.: On the cell probe complexity of polynomial evaluation. Theoret. Comput. Sci. 143(1), 167\u2013174 (1995). https:\/\/doi.org\/10.1016\/0304-3975(95)80032-5","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR58","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2012.03.005","volume":"438","author":"JI Munro","year":"2012","unstructured":"Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations and functions. Theoret. Comput. Sci. 438, 74\u201388 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.03.005","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR59","doi-asserted-by":"publisher","unstructured":"Narayanan, A., Shmatikov, V.: Fast dictionary attacks on passwords using time-space tradeoff. In: CCS (2005). https:\/\/doi.org\/10.1145\/1102120.1102168","DOI":"10.1145\/1102120.1102168"},{"issue":"11\u201312","key":"16_CR60","first-page":"901","volume":"15","author":"A Nayebi","year":"2015","unstructured":"Nayebi, A., Aaronson, S., Belovs, A., Trevisan, L.: Quantum lower bound for inverting a permutation with advice. Quantum Inf. Comput. 15(11\u201312), 901\u2013913 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"16_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-540-45146-4_36","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"P Oechslin","year":"2003","unstructured":"Oechslin, P.: Making a faster cryptanalytic time-memory trade-off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 617\u2013630. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_36"},{"key":"16_CR62","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R.: Efficient computation on oblivious RAMs. In: STOC (1990). https:\/\/doi.org\/10.1145\/100216.100289","DOI":"10.1145\/100216.100289"},{"issue":"3","key":"16_CR63","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0097539794264809","volume":"26","author":"P Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P., R\u00f6dl, V., Sgall, J.: Boolean circuits, tensor ranks, and communication complexity. SIAM J. Comput. 26(3), 605\u2013633 (1997). https:\/\/doi.org\/10.1137\/S0097539794264809","journal-title":"SIAM J. Comput."},{"key":"16_CR64","doi-asserted-by":"publisher","unstructured":"Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: SODA (2006). https:\/\/doi.org\/10.1145\/1109557.1109693","DOI":"10.1145\/1109557.1109693"},{"key":"16_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-74143-5_12","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D Unruh","year":"2007","unstructured":"Unruh, D.: Random oracles and auxiliary input. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 205\u2013223. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_12"},{"key":"16_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-08353-7_135","volume-title":"Mathematical Foundations of Computer Science 1977","author":"LG Valiant","year":"1977","unstructured":"Valiant, L.G.: Graph-theoretic arguments in low-level complexity. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, pp. 162\u2013176. Springer, Heidelberg (1977). https:\/\/doi.org\/10.1007\/3-540-08353-7_135"},{"key":"16_CR67","doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: Why is Boolean complexity theory difficult. In: London Mathematical Society Lecture Note Series, vol. 169, pp. 84\u201394 (1992). https:\/\/doi.org\/10.1017\/cbo9780511526633.008","DOI":"10.1017\/cbo9780511526633.008"},{"issue":"1","key":"16_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000033","volume":"5","author":"E Viola","year":"2009","unstructured":"Viola, E.: On the power of small-depth computation. Found. Trends Theoret. Comput. Sci. 5(1), 1\u201372 (2009). https:\/\/doi.org\/10.1561\/0400000033","journal-title":"Found. Trends Theoret. Comput. Sci."},{"key":"16_CR69","unstructured":"Viola, E.: Lower bounds for data structures with space close to maximum imply circuit lower bounds. Electronic Colloquium on Computational Complexity (ECCC), Report 2018\/186 (2018)"},{"issue":"6","key":"16_CR70","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00493-009-2667-z","volume":"29","author":"E Viola","year":"2009","unstructured":"Viola, E., Wigderson, A.: One-way multiparty communication lower bound for pointer jumping with applications. Combinatorica 29(6), 719\u2013743 (2009). https:\/\/doi.org\/10.1007\/s00493-009-2667-z","journal-title":"Combinatorica"},{"key":"16_CR71","doi-asserted-by":"publisher","unstructured":"Wee, H.: On obfuscating point functions. In: STOC (2005). https:\/\/doi.org\/10.1145\/1060590.1060669","DOI":"10.1145\/1060590.1060669"},{"key":"16_CR72","doi-asserted-by":"crossref","unstructured":"Weiss, M., Wichs, D.: Is there an oblivious RAM lower bound for online reads? Cryptology ePrint Archive, Report 2018\/619 (2018)","DOI":"10.1007\/978-3-030-03810-6_22"},{"key":"16_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-030-03810-6_22","volume-title":"Theory of Cryptography","author":"M Weiss","year":"2018","unstructured":"Weiss, M., Wichs, D.: Is there an oblivious RAM lower bound for online reads? In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 603\u2013635. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_22"},{"key":"16_CR74","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Some complexity questions related to distributive computing (preliminary report). In: STOC (1979). https:\/\/doi.org\/10.1145\/800135.804414","DOI":"10.1145\/800135.804414"},{"issue":"3","key":"16_CR75","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"AC Yao","year":"1981","unstructured":"Yao, A.C.: Should tables be sorted? J. ACM 28(3), 615\u2013628 (1981). https:\/\/doi.org\/10.1145\/322261.322274","journal-title":"J. ACM"},{"key":"16_CR76","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: FOCS (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.45","DOI":"10.1109\/SFCS.1982.45"},{"key":"16_CR77","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Coherent functions and program checkers (extended abstract). In: STOC (1990). https:\/\/doi.org\/10.1145\/100216.100226","DOI":"10.1145\/100216.100226"},{"key":"16_CR78","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: On ACC and threshold circuits. In: FOCS (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89583","DOI":"10.1109\/FSCS.1990.89583"}],"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-030-36030-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T03:09:16Z","timestamp":1669086556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-36030-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030360290","9783030360306"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36030-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","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":"Nuremberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Review software by Shai Halevi","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"147","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":"43","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":"29% - 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.35","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":"15","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}