{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:29:47Z","timestamp":1778128187845,"version":"3.51.4"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643744","type":"print"},{"value":"9783030643751","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-64375-1_17","type":"book-chapter","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T11:20:18Z","timestamp":1607944818000},"page":"486-503","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Lower Bounds for Multi-server Oblivious RAMs"],"prefix":"10.1007","author":[{"given":"Kasper Green","family":"Larsen","sequence":"first","affiliation":[]},{"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Yeo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"17_CR1","unstructured":"Asharov, G., Komargodski, I., Lin, W.-K., Nayak, K., Peserico, E., Shi, E.: OptORAMa: Optimal oblivious RAM. Cryptology ePrint Archive, Report 2018\/892"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-49099-0_7","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: Oblivious parallel RAM and applications. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 175\u2013204. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_7"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Boyle, E., Naor, M.: Is there an oblivious RAM lower bound? In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pp. 357\u2013368. ACM (2016)","DOI":"10.1145\/2840728.2840761"},{"key":"17_CR4","unstructured":"Bunn, P., Katz, J., Kushilevitz, E., Ostrovsky, R.: Efficient 3-party distributed ORAM. IACR Cryptology ePrint Archive 2018:706 (2018)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/978-3-319-70694-8_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T-HH Chan","year":"2017","unstructured":"Chan, T.-H.H., Guo, Y., Lin, W.-K., Shi, E.: Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 660\u2013690. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_23"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-030-03332-3_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"T-HH Chan","year":"2018","unstructured":"Chan, T.-H.H., Katz, J., Nayak, K., Polychroniadou, A., Shi, E.: More is less: perfectly secure oblivious algorithms in the multi-server setting. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 158\u2013188. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_7"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-662-49099-0_8","volume-title":"Theory of Cryptography","author":"B Chen","year":"2016","unstructured":"Chen, B., Lin, H., Tessaro, S.: Oblivious parallel RAM: improved efficiency and generic constructions. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 205\u2013234. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_8"},{"key":"17_CR8","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 41\u201350. IEEE (1995)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-662-45608-8_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"K-M Chung","year":"2014","unstructured":"Chung, K.-M., Liu, Z., Pass, R.: Statistically-secure ORAM with $$\\tilde{O}(\\log ^2 n)$$ overhead. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 62\u201381. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_4"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious ram without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144\u2013163. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_10"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/2968443","volume":"63","author":"Z Dvir","year":"2016","unstructured":"Dvir, Z., Gopi, S.: 2-Server PIR with subpolynomial communication. J. ACM (JACM) 63(4), 39 (2016)","journal-title":"J. ACM (JACM)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-662-48797-6_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Faber","year":"2015","unstructured":"Faber, S., Jarecki, S., Kentros, S., Wei, B.: Three-party ORAM for secure computation. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 360\u2013385. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_16"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Fredman, M., Saks, M.: The cell probe complexity of dynamic data structures. In: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, pp. 345\u2013354. ACM (1989)","DOI":"10.1145\/73007.73040"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Garg, S., Lu, S., Ostrovsky, R., Scafuro, A.: Garbled RAM from one-way functions. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, pp. 449\u2013458. ACM (2015)","DOI":"10.1145\/2746539.2746593"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-55220-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"C Gentry","year":"2014","unstructured":"Gentry, C., Halevi, S., Lu, S., Ostrovsky, R., Raykova, M., Wichs, D.: Garbled RAM revisited. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 405\u2013422. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_23"},{"key":"17_CR16","unstructured":"Goldreich, O., Karloff, H., Schulman, L.J., Trevisan, L.: Lower bounds for linear locally decodable codes and private information retrieval. In: Proceedings 17th IEEE Annual Conference on Computational Complexity, pp. 175\u2013183. IEEE (2002)"},{"issue":"3","key":"17_CR17","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 (JACM) 43(3), 431\u2013473 (1996)","journal-title":"J. ACM (JACM)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-22012-8_46","volume-title":"Automata, Languages and Programming","author":"MT Goodrich","year":"2011","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Privacy-preserving access of outsourced data via oblivious RAM simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 576\u2013587. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_46"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 157\u2013167. Society for Industrial and Applied Mathematics (2012)","DOI":"10.1137\/1.9781611973099.14"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-030-03332-3_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"SD Gordon","year":"2018","unstructured":"Gordon, S.D., Katz, J., Wang, X.: Simple and efficient two-server ORAM. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 141\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_6"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Grubbs, P., Lacharit\u00e9, M.-S., Minaud, B., Paterson, K.G.: Learning to reconstruct: statistical learning theory and encrypted database attacks. Cryptology ePrint Archive, Report 2019\/011","DOI":"10.1109\/SP.2019.00030"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Hub\u2019avcek, P., Kouck\u00fd, M., Kr\u00e1l, K., Sl\u00edvov\u00e1, V.: Stronger lower bounds for online ORAM. CoRR, abs\/1903.03385 (2019)","DOI":"10.1007\/978-3-030-36033-7_10"},{"key":"17_CR23","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: NDSS (2012)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Jacob, R., Larsen, K.G., Nielsen, J.B.: Lower bounds for oblivious data structures. In: SODA 2019 (2019)","DOI":"10.1137\/1.9781611975482.149"},{"key":"17_CR25","unstructured":"Jafargholi, Z., Larsen, K.G., Simkin, M.: Optimal oblivious priority queues and offline oblivious RAM. Cryptology ePrint Archive, Report 2019\/237 (2019). https:\/\/eprint.iacr.org\/2019\/237"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Kellaris, G., Kollios, G., Nissim, K., O\u2019Neill, A.: Generic attacks on secure outsourced databases. In: CCS 2016 (2016)","DOI":"10.1145\/2976749.2978386"},{"issue":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.jcss.2004.04.007","volume":"69","author":"I Kerenidis","year":"2004","unstructured":"Kerenidis, I., De Wolf, R.: Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69(3), 395\u2013420 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lu, S., Ostrovsky, R.: On the (in) security of hash-based oblivious RAM and a new balancing scheme. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 143\u2013156. Society for Industrial and Applied Mathematics (2012)","DOI":"10.1137\/1.9781611973099.13"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Mour, T.: Sub-logarithmic distributed oblivious ram with small block size. arXiv preprint arXiv:1802.05145 (2018)","DOI":"10.1007\/978-3-030-17253-4_1"},{"key":"17_CR30","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, pp. 364\u2013373. IEEE (1997)"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Lacharit\u00e9, M.-S., Minaud, B., Paterson, K.G.: Improved reconstruction attacks on encrypted data using range query leakage. In: IEEE S&P 2018 (2018)","DOI":"10.1109\/SP.2018.00002"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Larsen, K.G.: The cell probe complexity of dynamic range counting. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, pp. 85\u201394. ACM (2012)","DOI":"10.1145\/2213977.2213987"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Larsen, K.G.: Higher cell probe lower bounds for evaluating polynomials. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 293\u2013301. IEEE (2012)","DOI":"10.1109\/FOCS.2012.21"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Malkin, T., Weinstein, O., Yeo, K.: Lower bounds for oblivious near-neighbor search. arXiv preprint arXiv:1904.04828 (2019)","DOI":"10.1137\/1.9781611975994.68"},{"key":"17_CR35","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"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Weinstein, O., Yu, H.: Crossing the logarithmic barrier for dynamic boolean data structure lower bounds. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 978\u2013989. ACM (2018)","DOI":"10.1145\/3188745.3188790"},{"key":"17_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-36594-2_22","volume-title":"Theory of Cryptography","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: Distributed oblivious RAM for secure two-party computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 377\u2013396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_22"},{"key":"17_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63715-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Lu","year":"2017","unstructured":"Lu, S., Ostrovsky, R.: Black-box parallel garbled RAM. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 66\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_3"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Panigrahy, R., Talwar, K., Wieder, U.: Lower bounds on near neighbor search via metric expansion. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 805\u2013814. IEEE (2010)","DOI":"10.1109\/FOCS.2010.82"},{"key":"17_CR40","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Raykova, M., Yeo, K.: PanORAMa: oblivious RAM with logarithmic overhead. In: FOCS 2018 (2018)","DOI":"10.1109\/FOCS.2018.00087"},{"key":"17_CR41","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Yeo, K.: Private stateful information retrieval. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1002\u20131019. ACM (2018)","DOI":"10.1145\/3243734.3243821"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Yeo, K.: What storage access privacy is achievable with small overhead? In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 182\u2013199. ACM (2019)","DOI":"10.1145\/3294052.3319695"},{"key":"17_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-17653-2_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"G Persiano","year":"2019","unstructured":"Persiano, G., Yeo, K.: Lower bounds for differentially private RAMs. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 404\u2013434. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_14"},{"key":"17_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14623-7_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"B Pinkas","year":"2010","unstructured":"Pinkas, B., Reinman, T.: Oblivious RAM revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 502\u2013519. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_27"},{"issue":"4","key":"17_CR45","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M P\u01cetra\u015fcu","year":"2006","unstructured":"P\u01cetra\u015fcu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35(4), 932\u2013963 (2006)","journal-title":"SIAM J. Comput."},{"key":"17_CR46","unstructured":"Shi, E.: Path oblivious heap. Cryptology ePrint Archive, Report 2019\/274 (2019). https:\/\/eprint.iacr.org\/2019\/274"},{"key":"17_CR47","unstructured":"Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM. arXiv preprint arXiv:1106.3652 (2011)"},{"key":"17_CR48","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, pp. 299\u2013310. ACM (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"17_CR49","doi-asserted-by":"crossref","unstructured":"Wang, X.S., et al.: Oblivious data structures. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 215\u2013226. ACM (2014)","DOI":"10.1145\/2660267.2660314"},{"key":"17_CR50","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"},{"issue":"3","key":"17_CR51","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"AC-C Yao","year":"1981","unstructured":"Yao, A.C.-C.: Should tables be sorted? J. ACM (JACM) 28(3), 615\u2013628 (1981)","journal-title":"J. ACM (JACM)"}],"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-64375-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T01:05:18Z","timestamp":1702515918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64375-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643744","9783030643751"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64375-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","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":"71","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":"4","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":"17","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":"Due to the Corona pandemic this event was held virtually.","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"}]}}