{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:54Z","timestamp":1766281014307,"version":"3.48.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031223648"},{"type":"electronic","value":"9783031223655"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22365-5_2","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"33-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Rate-1 Incompressible Encryption from\u00a0Standard Assumptions"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Branco","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5914-7635","authenticated-orcid":false,"given":"Nico","family":"D\u00f6ttling","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1043-5094","authenticated-orcid":false,"given":"Jesko","family":"Dujmovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Benhamouda, F., Pointcheval, D.: Disjunctions for hash proof systems: new constructions and applications. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology - EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 69\u2013100. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_3","DOI":"10.1007\/978-3-662-46803-6_3"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 411\u2013439. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14","DOI":"10.1007\/978-3-030-64834-3_14"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., Wichs, D.: Public-key encryption in the bounded-retrieval model. In: Gilbert, H. (ed.) Advances in Cryptology - EUROCRYPT 2010. LNCS, vol. 6110, pp. 113\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_6","DOI":"10.1007\/978-3-642-13190-5_6"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol. 5677, pp. 36\u201354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_3","DOI":"10.1007\/978-3-642-03356-8_3"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M.J. (ed.) Advances in Cryptology - CRYPTO 2099. LNCS, vol. 1666, pp. 65\u201379. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_5","DOI":"10.1007\/3-540-48405-1_5"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) Advances in Cryptology - CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Boldyreva, A., Palacio, A.: An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology - EUROCRYPT 2004. LNCS, vol. 3027, pp. 171\u2013188. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_11","DOI":"10.1007\/978-3-540-24676-3_11"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Dai, W.: Defending against key exfiltration: efficiency improvements for big-key cryptography via large-alphabet subkey prediction. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 923\u2013940. ACM Press, Dallas, TX, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3133965","DOI":"10.1145\/3133956.3133965"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Bellare, M., Kane, D., Rogaway, P.: Big-key symmetric encryption: resisting key exfiltration. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology - CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 373\u2013402. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_14","DOI":"10.1007\/978-3-662-53018-4_14"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Black, J.: The ideal-cipher model, revisited: an uninstantiable blockcipher-based hash function. In: Robshaw, M.J.B. (ed.) Fast Software Encryption - FSE 2006. LNCS, vol. 4047, pp. 328\u2013340. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_21","DOI":"10.1007\/11799313_21"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Branco, P., D\u00f6ttling, N., Dujmovic, J.: Rate-1 incompressible encryption from standard assumptions. IACR Cryptol. ePrint Arch. 697 (2022). https:\/\/eprint.iacr.org\/2022\/697","DOI":"10.1007\/978-3-031-22365-5_2"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Brzuska, C., Farshim, P., Mittelbach, A.: Random-oracle uninstantiability from indistinguishability obfuscation. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015: 12th Theory of Cryptography Conference, Part II. LNCS, vol. 9015, pp. 428\u2013455. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_17","DOI":"10.1007\/978-3-662-46497-7_17"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"C Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292\u2013306. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052243"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557\u2013594 (2004). https:\/\/doi.org\/10.1145\/1008731.1008734","DOI":"10.1145\/1008731.1008734"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Chevalier, C., Fouque, P.A., Pointcheval, D., Zimmer, S.: Optimal randomness extraction from a Diffie-Hellman element. In: Joux, A. (ed.) Advances in Cryptology - EUROCRYPT 2009. LNCS, vol. 5479, pp. 572\u2013589. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_33","DOI":"10.1007\/978-3-642-01001-9_33"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055717"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) Advances in Cryptology - EUROCRYPT 2002. LNCS, vol. 2332, pp. 45\u201364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_4","DOI":"10.1007\/3-540-46035-7_4"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33(1), 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ganesh, C., Orlandi, C.: Proofs of replicated storage without timing assumptions. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology - CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 355\u2013380. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_13","DOI":"10.1007\/978-3-030-26948-7_13"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001: 4th International Workshop on Theory and Practice in Public Key Cryptography. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9","DOI":"10.1007\/3-540-44586-2_9"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Dent, A.W.: Adapting the weaknesses of the random oracle model to the generic group model. In: Zheng, Y. (ed.) Advances in Cryptology - ASIACRYPT 2002. LNCS, vol. 2501, pp. 100\u2013109. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_6","DOI":"10.1007\/3-540-36178-2_6"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Di Crescenzo, G., Lipton, R.J., Walfish, S.: Perfectly secure password protocols in the bounded retrieval model. In: Halevi, S., Rabin, T. (eds.) TCC 2006: 3rd Theory of Cryptography Conference. LNCS, vol. 3876, pp. 225\u2013244. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_12","DOI":"10.1007\/11681878_12"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008). https:\/\/doi.org\/10.1137\/060651380, https:\/\/doi.org\/10.1137\/060651380","DOI":"10.1137\/060651380"},{"key":"2_CR24","unstructured":"Dodis, Y., Quach, W., Wichs, D.: Speak much, remember little: cryptography in the bounded storage model, revisited. Cryptology ePrint Archive, Report 2021\/1270 (2021). https:\/\/eprint.iacr.org\/2021\/1270"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Dziembowski, S.: Intrusion-resilience via the bounded-storage model. In: Halevi, S., Rabin, T. (eds.) TCC 2006: 3rd Theory of Cryptography Conference. LNCS, vol. 3876, pp. 207\u2013224. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_11","DOI":"10.1007\/11681878_11"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Dziembowski, S.: On forward-secure storage (extended abstract). In: Dwork, C. (ed.) Advances in Cryptology - CRYPTO 2006. LNCS, vol. 4117, pp. 251\u2013270. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_15","DOI":"10.1007\/11818175_15"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Garg, R., Lu, G., Waters, B.: New techniques in replica encodings with client setup. In: Pass, R., Pietrzak, K. (eds.) TCC 2020: 18th Theory of Cryptography Conference, Part III. LNCS, vol. 12552, pp. 550\u2013583. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_20","DOI":"10.1007\/978-3-030-64381-2_20"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual Symposium on Foundations of Computer Science, pp. 40\u201349. IEEE Computer Society Press, Berkeley, CA, USA (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: 44th Annual Symposium on Foundations of Computer Science, pp. 102\u2013115. IEEE Computer Society Press, Cambridge, MA, USA (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238185","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology - CRYPTO 2012. LNCS, vol. 7417, pp. 162\u2013179. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_11","DOI":"10.1007\/978-3-642-32009-5_11"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: Umans, C. (ed.) 58th Annual Symposium on Foundations of Computer Science, pp. 612\u2013621. IEEE Computer Society Press, Berkeley, CA, USA (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.62","DOI":"10.1109\/FOCS.2017.62"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Guan, J., Wichs, D., Zhandry, M.: Incompressible cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 700\u2013730. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_24","DOI":"10.1007\/978-3-031-06944-4_24"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Guan, J., Zhandry, M.: Simple schemes in the bounded storage model. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 500\u2013524. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_17","DOI":"10.1007\/978-3-030-17659-4_17"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Guan, J., Zhandry, M.: Disappearing cryptography in the bounded storage model. In: Nissim, K., Waters, B. (eds.) TCC 2021: 19th Theory of Cryptography Conference, Part II. LNCS, vol. 13043, pp. 365\u2013396. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_13","DOI":"10.1007\/978-3-030-90453-1_13"},{"issue":"4","key":"2_CR35","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Hazay, C., L\u00f3pez-Alt, A., Wee, H., Wichs, D.: Leakage-resilient cryptography from minimal assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) Advances in Cryptology - EUROCRYPT 2013. LNCS, vol. 7881, pp. 160\u2013176. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_10","DOI":"10.1007\/978-3-642-38348-9_10"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC, pp. 60\u201373. ACM (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. In: Cramer, R. (ed.) Advances in Cryptology - EUROCRYPT 2005. LNCS, vol. 3494, pp. 78\u201395. Springer, Heidelberg(2005). https:\/\/doi.org\/10.1007\/11426639_5","DOI":"10.1007\/11426639_5"},{"issue":"1","key":"2_CR39","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5(1), 53\u201366 (1992)","journal-title":"J. Cryptol."},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Maurer, U.M.: Protocols for secret key agreement by public discussion based on common information. In: Brickell, E.F. (ed.) Advances in Cryptology - CRYPTO 1992. LNCS, vol. 740, pp. 461\u2013470. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_32","DOI":"10.1007\/3-540-48071-4_32"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Maurer, U.M., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004: 1st Theory of Cryptography Conference. LNCS, vol. 2951, pp. 21\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Moran, T., Wichs, D.: Incompressible encodings. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology - CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 494\u2013523. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_17","DOI":"10.1007\/978-3-030-56784-2_17"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Naor, M.: On cryptographic assumptions and challenges (invited talk). In: Boneh, D. (ed.) Advances in Cryptology - CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg 2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) Advances in Cryptology - EUROCRYPT 19 LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg 1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Raz, R.: A time-space lower bound for a large class of learning problems. In: Umans, C. (ed.) 58th Annual Symposium on Foundations of Computer Science,pp. 732\u2013742. IEEE Computer Society Press, Berkeley, CA, USA (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.73","DOI":"10.1109\/FOCS.2017.73"},{"key":"2_CR46","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th Annual ACM Symposium on Theory of Computing, pp. 84\u201393. ACM Press, Baltimore, MA, USA (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"}],"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-22365-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:25Z","timestamp":1766278945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22365-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223648","9783031223655"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22365-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","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":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","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":"60","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":"43% - 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.1","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":"9.9","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"}]}}