{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:18:30Z","timestamp":1766049510754,"version":"3.40.3"},"publisher-location":"Cham","reference-count":83,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648367"},{"type":"electronic","value":"9783030648374"}],"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-64837-4_5","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T16:02:55Z","timestamp":1607184175000},"page":"128-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Libert","sequence":"first","affiliation":[]},{"given":"Khoa","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Passel\u00e8gue","sequence":"additional","affiliation":[]},{"given":"Radu","family":"Titiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Bourse, F., De Caro, A., Pointcheval, D.: Simple functional encryption schemes for inner products. In: PKC (2015)","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Eurocrypt (2010)","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Libert, B., Stehl\u00e9, D.: Fully secure functional encryption for inner products from standard assumptions. In: Crypto (2016)","DOI":"10.1007\/978-3-662-53015-3_12"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff, J., Peikert, C.: Circular and KDM security for identity-based encryption. In: PKC (2012)","DOI":"10.1007\/978-3-642-30057-8_20"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Key-dependent message security: Generic amplification and completeness theorems. J. Cryptol. 27(3), 53 (2013)","DOI":"10.1007\/s00145-013-9149-6"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Cash, C. Peikert, D., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Crypto (2009)","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Asharov, G, Jain, A., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. Cryptology ePrint Archive: Report 2011\/613 (2012)","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B., Haitner, I., Hofheinz, D., Ishai, Y.: Bounded key-dependent message security. In: Eurocrypt (2010)","DOI":"10.1007\/978-3-642-13190-5_22"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Barrington, D.: Bounded-width polynomial-size branching programs recognize exactly those languages in nc1. In STOC, (1986)","DOI":"10.1145\/12130.12131"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hofheinz, D., Yilek, S.: Possibility and impossibility results for encryption and commitment secure under selective opening. In: Eurocrypt (2009)","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM-CCS (1993)","DOI":"10.1145\/168588.168596"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., et al.: Why \u201cFiat-Shamir for proof\u201d lacks a proof. In: TCC (2013)","DOI":"10.1007\/978-3-642-36594-2_11"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Black, J., Rogaway, P. Shrimpton, T.: Encryption-scheme security in the presence of key-dependent messages. In: SAC (2002)","DOI":"10.1007\/3-540-36492-7_6"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Secure identity based encryption without random oracles. In: Crypto (2004)","DOI":"10.1007\/978-3-540-28628-8_27"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Eurocrypt (2014)","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"5_CR16","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from Decision Diffie-Hellman. In: Crypto (2008)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Boyen, X., Li, Q.: Towards tightly secure lattice short signature and ID-based encryption. In: Asiacrypt (2016)","DOI":"10.1007\/978-3-662-53890-6_14"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Boyen, X., Li, Q.: Almost tight multi-instance multi-ciphertext identity-based encryption on lattices. In: ACNS (2018)","DOI":"10.1007\/978-3-319-93387-0_28"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Boyle, E., Segev, G., Wichs, D.: Fully leakage-resilient signatures. In: Eurocrypt (2011)","DOI":"10.1007\/978-3-642-20465-4_7"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability (or: Quadratic residuosity strikes back). In: Crypto (2010)","DOI":"10.1007\/978-3-642-14623-7_1"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Goldwasser, S., Tauman Kalai, Y.: Black-box circular-secure encryption beyond affine functions. In :TCC (2011)","DOI":"10.1007\/978-3-642-19571-6_13"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: ITCS (2014)","DOI":"10.1145\/2554797.2554799"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Eurocrypt (2001)","DOI":"10.1007\/3-540-44987-6_7"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"J. Camensich, N. Chandran, and V. Shoup. A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. In Eurocrypt, 2009","DOI":"10.1007\/978-3-642-01001-9_20"},{"key":"5_CR25","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G., Rothblum, R.: Fiat-Shamir from simpler assumptions. Cryptology ePrint Archive: Report 2018\/1004"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: STOC (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Canetti, R., Chen, Y., Reyzin, L., Rothblum, R.: Fiat-Shamir and correlation intractability from strong KDM-secure encryption. In: Eurocrypt (2018)","DOI":"10.1007\/978-3-319-78381-9_4"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisted. J. ACM 51(4) (2004)","DOI":"10.1145\/1008731.1008734"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Eurocrypt (2004)","DOI":"10.1007\/978-3-540-24676-3_13"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lombardi, A., Wichs, D.: Fiat-Shamir: From Practice to Theory, Part II (NIZK and Correlation Intractability from Circular-Secure FHE). Cryptology ePrint Archive: Report 2018\/1248","DOI":"10.1145\/3313276.3316380"},{"key":"5_CR31","unstructured":"Chase, M., Lysyanskaya, A.: Simulatable VRFs with applications to multi-theorem NIZK. In: Crypto (2007)"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Choudhuri, A., Hubacek, P., Pietrzak, K., Rosen, A., Rothblum, G.: Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: STOC (2019)","DOI":"10.1145\/3313276.3316400"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Ciampi, M., Parisella, R., Ventury, D.: On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs. In: SCN (2020)","DOI":"10.1007\/978-3-030-57990-6_33"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Couteau, G., Hofheinz, D.: Designated-verifier pseudorandom generators, and their applications. In: Eurocrypt (2019)","DOI":"10.1007\/978-3-030-17656-3_20"},{"key":"5_CR35","unstructured":"Cramer, R.: Modular design of secure, yet practical cryptographic protocols. Ph.D. thesis, University of Amsterdam (1996)"},{"key":"5_CR36","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmaekers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Crypto (1994)"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Eurocrypt (2002)","DOI":"10.1007\/3-540-46035-7_4"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Eurocrypt (2000)","DOI":"10.1007\/3-540-45539-6_30"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero-knowledge. In: Crypto (2001)","DOI":"10.1007\/3-540-44647-8_33"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"De Santis, A., Yung, M.: Cryptograpic applications of the non-interactive metaproof and many-prover systems. In: Crypto (1990)","DOI":"10.1007\/3-540-38424-3_27"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N.: Low-noise LPN: KDM secure public key encryption and sample amplification. In: PKC (2015)","DOI":"10.1007\/978-3-662-46447-2_27"},{"key":"5_CR42","doi-asserted-by":"crossref","unstructured":"Feige, U., Lapidot, D., Shamir,A.: Multiple non-interactive zero-knowledge under general assumptions. SIAM J. Comput. 29(1) (1999)","DOI":"10.1137\/S0097539792230010"},{"key":"5_CR43","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Crypto (1986)"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Pointcheval, D.: Threshold cryptosystems secure against chosen-ciphertext attacks. In: Asiacrypt (2001)","DOI":"10.1007\/3-540-45682-1_21"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Freire, E., Hofheinz, D., Paterson, K., Striecks, C.: Programmable hash functions in the multilinear setting. In: Crypto (2013)","DOI":"10.1007\/978-3-642-40041-4_28"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Crypto (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing (1989)","DOI":"10.1137\/0218012"},{"key":"5_CR49","unstructured":"Goldwasser, S., Tauman Kalai, Y.: On the (in)security of the Fiat-Shamir paradigm. In: FOCS (2003)"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: New techniques for noninteractive zero-knowledge. J. ACM (2012)","DOI":"10.1145\/2220357.2220358"},{"key":"5_CR51","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Eurocrypt (2008)"},{"key":"5_CR52","unstructured":"Halevi, S. Myers, S., Rackoff, C.: On seed-incompressible functions. In: TCC (2008)"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Han, S., Liu, S., Lyu, L.: Efficient KDM-CCA secure public-key encryption for polynomial functions. In: Asiacrypt (2016)","DOI":"10.1007\/978-3-662-53890-6_11"},{"key":"5_CR54","doi-asserted-by":"crossref","unstructured":"Hara, K., Matsuda, T., Hanaoka, G., Tanaka, K.: Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions. In: SCN (2018)","DOI":"10.1007\/978-3-319-98113-0_8"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Hofheinz, D.. All-but-many lossy trapdoor functions. In: Eurocrypt (2012)","DOI":"10.1007\/978-3-642-29011-4_14"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"Hofheinz, D.: Circular chosen-ciphertext security with compact ciphertexts. In: Eurocrypt (2013)","DOI":"10.1007\/978-3-642-38348-9_31"},{"key":"5_CR57","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., Jager, T.: Tightly secure signatures and public-key encryption. In: Crypto (2012)","DOI":"10.1007\/978-3-642-32009-5_35"},{"key":"5_CR58","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Lombardi, A.: Cryptographic hashing from strong one-way functions (or: One-way product functions and their applications). In: FOCS (2018)","DOI":"10.1109\/FOCS.2018.00085"},{"key":"5_CR59","doi-asserted-by":"crossref","unstructured":"Jager, T.: Verifiable random functions from weaker assumptions. In: TCC (2015)","DOI":"10.1007\/978-3-662-46497-7_5"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Kiltz, E.: Chosen-ciphertext security from tag-based encryption. In: TCC (2006)","DOI":"10.1007\/11681878_30"},{"key":"5_CR61","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Matsuda, T.: CPA-to-CCA transformation for KDM security. In: TCC (2019)","DOI":"10.1007\/978-3-030-36033-7_5"},{"key":"5_CR62","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Matsuda, V, Tanaka, K.: Simple and efficient KDM-CCA secure public key encryption. In: Asiacrypt (2019)","DOI":"10.1007\/978-3-030-34618-8_4"},{"key":"5_CR63","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Tanaka, K.: A framework for achieving KDM-CCA secure public-key encryption. In: Asiacrypt (2018)","DOI":"10.1007\/978-3-030-03329-3_5"},{"key":"5_CR64","doi-asserted-by":"crossref","unstructured":"Lai, Q., Liu, F., Wang, Z.: Almost tight security in lattices with polynomial moduli - PRF, IBE, all-but-many LTF, and more. In: PKC (2020)","DOI":"10.1007\/978-3-030-45374-9_22"},{"key":"5_CR65","doi-asserted-by":"crossref","unstructured":"Libert, B., Nguyen, K., Passel\u00e8gue, A., Titiu, R.: Simulation-sound arguments for LWE and applications to KDM-CCA2 security. Cryptology ePrint Archive, Report 2019\/908 (2020). https:\/\/eprint.iacr.org\/2019\/908","DOI":"10.1007\/978-3-030-64837-4_5"},{"key":"5_CR66","doi-asserted-by":"crossref","unstructured":"Libert, B., Peters, T., Joye, M., Yung, M.: Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures. In: Eurocrypt (2014)","DOI":"10.1007\/978-3-642-55220-5_29"},{"key":"5_CR67","doi-asserted-by":"crossref","unstructured":"Libert, B., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE. In: Crypto (2017)","DOI":"10.1007\/978-3-319-63697-9_12"},{"key":"5_CR68","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Quach, W., Rothblum, R., Wichs, D., Wu, D.: New constructions of reusable designated-verifier NIZKs. In: Crypto (2019)","DOI":"10.1007\/978-3-030-26954-8_22"},{"key":"5_CR69","doi-asserted-by":"crossref","unstructured":"Lu, X., Li, B., Jia, D.: KDM-CCA security from RKA secure authenticated encryption. In: Eurocrypt (2015)","DOI":"10.1007\/978-3-662-46800-5_22"},{"key":"5_CR70","unstructured":"Lyubashevsky, V.: Lattice-Based Identification Schemes Secure Under Active Attacks. In: PKC (2008)"},{"key":"5_CR71","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Asiacrypt (2009)","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"5_CR72","doi-asserted-by":"crossref","unstructured":"MacKenzie, P., Yang, K.: On simulation-sound trapdoor commitments. In: Eurocrypt (2004)","DOI":"10.1007\/978-3-540-24676-3_23"},{"key":"5_CR73","doi-asserted-by":"crossref","unstructured":"Malkin, T., Teranishi, I., Yung, M.: Efficient circuit-size independent public key encryption with KDM security. In: Eurocrypt (2012)","DOI":"10.1007\/978-3-642-20465-4_28"},{"key":"5_CR74","doi-asserted-by":"crossref","unstructured":"Micciancio,D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Eurocrypt (2012)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"5_CR75","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC (1990)","DOI":"10.1145\/100216.100273"},{"key":"5_CR76","doi-asserted-by":"crossref","unstructured":"Peikert, C., Shiehian, S.: Non-interactive zero knowledge for NP from (plain) learning with errors. In: Crypto (2019)","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"5_CR77","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Crypto (2008)"},{"key":"5_CR78","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3) (2000)","DOI":"10.1007\/s001450010003"},{"key":"5_CR79","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"5_CR80","unstructured":"Sahai, A.: Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security. In: FOCS (1999)"},{"key":"5_CR81","unstructured":"Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Crypto (1989)"},{"key":"5_CR82","doi-asserted-by":"crossref","unstructured":"Tauman Kalai, Y., Rothblum, G., Rothblum, R.: From obfuscation to the security of Fiat-Shamir for proofs. In: Crypto (2017)","DOI":"10.1007\/978-3-319-63715-0_8"},{"key":"5_CR83","doi-asserted-by":"crossref","unstructured":"Yamada, S.: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Crypto (2017)","DOI":"10.1007\/978-3-319-63697-9_6"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64837-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:27:20Z","timestamp":1710354440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64837-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648367","9783030648374"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64837-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2020\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"316","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":"85","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":"27% - 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":"19","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":"The conference will take place virtually due to the COVID-19 pandemic.","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"}]}}