{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:51:06Z","timestamp":1781077866994,"version":"3.54.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842413","type":"print"},{"value":"9783030842420","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84242-0_2","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:06:57Z","timestamp":1628636817000},"page":"11-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the Possibility of Basing Cryptography on $$\\mathsf{EXP}\\ne \\mathsf{BPP}$$"],"prefix":"10.1007","author":[{"given":"Yanyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/050628994","volume":"35","author":"E Allender","year":"2006","unstructured":"Allender, E., Buhrman, H., Kouck\u1ef3, M., Van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(6), 1467\u20131493 (2006)","journal-title":"SIAM J. Comput."},{"key":"2_CR2","unstructured":"Allender, E., Cheraghchi, M., Myrisiotis, D., Tirumala, H., Volkovich, I.: One-way functions and a conditional variant of MKTP (2021). Manuscript"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: STOC 2006, pp. 701\u2013710 (2006)","DOI":"10.1145\/1132516.1132614"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in nc$$^{0}$$. SIAM J. Comput. 36(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Miller, G.L. (ed.) Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, 22\u201324 May 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-46494-6_1","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2015","unstructured":"Bogdanov, A., Brzuska, C.: On basing size-verifiable one-way functions on NP-hardness. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 1\u20136. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_1"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-36494-3_20","volume-title":"STACS 2003","author":"H Buhrman","year":"2003","unstructured":"Buhrman, H., Fortnow, L., Pavan, A.: Some results on derandomization. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 212\u2013222. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_20"},{"key":"2_CR8","unstructured":"Blum, M.: Coin flipping by telephone - a protocol for solving impossible problems. In: 24th IEEE Computer Society International Conference, COMPCON 1982, Digest of Papers, San Francisco, California, USA, 22\u201325 February 1982, pp. 133\u2013137. IEEE Computer Society (1982)"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci. 36(2), 254\u2013276 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"2_CR10","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1109\/TIT.1983.1056754","volume":"29","author":"G Brassard","year":"1983","unstructured":"Brassard, G.: Relativized cryptography. IEEE Trans. Inf. Theor. 29(6), 877\u2013893 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Trevisan, L.: On worst-case to average-case reductions for NP problems. In: FOCS 2003, pp. 308\u2013317 (2003)","DOI":"10.1109\/SFCS.2003.1238205"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Trevisan, L.: Average-case complexity (2008). Manuscript. http:\/\/arxiv.org\/abs\/cs.CC\/0606037","DOI":"10.1109\/FOCS.2008.90"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/321526.321530","volume":"16","author":"GJ Chaitin","year":"1969","unstructured":"Chaitin, G.J.: On the simplicity and speed of programs for computing infinite sets of natural numbers. J. ACM 16(3), 407\u2013422 (1969)","journal-title":"J. ACM"},{"issue":"6","key":"2_CR14","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC 1990, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-39568-7_22","volume-title":"Advances in Cryptology","author":"O Goldreich","year":"1985","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions (extended abstract). In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 276\u2013288. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_22"},{"issue":"6","key":"2_CR17","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)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Basic Tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"2_CR20","unstructured":"Gurevich, Yuri: The challenger-solver game: variations on the theme of P = ?NP. In: Logic in Computer Science Column. The Bulletin of EATCS (1989)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-14712-8_12","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"SD Gordon","year":"2010","unstructured":"Gordon, S.D., Wee, H., Xiao, D., Yerukhimovich, A.: On the round complexity of zero-knowledge proofs based on one-way permutations. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 189\u2013204. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14712-8_12"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Generalized Kolmogorov complexity and the structure of feasible computations. In: 24th Annual Symposium on Foundations of Computer Science, SFCS 1983, November 1983, pp. 439\u2013445 (1993)","DOI":"10.1109\/SFCS.1983.21"},{"issue":"4","key":"2_CR23","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_CR24","doi-asserted-by":"crossref","unstructured":"Haitner, I., Mahmoody, M., Xiao, D.: A new sampling protocol and applications to basing cryptographic primitives on the hardness of NP. In: IEEE Conference on Computational Complexity, pp. 76\u201387 (2010)","DOI":"10.1109\/CCC.2010.17"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 285\u2013306 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October\u20131 November 1989, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"2_CR27","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Structure in Complexity Theory 1995, pp. 134\u2013147 (1995)"},{"key":"2_CR28","unstructured":"Impagliazzo, R., Wigderson, A.: Randomness vs. time: de-randomization under a uniform assumption. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pp. 734\u2013743. IEEE (1998)"},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","volume":"48","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: On the notion of infinite pseudorandom sequences. Theor. Comput. Sci. 48(3), 9\u201333 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20134","key":"2_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207166808803030","volume":"2","author":"AN Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2(1\u20134), 157\u2013168 (1968)","journal-title":"Int. J. Comput. Math."},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(83)90044-3","volume":"17","author":"C Lautemann","year":"1983","unstructured":"Lautemann, C.: BPP and the polynomial hierarchy. Inf. Process. Lett. 17(4), 215\u2013217 (1983)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2_CR32","first-page":"265","volume":"9","author":"LA Levin","year":"1973","unstructured":"Levin, L.A.: Universal search problems (Russian). Probl. Inf. Transm. 9(3), 265\u2013266 (1973). Translated into English by B.A. Trakhtenbrot in [Tra84]","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"2_CR33","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1023\/A:1023634616182","volume":"39","author":"LA Levin","year":"2003","unstructured":"Levin, L.A.: The tale of one-way functions. Probl. Inf. Transm. 39(1), 92\u2013103 (2003)","journal-title":"Probl. Inf. Transm."},{"key":"2_CR34","unstructured":"Livne, N.: On the construction of one-way functions from average case hardness. In: ICS, pp. 301\u2013309. Citeseer (2010)"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-54945-5_75","volume-title":"ISA\u201991 Algorithms","author":"L Longpr\u00e9","year":"1991","unstructured":"Longpr\u00e9, L., Mocas, S.: Symmetry of information and one-way functions. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 308\u2013315. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54945-5_75"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and kolmogorov complexity. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 1243\u20131254. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"2_CR37","first-page":"59","volume":"28","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Pass, R.: On one-way functions from NP-complete problems. Electron. Colloquium Comput. Complex. 28, 59 (2021)","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"2_CR38","first-page":"56","volume":"28","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Pass, R.: On the possibility of basing cryptography on \\$ $$\\backslash $$exp $$\\backslash $$neq $$\\backslash $$bpp\\$. Electron. Colloquium Comput. Complex. 28, 56 (2021). Kindly check and confrim that Ref. [LP21b] is correct. Amend if necessary","journal-title":"Electron. Colloquium Comput. Complex."},{"issue":"2","key":"2_CR39","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptol."},{"issue":"2","key":"2_CR40","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR41","unstructured":"Ostrovsky, R., Wigderson, A.: One-way fuctions are essential for non-trivial zero-knowledge. In: ISTCS, pp. 3\u201317 (1993)"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Pass, R., Venkitasubramaniam, M.: Is it easier to prove theorems that are guaranteed to be true? In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1255\u20131267. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00119"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"2_CR44","first-page":"57","volume":"28","author":"H Ren","year":"2021","unstructured":"Ren, H., Santhanam, R.: Hardness of KT characterizes parallel cryptography. Electron. Colloquium Comput. Complex. 28, 57 (2021)","journal-title":"Electron. Colloquium Comput. Complex."},{"issue":"1","key":"2_CR45","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1983","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems (reprint). Commun. ACM 26(1), 96\u201399 (1983)","journal-title":"Commun. ACM"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, USA, 25\u201327 April 1983, pp. 330\u2013335. ACM (1983)","DOI":"10.1145\/800061.808762"},{"issue":"1","key":"2_CR47","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/230514.571645","volume":"27","author":"M Sipser","year":"1996","unstructured":"Sipser, M.: Introduction to the theory of computation. ACM SIGACT News 27(1), 27\u201329 (1996)","journal-title":"ACM SIGACT News"},{"issue":"1","key":"2_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. Part i. Inf. Control 7(1), 1\u201322 (1964)","journal-title":"Inf. Control"},{"issue":"4","key":"2_CR49","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"BA Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of Russian approaches to perebor (brute-force searches) algorithms. Ann. Hist. Comput. 6(4), 384\u2013400 (1984)","journal-title":"Ann. Hist. Comput."},{"key":"2_CR50","unstructured":"Trevisan, L., Vadhan, S.: Pseudorandomness and average-case complexity via uniform reductions. In: Proceedings 17th IEEE Annual Conference on Computational Complexity, p. 0129. IEEE Computer Society (2002)"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"issue":"6","key":"2_CR52","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"AK Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 25(6), 83\u2013124 (1970)","journal-title":"Russ. Math. Surv."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84242-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:40:13Z","timestamp":1725604813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84242-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842413","9783030842420"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84242-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"426","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":"103","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":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20.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":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","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"}]}}