{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:45Z","timestamp":1766278965135,"version":"3.48.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031223679"},{"type":"electronic","value":"9783031223686"}],"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-22368-6_5","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T08:03:39Z","timestamp":1671609819000},"page":"121-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["One-Time Programs from\u00a0Commodity Hardware"],"prefix":"10.1007","author":[{"given":"Harry","family":"Eldridge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aarushi","family":"Goel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Green","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"Zinkus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Alamati, N., Branco, P., D\u00f6ttling, N., Garg, S., Hajiabadi, M., Pu, S.: Laconic private set intersection and applications. Cryptology ePrint Archive, Report 2021\/728 (2021). https:\/\/eprint.iacr.org\/2021\/728","DOI":"10.1007\/978-3-030-90456-2_4"},{"issue":"4","key":"5_CR2","first-page":"528","volume":"2021","author":"G Almashaqbeh","year":"2021","unstructured":"Almashaqbeh, G., et al.: Gage MPC: bypassing residual function leakage for non-interactive MPC. Proc. Priv. Enhanc. Technol. 2021(4), 528\u2013548 (2021)","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"5_CR3","unstructured":"Apple Inc., Secure Enclave. https:\/\/support.apple.com\/guide\/security\/secure-enclave-sec59b0b31ff\/web"},{"key":"5_CR4","unstructured":"Apple Inc., Escrow security for iCloud Keychain (2021). https:\/\/support.apple.com\/guide\/security\/escrow-security-for-icloud-keychain-sec3e341e75d\/web"},{"key":"5_CR5","unstructured":"Apple Inc., HomeKit communication security (2021). https:\/\/support.apple.com\/guide\/security\/homekit-communication-security-sec3a881ccb1\/web"},{"key":"5_CR6","unstructured":"ARM Holdings. Trusted Base System Architecture Documents. https:\/\/www.arm.com\/technologies\/trustzone-for-cortex-a\/tee-reference-documentation. Subject to Non-Disclosure Agreement"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-319-07536-5_24","volume-title":"Applied Cryptography and Network Security","author":"M Backes","year":"2014","unstructured":"Backes, M., Gerling, R.W., Gerling, S., N\u00fcrnberger, S., Schr\u00f6der, D., Simkin, M.: WebTrust \u2013 a comprehensive authenticity and integrity framework for HTTP. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 401\u2013418. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_24"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-34961-4_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M Bellare","year":"2012","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Adaptively secure garbling with applications to one-time programs and secure outsourcing. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 134\u2013153. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_10"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-63688-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"F Benhamouda","year":"2017","unstructured":"Benhamouda, F., Krawczyk, H., Rabin, T.: Robust non-interactive multiparty computation against constant-size collusion. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 391\u2013419. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_13"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bhudia, A., O\u2019Keeffe, D., Sgandurra, D., Hurley-Smith, D.: RansomClave: ransomware key management using SGX. In: The 16th International Conference on Availability, Reliability and Security (2021)","DOI":"10.1145\/3465481.3470116"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., et al.: The hunting of the SNARK. J. Cryptol. 30(4), 989\u20131066 (2017)","journal-title":"J. Cryptol."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(60)90287-4","volume":"3","author":"RC Bose","year":"1960","unstructured":"Bose, R.C., Ray-Chaudhuri, D.K.: On a class of error correcting binary group codes. Inf. Control 3(1), 68\u201379 (1960)","journal-title":"Inf. Control"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-40084-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Broadbent","year":"2013","unstructured":"Broadbent, A., Gutoski, G., Stebila, D.: Quantum one-time programs. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 344\u2013360. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_20"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MM.2019.2910104","volume":"39","author":"J Van Bulck","year":"2019","unstructured":"Van Bulck, J., et al.: Breaking virtual memory protection and the SGX ecosystem with foreshadow. IEEE Micro 39(3), 66\u201374 (2019)","journal-title":"IEEE Micro"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Athayle, A., Akhawe, D., Juels, A., Ristenpart, T.: Password typos and how to correct them securely. In: S &P 2016. IEEE (2016)","DOI":"10.1109\/SP.2016.53"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"5_CR17","unstructured":"Chen, Z.: Java Card Technology for Smart Cards: Architecture and Programmer\u2019s Guide. Addison-Wesley Longman Publishing Co., Inc (2000)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-63715-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Cho","year":"2017","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 33\u201365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_2"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.46586\/tches.v2018.i2.171-191","volume":"2018","author":"F Dall","year":"2018","unstructured":"Dall, F., et al.: CacheQuote: efficiently recovering long-term secrets of SGX EPID via cache attacks. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(2), 171\u2013191 (2018)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Delgado-Mohatar, O., Sierra-C\u00e1mara, J.M., Anguiano, E.: Blockchain-based semi-autonomous ransomware. Future Gener. Comput. Syst. 112, 589\u2013603 (2020)","DOI":"10.1016\/j.future.2020.02.037"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N., Garg, S., Goyal, V., Malavolta, G.: Laconic conditional disclosure of secrets and applications. In: Zuckerman, D., (eds.) 60th FOCS, pages 661\u2013685. IEEE Computer Society Press, November 2019","DOI":"10.1109\/FOCS.2019.00046"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Theory of Cryptography Conference (2006)","DOI":"10.1007\/11681878_14"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-319-78375-8_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Garg","year":"2018","unstructured":"Garg, S., Srinivasan, A.: Adaptively secure garbling with near optimal online complexity. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 535\u2013565. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_18"},{"issue":"3","key":"5_CR24","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":"5_CR25","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N. : Delegating computation: interactive proofs for muggles. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 113\u2013122. ACM Press, May 2008","DOI":"10.1145\/1374376.1374396"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: Annual International Cryptology Conference, pp. 39\u201356 (2008)","DOI":"10.1007\/978-3-540-85174-5_3"},{"key":"5_CR27","unstructured":"Google. Google Tensor debuts on the new Pixel 6 this fall (2021). https:\/\/blog.google\/products\/pixel\/google-tensor-debuts-new-pixel-6-fall\/"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-70500-2_18","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2017","unstructured":"Goyal, R., Goyal, V.: Overcoming cryptographic impossibility results using blockchains. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part I. LNCS, vol. 10677, pp. 529\u2013561. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_18"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-030-56784-2_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"R Goyal","year":"2020","unstructured":"Goyal, R., Vusirikala, S., Waters, B.: New constructions of hinting PRGs, OWFs with encryption, and more. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 527\u2013558. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_18"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-11799-2_19","volume-title":"Theory of Cryptography","author":"V Goyal","year":"2010","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 308\u2013326. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_19"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Harnik","year":"2005","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On robust combiners for oblivious transfer and other primitives. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 96\u2013113. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_6"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Constructions of truly practical secure protocols using standardsmartcards. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 491\u2013500. ACM Press, October 2008","DOI":"10.1145\/1455770.1455832"},{"key":"5_CR33","unstructured":"Intel. Overview on signing and whitelisting for intel software guard extension (SGX) enclaves. https:\/\/www.intel.com\/content\/dam\/develop\/external\/us\/en\/documents\/overview-signing-whitelisting-intel-sgx-enclaves-737361.pdf"},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10623-005-6343-z","volume":"38","author":"A Juels","year":"2006","unstructured":"Juels, A., Sudan, M.: A fuzzy vault scheme. Des. Codes Cryptogr. 38(2), 237\u2013257 (2006)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"5_CR35","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J Justesen","year":"1972","unstructured":"Justesen, J.: Class of constructive asymptotically good algebraic codes. IEEE Trans. Inf. Theory 18(5), 652\u2013656 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Kaptchuk, G., Green, M., Miers, I.: Giving state to the stateless: augmenting trustworthy computation with ledgers. In: NDSS 2019 ( 2019)","DOI":"10.14722\/ndss.2019.23060"},{"key":"5_CR37","unstructured":"Kensinger, T.: Google and Android have your back by protecting your backups, September 2018. https:\/\/security.googleblog.com\/2018\/10\/google-and-android-have-your-back-by.html"},{"key":"5_CR38","unstructured":"Krassovsky, S., Cadden, G., et al.: Security of End-To-End Encrypted Backups (2021). https:\/\/scontent.whatsapp.net\/v\/t39.8562-34\/241394876_546674233234181_8907137889500301879_n.pdf\/WhatsApp_Security_Encrypted_Backups_Whitepaper.pdf?ccb=1-5 &_nc_sid=2fbf2a &_nc_ohc=4K040x7GheAAX_-4c-_ &_nc_ht=scontent.whatsapp.net &oh=01_AVxDv1cRlVElvg0Fv89URSU_XOQUupw70bDPw6o2w0LEWg &oe=6211F5FC"},{"key":"5_CR39","unstructured":"Krsti\u0107, I.: Behind the scenes with iOS security (2016). https:\/\/www.blackhat.com\/docs\/us-16\/materials\/us-16-Krstic.pdf"},{"key":"5_CR40","unstructured":"Lund, J.: December 2019 https:\/\/signal.org\/blog\/secure-value-recovery\/. Accessed 2 May 2022"},{"key":"5_CR41","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Pub. Co. (1977)"},{"key":"5_CR42","doi-asserted-by":"crossref","unstructured":"McKeen, F., et al.: Intel\u00ae software guard extensions (intel\u00ae sgx) support for dynamic memory management inside an enclave. In: HASP 2016. ACM (2016)","DOI":"10.1145\/2948618.2954331"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-70936-7_22","volume-title":"Theory of Cryptography","author":"R Meier","year":"2007","unstructured":"Meier, R., Przydatek, B., Wullschleger, J.: Robuster combiners for oblivious transfer. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 404\u2013418. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_22"},{"issue":"4","key":"5_CR44","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Murdock, K., Oswald, D.F., Garcia, F.D., Van Bulck, J., Gruss, D., Piessens, F.: Plundervolt: software-based fault injection attacks against intel SGX. In: S &P 2020. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00057"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Pinto, S., Santos, N.: Demystifying arm trustzone: a comprehensive survey. ACM Comput. Surv. (CSUR) 51(6) (2019)","DOI":"10.1145\/3291047"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"M Rosulek","year":"2021","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? Beating the half-gates lower bound for garbled circuits. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"5_CR48","unstructured":"Savagaonkar, U., Porter, N., Taha, N., Serebrin, B., Mueller, N.: Titan in depth: Security in plaintext (2017). https:\/\/cloud.google.com\/blog\/products\/identity-security\/titan-in-depth-security-in-plaintext"},{"key":"5_CR49","unstructured":"Twilio (2022). https:\/\/www.twilio.com\/sms\/pricing\/us"},{"key":"5_CR50","unstructured":"Xu, Q.: ARM-software\/tf-issues (2017). https:\/\/github.com\/ARM-software\/tf-issues\/issues\/534"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pages 162\u2013167. IEEE Computer Society Press, October 1986","DOI":"10.1109\/SFCS.1986.25"},{"key":"5_CR52","unstructured":"yubico. YubiHSM 2. https:\/\/www.yubico.com\/product\/yubihsm-2\/"}],"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-22368-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:04Z","timestamp":1766278924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22368-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223679","9783031223686"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22368-6_5","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"}]}}