{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:09:13Z","timestamp":1778256553574,"version":"3.51.4"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486234","type":"print"},{"value":"9783031486241","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48624-1_4","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"93-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Revocable Cryptography from\u00a0Learning with\u00a0Errors"],"prefix":"10.1007","author":[{"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7330-1539","authenticated-orcid":false,"given":"Alexander","family":"Poremba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2666-0045","authenticated-orcid":false,"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: 2009 24th Annual IEEE Conference on Computational Complexity, pp. 229\u2013242. IEEE (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"4_CR2","unstructured":"Aaronson, S.: The complexity of quantum states and transformations: from quantum money to black holes (2016)"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Liu, J., Liu, Q., Zhandry, M., Zhang, R.: New approaches for quantum copy-protection. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 526\u2013555. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_19","DOI":"10.1007\/978-3-030-84242-0_19"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Adcock, M., Cleve, R.: A quantum Goldreich-Levin theorem with cryptographic applications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 323\u2013334. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_26","DOI":"10.1007\/3-540-45841-7_26"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Kitagawa, F., Nishimaki, R., Yamada, S., Yamakawa, T.: Public key encryption with secure key leasing. arXiv preprint arXiv:2302.11663 (2023)","DOI":"10.1007\/978-3-031-30545-0_20"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, 22\u201324 May 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Ananth, P., Kaleoglu, F.: Unclonable encryption, revisited. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 299\u2013329. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_11","DOI":"10.1007\/978-3-030-90459-3_11"},{"key":"4_CR8","unstructured":"Ananth, P., Kaleoglu, F.: A note on copy-protection from random oracles. arXiv preprint arXiv:2208.12884 (2022)"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Ananth, P., Kaleoglu, F., Li, X., Liu, Q., Zhandry, M.: On the feasibility of unclonable encryption, and more. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, Part II. LNCS, pp. 212\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_8","DOI":"10.1007\/978-3-031-15979-4_8"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Ananth, P., Kaleoglu, F., Liu, Q.: Cloning games: a general framework for unclonable primitives. arXiv preprint arXiv:2302.01874 (2023)","DOI":"10.1007\/978-3-031-38554-4_3"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Ananth, P., La Placa, R.L.: Secure software leasing. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 501\u2013530. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_17","DOI":"10.1007\/978-3-030-77886-6_17"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Miles, E., Sahai, A., Zhandry, M.: Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 764\u2013791. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_27","DOI":"10.1007\/978-3-662-49896-5_27"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 192\u2013223. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_7","DOI":"10.1007\/978-3-031-38554-4_7"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Khurana, D., Poremba, A.: Publicly-verifiable deletion via target-collapsing functions. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, Part V, LNCS, vol. 14085, pp. 99\u2013128. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_4","DOI":"10.1007\/978-3-031-38554-4_4"},{"key":"4_CR16","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, p. 175 (1984)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Brakerski, Z., Kalai, Y.T.: Constructive post-quantum reductions (2022)","DOI":"10.1007\/978-3-031-15982-4_22"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE, and compact garbled circuits. Cryptology ePrint Archive, Paper 2014\/356 (2014). https:\/\/eprint.iacr.org\/2014\/356","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"4_CR19","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Circular-secure IWE suffices. Cryptology ePrint Archive, Factoring and pairings are not necessary for IO (2020)"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) IWE. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Islam, R.: Quantum encryption with certified deletion. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 92\u2013122. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_4","DOI":"10.1007\/978-3-030-64381-2_4"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Jeffery, S., Lord, S., Podder, S., Sundaram, A.: Secure software leasing without assumptions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 90\u2013120. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_4","DOI":"10.1007\/978-3-030-90459-3_4"},{"key":"4_CR23","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via oracles. In: Flammia, S.T. (ed.) 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), volume 158 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 4:1\u20134:22. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2020)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 639\u2013648. Association for Computing Machinery, New York (1996)","DOI":"10.1145\/237814.238015"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-96881-0_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Vaikuntanathan, V., Wee, H.: GGH15 beyond permutation branching programs: proofs, attacks, and candidates. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 577\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_20"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGS for p from IWE. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 68\u201379. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Coladangelo, A., Liu, J., Liu, Q., Zhandry, M.: Hidden cosets and applications to unclonable cryptography. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 556\u2013584. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_20","DOI":"10.1007\/978-3-030-84242-0_20"},{"key":"4_CR28","unstructured":"Coladangelo, A., Majenz, C., Poremba, A.: Quantum copy-protection of compute-and-compare programs in the quantum random oracle model (2020)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-90453-1_9","volume-title":"Theory of Cryptography","author":"L Devadas","year":"2021","unstructured":"Devadas, L., Quach, W., Vaikuntanathan, V., Wee, H., Wichs, D.: Succinct LWE sampling, random polynomials, and obfuscation. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 256\u2013287. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_9"},{"issue":"6","key":"4_CR30","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0375-9601(82)90084-6","volume":"92","author":"DGBJ Dieks","year":"1982","unstructured":"Dieks, D.G.B.J.: Communication by EPR devices. Phys. Lett. A 92(6), 271\u2013272 (1982)","journal-title":"Phys. Lett. A"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 361\u2013381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_22","DOI":"10.1007\/978-3-642-11799-2_22"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 736\u2013749 (2021)","DOI":"10.1145\/3406325.3451070"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4_CR34","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. Cryptology ePrint Archive, Report 2007\/432 (2007). https:\/\/eprint.iacr.org\/2007\/432"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. Cryptology ePrint Archive, Report 2013\/340 (2013). https:\/\/ia.cr\/2013\/340","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"4_CR36","unstructured":"Georgiou, M., Zhandry, M.: Unclonable decryption keys. Cryptology ePrint Archive (2020)"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 25\u201332. Association for Computing Machinery, New York (1989)","DOI":"10.1145\/73007.73010"},{"key":"4_CR38","unstructured":"Gottesman, D.: Uncloneable encryption. arXiv preprint quant-ph\/0210062 (2002)"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Certified everlasting zero-knowledge proof for QMA (2021)","DOI":"10.1007\/978-3-031-15802-5_9"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 606\u2013636. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_21","DOI":"10.1007\/978-3-030-92062-3_21"},{"key":"4_CR41","unstructured":"Intercept. How spies stole the keys to the encryption castle (2015). https:\/\/theintercept.com\/2015\/02\/19\/great-sim-heist\/"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 60\u201373 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"4_CR43","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: introducing concurrency, removing erasures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 221\u2013242. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_16","DOI":"10.1007\/3-540-45539-6_16"},{"key":"4_CR44","doi-asserted-by":"publisher","unstructured":"Kitagawa, F., Nishimaki, R.: Functional encryption with secure key leasing. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13794. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_20","DOI":"10.1007\/978-3-031-22972-5_20"},{"key":"4_CR45","doi-asserted-by":"publisher","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Secure software leasing from standard assumptions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 31\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_2","DOI":"10.1007\/978-3-030-90459-3_2"},{"key":"4_CR46","unstructured":"Liu, J., Liu, Q., Qian, L., Zhandry, M.: Collusion resistant copy-protection for watermarkable functionalities. Cryptology ePrint Archive, Paper 2022\/1429 (2022). https:\/\/eprint.iacr.org\/2022\/1429"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"key":"4_CR48","unstructured":"Poremba, A.: Quantum proofs of deletion for learning with errors (2022)"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2005)","DOI":"10.1145\/1568318.1568324"},{"key":"4_CR50","doi-asserted-by":"publisher","unstructured":"Rivest, R.L.: Can we eliminate certificate revocation lists? In: Hirchfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 178\u2013183. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055482","DOI":"10.1007\/BFb0055482"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. Cryptology ePrint Archive, Paper 2009\/285 (2009). https:\/\/eprint.iacr.org\/2009\/285","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"4_CR52","unstructured":"Stubblebine, S.: Recent-secure authentication: enforcing revocation in distributed systems. In: 2012 IEEE Symposium on Security and Privacy, p. 0224. IEEE Computer Society, Los Alamitos (1995)"},{"key":"4_CR53","doi-asserted-by":"publisher","first-page":"14","DOI":"10.22331\/q-2017-07-14-14","volume":"1","author":"M Tomamichel","year":"2017","unstructured":"Tomamichel, M., Leverrier, A.: A largely self-contained and complete security proof for quantum key distribution. Quantum 1, 14 (2017)","journal-title":"Quantum"},{"key":"4_CR54","unstructured":"Unruh, D.: Revocable quantum timed-release encryption. Cryptology ePrint Archive, Report 2013\/606 (2013). https:\/\/ia.cr\/2013\/606"},{"key":"4_CR55","doi-asserted-by":"publisher","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5","DOI":"10.1007\/978-3-030-77883-5_5"},{"issue":"1","key":"4_CR56","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983)","journal-title":"SIGACT News"},{"key":"4_CR57","doi-asserted-by":"crossref","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","DOI":"10.1038\/299802a0"},{"key":"4_CR58","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice or: quantum money from cryptographic assumptions. J. Cryptol. 34(1) (2021)","DOI":"10.1007\/s00145-020-09372-x"}],"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-48624-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:53Z","timestamp":1764118973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48624-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486234","9783031486241"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48624-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","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":"168","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":"68","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":"40% - 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":"13","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"}]}}