{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:59:52Z","timestamp":1743148792840,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031230974"},{"type":"electronic","value":"9783031230981"}],"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-23098-1_6","type":"book-chapter","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T14:04:12Z","timestamp":1672754652000},"page":"87-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Survey on\u00a0Discrete Gaussian Samplers in\u00a0Lattice Based Cryptography"],"prefix":"10.1007","author":[{"given":"Jiaxin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Simin","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9033-2575","authenticated-orcid":false,"given":"Jiageng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Weizhi","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"6_CR1","first-page":"1610","volume":"67","author":"C Aguilar-Melchor","year":"2018","unstructured":"Aguilar-Melchor, C., Ricosset, T.: Cdt-based gaussian sampling: From multi to double precision. IEEE Trans. Comput. 67, 1610\u20131621 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2017","unstructured":"Bai, S., Lepoint, T., Roux-Langlois, A., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the r\u00e9nyi divergence rather than the statistical distance. J. Cryptol. 31, 610\u2013640 (2017)","journal-title":"J. Cryptol."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Barthe, G., Bela\u00efd, S., Espitau, T., Fouque, P.A., Rossi, M., Tibouchi, M.: Galactics: Gaussian sampling for lattice-based constant- time implementation of cryptographic signatures, revisited. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (2019)","DOI":"10.1145\/3319535.3363223"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-81293-5_11","volume-title":"Post-Quantum Cryptography","author":"P Bert","year":"2021","unstructured":"Bert, P., Eberhart, G., Prabel, L., Roux-Langlois, A., Sabt, M.: Implementation of lattice trapdoors on modules and applications. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 195\u2013214. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_11"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-65411-5_29","volume-title":"Cryptology and Network Security","author":"S Brannigan","year":"2020","unstructured":"Brannigan, S., O\u2019Neill, M., Khalid, A., Rafferty, C.: A secure algorithm for rounded gaussian sampling. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 2020. LNCS, vol. 12579, pp. 593\u2013612. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_29"},{"key":"6_CR6","unstructured":"Brannigan, S., et al.: An investigation of sources of randomness within discrete gaussian sampling. IACR Cryptol. ePrint Arch. 2017, 298 (2017)"},{"key":"6_CR7","unstructured":"Brannigan, S.: Secure Gaussian sampling for lattice-based signatures: new directions for reaching high standard deviation. Ph.D. thesis, Queen\u2019s University Belfast (2021)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Buchmann, J.A., Cabarcas, D., G\u00f6pfert, F., H\u00fclsing, A., Weiden, P.: Discrete ziggurat: a time-memory trade-off for sampling from a gaussian distribution over the integers. IACR Cryptol. ePrint Arch. 2013, 510 (2013)","DOI":"10.1007\/978-3-662-43414-7_20"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Devroye, L.: Non-uniform random variate generation (1986)","DOI":"10.1007\/978-1-4613-8643-8"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Du, C., Bai, G.: Towards efficient discrete gaussian sampling for lattice-based cryptography. In: 2015 25th International Conference on Field Programmable Logic and Applications (FPL), pp. 1\u20136 (2015)","DOI":"10.1109\/FPL.2015.7293949"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"106246","DOI":"10.1016\/j.ipl.2022.106246","volume":"176","author":"Y Du","year":"2022","unstructured":"Du, Y., Fan, B., Wei, B.: A constant-time sampling algorithm for binary gaussian distribution over the integers. Inf. Process. Lett. 176, 106246 (2022)","journal-title":"Inf. Process. Lett."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s00180-021-01136-w","volume":"37","author":"Y Du","year":"2022","unstructured":"Du, Y., Fan, B., Wei, B.: An improved exact sampling algorithm for the standard normal distribution. Comput. Stat. 37, 721\u2013737 (2022)","journal-title":"Comput. Stat."},{"key":"6_CR13","first-page":"1","volume":"62","author":"Y Du","year":"2017","unstructured":"Du, Y., Wei, B., Zhang, H.: A rejection sampling algorithm for off-centered discrete gaussian distributions over the integers. Sci. China Inf. Sci. 62, 1\u20133 (2017)","journal-title":"Sci. China Inf. Sci."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians. IACR Cryptol. ePrint Arch. 2013, 383 (2013)","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-45724-2_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Ducas","year":"2020","unstructured":"Ducas, L., Galbraith, S., Prest, T., Yu, Y.: Integral matrix gram root and lattice gaussian sampling without floats. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 608\u2013637. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_21"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-34961-4_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"L Ducas","year":"2012","unstructured":"Ducas, L., Nguyen, P.Q.: Faster gaussian lattice sampling using lazy floating-point arithmetic. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 415\u2013432. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_26"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Ducas, L., Prest, T.: Fast fourier orthogonalization. In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (2015)","DOI":"10.1145\/2930889.2930923"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00200-014-0218-3","volume":"25","author":"NC Dwarakanath","year":"2014","unstructured":"Dwarakanath, N.C., Galbraith, S.D.: Sampling from discrete gaussians for lattice-based cryptography on a constrained device. Appl. Algebra Eng. Commun. Comput. 25, 159\u2013180 (2014)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-031-07082-2_9","volume-title":"Advances in Cryptology","author":"T Espitau","year":"2021","unstructured":"Espitau, T., et al.: MITAKA: a simpler, parallelizable, maskable variant of FALCON. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 222\u2013253. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_9"},{"key":"6_CR20","first-page":"1","volume":"60","author":"J Foll\u00e1th","year":"2014","unstructured":"Foll\u00e1th, J.: Gaussian sampling in lattice based cryptography. Tatra Mount. Math. Publ. 60, 1\u201323 (2014)","journal-title":"Tatra Mount. Math. Publ."},{"key":"6_CR21","unstructured":"Fouque, P.A., et al.: Falcon: Fast-Fourier lattice-based compact signatures over NTRU (2019)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-78381-9_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"N Genise","year":"2018","unstructured":"Genise, N., Micciancio, D.: Faster gaussian sampling for trapdoor lattices with arbitrary modulus. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 174\u2013203. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_7"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"G\u00fcr, K.D., Polyakov, Y., Rohloff, K.R., Ryan, G.W., Sava\u015f, E.: Implementation and evaluation of improved gaussian sampling for lattice trapdoors. In: Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (2017)","DOI":"10.1145\/3267973.3267975"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1109\/TC.2016.2642962","volume":"67","author":"J Howe","year":"2018","unstructured":"Howe, J., Khalid, A., Rafferty, C., Regazzoni, F., O\u2019Neill, M.: On practical discrete gaussian samplers for lattice-based cryptography. IEEE Trans. Comput. 67, 322\u2013334 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Howe, J., O\u2019Neill, M.: GLITCH: a discrete gaussian testing suite for lattice-based cryptography. In: SECRYPT (2017)","DOI":"10.5220\/0006412604130419"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-030-44223-1_4","volume-title":"Post-Quantum Cryptography","author":"J Howe","year":"2020","unstructured":"Howe, J., Prest, T., Ricosset, T., Rossi, M.: Isochronous gaussian sampling: from\u00a0inception to implementation. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 53\u201371. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_4"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Lange, T., Smeets, K.: Rounded gaussians - fast and secure constant-time sampling for lattice-based crypto. IACR Cryptol. ePrint Arch. 2017, 1025 (2017)","DOI":"10.1007\/978-3-319-76581-5_25"},{"key":"6_CR29","first-page":"1810","volume":"71","author":"E Karabulut","year":"2022","unstructured":"Karabulut, E., Alkim, E., Aysu, A.: Efficient, flexible, and constant-time gaussian sampling hardware for lattice cryptography. IEEE Trans. Comput. 71, 1810\u20131823 (2022)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1109\/TC.2018.2814587","volume":"67","author":"A Karmakar","year":"2018","unstructured":"Karmakar, A., Roy, S.S., Reparaz, O., Vercauteren, F., Verbauwhede, I.M.R.: Constant-time discrete gaussian sampling. IEEE Trans. Comput. 67, 1561\u20131571 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Karmakar, A., Roy, S.S., Vercauteren, F., Verbauwhede, I.M.R.: Pushing the speed limit of constant-time discrete gaussian sampling. a case study on the falcon signature scheme. In: 2019 56th ACM\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2019)","DOI":"10.1145\/3316781.3317887"},{"key":"6_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2710016","volume":"42","author":"CFF Karney","year":"2016","unstructured":"Karney, C.F.F.: Sampling exactly from the normal distribution. ACM Trans. Math. Softw. (TOMS) 42, 1\u201314 (2016)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"6_CR33","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA 2000 (2000)"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Prest, T.: Quadratic time, linear space algorithms for gram-schmidt orthogonalization and gaussian sampling in structured lattices. IACR Cryptol. ePrint Arch. 2015, 257 (2015)","DOI":"10.1007\/978-3-662-46800-5_30"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-61204-1_1","volume-title":"Applied Cryptography and Network Security","author":"C Aguilar-Melchor","year":"2017","unstructured":"Aguilar-Melchor, C., Albrecht, M.R., Ricosset, T.: Sampling from arbitrary centered discrete gaussians for lattice-based cryptography. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 3\u201319. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_1"},{"key":"6_CR37","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 372\u2013381 (2004)"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. IACR Cryptol. ePrint Arch. 2011, 501 (2011)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Walter, M.: Gaussian sampling over the integers: efficient, generic, constant-time. IACR Cryptol. ePrint Arch. 2017, 259 (2017)","DOI":"10.1007\/978-3-319-63715-0_16"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"More, S., Katti, R.S.: Discrete gaussian sampling for low-power devices. In: 2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM), pp. 181\u2013186 (2015)","DOI":"10.1109\/PACRIM.2015.7334831"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 80\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"P\u00f6ppelmann, T., Ducas, L., G\u00fcneysu, T.: Enhanced lattice-based signatures on reconfigurable hardware. IACR Cryptol. ePrint Arch. 2014, 254 (2014)","DOI":"10.1007\/978-3-662-44709-3_20"},{"key":"6_CR43","unstructured":"Prest, T., Ricosset, T., Rossi, M.: Simple, fast and constant-time gaussian sampling over the integers for falcon (2019)"},{"key":"6_CR44","unstructured":"Roy, S.S., Reparaz, O., Vercauteren, F., Verbauwhede, I.M.R.: Compact and side channel secure discrete gaussian sampling. IACR Cryptol. ePrint Arch. 2014, 591 (2014)"},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-662-43414-7_19","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"S Sinha Roy","year":"2014","unstructured":"Sinha Roy, S., Vercauteren, F., Verbauwhede, I.: High precision discrete gaussian sampling on FPGAs. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 383\u2013401. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_19"},{"key":"6_CR46","first-page":"1","volume":"5","author":"S Sun","year":"2021","unstructured":"Sun, S., Zhou, Y., Ji, Y.S., Zhang, R., Tao, Y.: Generic, efficient and isochronous gaussian sampling over the integers. Cybersecurity 5, 1\u201322 (2021)","journal-title":"Cybersecurity"},{"key":"6_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-23696-0_9","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2019","author":"M Walter","year":"2019","unstructured":"Walter, M.: Sampling the integers with low relative error. In: Buchmann, J., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2019. LNCS, vol. 11627, pp. 157\u2013180. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23696-0_9"},{"key":"6_CR48","unstructured":"Weiden, P., H\u00fclsing, A., Cabarcas, D., Buchmann, J.A.: Instantiating treeless signature schemes. IACR Cryptol. ePrint Arch. 2013, 65 (2013)"},{"key":"6_CR49","doi-asserted-by":"publisher","first-page":"378","DOI":"10.3390\/math9040378","volume":"9","author":"S Xie","year":"2021","unstructured":"Xie, S., Zhuang, S., Du, Y.: Improved bernoulli sampling for discrete gaussian distributions over the integers. Mathematics 9, 378 (2021)","journal-title":"Mathematics"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","first-page":"498","volume-title":"Public-Key Cryptography","author":"S Zhang","year":"2021","unstructured":"Zhang, S., Yu, Y.: Towards a simpler lattice gadget toolkit. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022. LNCS, vol. 13177, pp. 498\u2013520. Springer, Cham (2021)"},{"key":"6_CR51","unstructured":"Zhao, K.: Efficient Implementation Techniques for Lattice-based Cryptosystems. Ph.D. thesis, Monash University (2022)"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-44223-1_16","volume-title":"Post-Quantum Cryptography","author":"RK Zhao","year":"2020","unstructured":"Zhao, R.K., Steinfeld, R., Sakzad, A.: COSAC: COmpact and scalable arbitrary-centered discrete gaussian sampling over integers. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 284\u2013303. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_16"},{"key":"6_CR53","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TC.2019.2940949","volume":"69","author":"RK Zhao","year":"2020","unstructured":"Zhao, R.K., Steinfeld, R., Sakzad, A.: FACCT: fast, compact, and constant-time discrete Gaussian sampler over integers. IEEE Trans. Comput. 69, 126\u2013137 (2020)","journal-title":"IEEE Trans. Comput."}],"container-title":["Communications in Computer and Information Science","Emerging Information Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23098-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T14:59:45Z","timestamp":1728658785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23098-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031230974","9783031230981"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23098-1_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Emerging Information Security and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eisa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eisa.compute.dtu.dk\/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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","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":"13","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":"37% - 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":"3","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 COVID-19, EISA 2022 was held fully online.","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)"}}]}}