{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:14:54Z","timestamp":1742958894584,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031092336"},{"type":"electronic","value":"9783031092343"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09234-3_30","type":"book-chapter","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T07:23:45Z","timestamp":1655450625000},"page":"605-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Oblivious Evaluation Protocol and\u00a0Conditional Disclosure of\u00a0Secrets for\u00a0DFA"],"prefix":"10.1007","author":[{"given":"Kittiphop","family":"Phalakarn","sequence":"first","affiliation":[]},{"given":"Nuttapong","family":"Attrapadung","sequence":"additional","affiliation":[]},{"given":"Kanta","family":"Matsuura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,18]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/978-3-030-26951-7_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S., Maitra, M., Yamada, S.: Attribute based encryption (and more) for nondeterministic finite automata from LWE. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 765\u2013797. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_26"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-36033-7_4","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S., Maitra, M., Yamada, S.: Attribute based encryption for deterministic finite automata from $$\\sf DLIN$$. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 91\u2013117. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_4"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"B Aiello","year":"2001","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-17659-4_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Applebaum","year":"2019","unstructured":"Applebaum, B., Beimel, A., Farr\u00e0s, O., Nir, O., Peter, N.: Secret-sharing schemes for general and uniform access structures. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 441\u2013471. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_15"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Nir, O., Peter, N.: Better secret sharing via robust conditional disclosure of secrets. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 280\u2013293 (2020)","DOI":"10.1145\/3357713.3384293"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-030-03332-3_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Peter, N.: Optimal linear multiparty conditional disclosure of secrets protocols. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 332\u2013362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_13"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-57990-6_8","volume-title":"Security and Cryptography for Networks","author":"R Bhadauria","year":"2020","unstructured":"Bhadauria, R., Hazay, C.: Multi-clients verifiable computation via conditional disclosure of secrets. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 150\u2013171. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_8"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-13739-6_4","volume-title":"Data and Applications Security and Privacy XXIV","author":"M Blanton","year":"2010","unstructured":"Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. In: Foresti, S., Jajodia, S. (eds.) DBSec 2010. LNCS, vol. 6166, pp. 49\u201364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13739-6_4"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-36594-2_28","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2013","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Cid, C.: Multi-client non-interactive verifiable computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 499\u2013518. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_28"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-22174-8_3","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"T Chou","year":"2015","unstructured":"Chou, T., Orlandi, C.: The simplest protocol for oblivious transfer. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 40\u201358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_3"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-46035-7_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"A Desai","year":"2002","unstructured":"Desai, A., Hevia, A., Yin, Y.L.: A practice-oriented treatment of pseudorandom number generators. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 368\u2013383. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_24"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-67816-0_16","volume-title":"Data Privacy Management, Cryptocurrencies and Blockchain Technology","author":"G Di Crescenzo","year":"2017","unstructured":"Di Crescenzo, G., Coan, B., Kirsch, J.: Privacy-preserving deterministic automata evaluation with encrypted data blocks. In: Garcia-Alfaro, J., Navarro-Arribas, G., Hartenstein, H., Herrera-Joancomart\u00ed, J. (eds.) ESORICS\/DPM\/CBT -2017. LNCS, vol. 10436, pp. 275\u2013294. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67816-0_16"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-03007-9_6","volume-title":"Data and Applications Security XXIII","author":"KB Frikken","year":"2009","unstructured":"Frikken, K.B.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: Gudes, E., Vaidya, J. (eds.) DBSec 2009. LNCS, vol. 5645, pp. 81\u201394. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03007-9_6"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-662-48000-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"R Gay","year":"2015","unstructured":"Gay, R., Kerenidis, I., Wee, H.: Communication complexity of conditional disclosure of secrets and attribute-based encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 485\u2013502. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_24"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"105975","DOI":"10.1016\/j.ipl.2020.105975","volume":"161","author":"ZA Gen\u00e7","year":"2020","unstructured":"Gen\u00e7, Z.A., Iovino, V., Rial, A.: The simplest protocol for oblivious transfer - revisited. Inf. Process. Lett. 161, 105975 (2020)","journal-title":"Inf. Process. Lett."},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-13013-7_20","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Hazay, C., Sorensen, J.S.: Text search protocols with simulation based security. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 332\u2013350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_20"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 151\u2013160 (1998)","DOI":"10.1145\/276698.276723"},{"issue":"4","key":"30_CR20","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM (JACM) 33(4), 792\u2013807 (1986)","journal-title":"J. ACM (JACM)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Ben-Or, M., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computing. In: Proceedings of the 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-030-26951-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Gong","year":"2019","unstructured":"Gong, J., Waters, B., Wee, H.: ABE for DFA from k-Lin. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 732\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_25"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-45727-3_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"J Gong","year":"2020","unstructured":"Gong, J., Wee, H.: Adaptively secure ABE for DFA from k-Lin and more. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 278\u2013308. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_10"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-662-46497-7_6","volume-title":"Theory of Cryptography","author":"SD Gordon","year":"2015","unstructured":"Gordon, S.D., Katz, J., Liu, F.-H., Shi, E., Zhou, H.-S.: Multi-client verifiable computation with stronger security guarantees. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 144\u2013168. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_6"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"30_CR27","first-page":"678","volume":"2013","author":"P Laud","year":"2013","unstructured":"Laud, P., Willemson, J.: Universally composable privacy preserving finite automata execution with low online and offline complexity. IACR Cryptol. ePrint Arch. 2013, 678 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"30_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-45727-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"H Lin","year":"2020","unstructured":"Lin, H., Luo, J.: Compact adaptively secure ABE from k-Lin: beyond $$\\sf {NC}^1$$ and towards $$\\sf {NL}$$. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 247\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_9"},{"issue":"2","key":"30_CR29","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Liu, T., Vaikuntanathan, V.: Breaking the circuit-size barrier in secret sharing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 699\u2013708 (2018)","DOI":"10.1145\/3188745.3188936"},{"key":"30_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-319-63688-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"T Liu","year":"2017","unstructured":"Liu, T., Vaikuntanathan, V., Wee, H.: Conditional disclosure of secrets via non-linear reconstruction. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 758\u2013790. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_25"},{"key":"30_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-78381-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"T Liu","year":"2018","unstructured":"Liu, T., Vaikuntanathan, V., Wee, H.: Towards breaking the exponential barrier for general secret sharing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 567\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_21"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Mansy, D., Rindal, P.: Endemic oblivious transfer. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 309\u2013326 (2019)","DOI":"10.1145\/3319535.3354210"},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"McQuoid, I., Rosulek, M., Roy, L.: Minimal symmetric PAKE and 1-out-of-n OT from programmable-once public functions. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 425\u2013442 (2020)","DOI":"10.1145\/3372297.3417870"},{"key":"30_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-27954-6_25","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"P Mohassel","year":"2012","unstructured":"Mohassel, P., Niksefat, S., Sadeghian, S., Sadeghiyan, B.: An efficient protocol for oblivious DFA evaluation and applications. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 398\u2013415. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_25"},{"issue":"1","key":"30_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-004-0102-6","volume":"18","author":"M Naor","year":"2005","unstructured":"Naor, M., Pinkas, B.: Computationally secure oblivious transfer. J. Cryptol. 18(1), 1\u201335 (2005)","journal-title":"J. Cryptol."},{"key":"30_CR37","doi-asserted-by":"crossref","unstructured":"Sasakawa, H., Harada, H., duVerle, D., Arimura, H., Tsuda, K., Sakuma, J.: Oblivious evaluation of non-deterministic finite automata with application to privacy-preserving virus genome detection. In: Proceedings of the 13th Workshop on Privacy in the Electronic Society, pp. 21\u201330 (2014)","DOI":"10.1145\/2665943.2665954"},{"issue":"1","key":"30_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10032-002-0082-8","volume":"5","author":"KU Schulz","year":"2002","unstructured":"Schulz, K.U., Mihov, S.: Fast string correction with Levenshtein automata. Int. J. Doc. Anal. Recogn. 5(1), 67\u201385 (2002)","journal-title":"Int. J. Doc. Anal. Recogn."},{"key":"30_CR39","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 519\u2013528 (2007)","DOI":"10.1145\/1315245.1315309"},{"key":"30_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-33167-1_30","volume-title":"Computer Security \u2013 ESORICS 2012","author":"L Wei","year":"2012","unstructured":"Wei, L., Reiter, M.K.: Third-party private DFA evaluation on encrypted files in the cloud. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 523\u2013540. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33167-1_30"},{"key":"30_CR41","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"30_CR42","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ins.2020.03.065","volume":"528","author":"C Zhao","year":"2020","unstructured":"Zhao, C., Zhao, S., Zhang, B., Jing, S., Chen, Z., Zhao, M.: Oblivious DFA evaluation on joint input and its applications. Inf. Sci. 528, 168\u2013180 (2020)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09234-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T03:11:37Z","timestamp":1727406697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09234-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031092336","9783031092343"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09234-3_30","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":"18 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 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":"acns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/acns2022\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"44","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":"5","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":"24% - 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.7","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":"5","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":"For the Workshops, 52 papers were submitted, from which 31 were accepted. Additionally they include 5 posters.","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)"}}]}}