{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:59:19Z","timestamp":1742997559906,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030299583"},{"type":"electronic","value":"9783030299590"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-29959-0_29","type":"book-chapter","created":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T23:04:10Z","timestamp":1568502250000},"page":"595-615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Symmetric-Key Corruption Detection: When XOR-MACs Meet Combinatorial Group Testing"],"prefix":"10.1007","author":[{"given":"Kazuhiko","family":"Minematsu","sequence":"first","affiliation":[]},{"given":"Norifumi","family":"Kamiya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,15]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Frikken, K.B., Blanton, M., Cho, Y.: Private combinatorial group testing. In: AsiaCCS, pp. 312\u2013320. ACM (2008)","DOI":"10.1145\/1368310.1368355"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: FOCS, pp. 394\u2013403. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography and application to virus protection. In: STOC, pp. 45\u201356. ACM (1995)","DOI":"10.1145\/225058.225080"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"Advances in Cryptology \u2014 CRYPT0 1995","author":"M Bellare","year":"1995","unstructured":"Bellare, M., Gu\u00e9rin, R., Rogaway, P.: XOR MACs: new methods for message authentication using finite pseudorandom functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 15\u201328. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_2"},{"issue":"3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jcss.1999.1694","volume":"61","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. J. Comput. Syst. Sci. 61(3), 362\u2013399 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44598-6_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"J Black","year":"2000","unstructured":"Black, J., Rogaway, P.: CBC MACs for arbitrary-length messages: the three-key constructions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 197\u2013215. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_12"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-46035-7_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 384\u2013397. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_25"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-642-22685-4_50","volume-title":"Computing and Combinatorics","author":"A De Bonis","year":"2011","unstructured":"De Bonis, A., Di Crescenzo, G.: Combinatorial group testing for corruption localizing hashing. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 579\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22685-4_50"},{"issue":"1\u20132","key":"29_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2012.07.022","volume":"161","author":"M Cheraghchi","year":"2013","unstructured":"Cheraghchi, M.: Noise-resilient group testing: limitations and constructions. Discrete Appl. Math. 161(1\u20132), 81\u201395 (2013)","journal-title":"Discrete Appl. Math."},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-642-32205-1_39","volume-title":"Digital Forensics and Watermarking","author":"G Di Crescenzo","year":"2012","unstructured":"Di Crescenzo, G., Arce, G.: Data forensics constructions from cryptographic hashing and coding. In: Shi, Y.Q., Kim, H.-J., Perez-Gonzalez, F. (eds.) IWDW 2011. LNCS, vol. 7128, pp. 494\u2013509. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32205-1_39"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Crescenzo, G.D., Ge, R., Arce, G.R.: Design and analysis of DBMAC, an error localizing message authentication code. In: GLOBECOM, pp. 2224\u20132228. IEEE (2004)","DOI":"10.1109\/GLOCOM.2004.1378404"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-04444-1_30","volume-title":"Computer Security \u2013 ESORICS 2009","author":"G Di Crescenzo","year":"2009","unstructured":"Di Crescenzo, G., Jiang, S., Safavi-Naini, R.: Corruption-localizing hashing. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 489\u2013504. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04444-1_30"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Crescenzo, G.D., Vakil, F.: Cryptographic hashing for virus localization. In: WORM, pp. 41\u201348. ACM Press (2006)","DOI":"10.1145\/1179542.1179550"},{"issue":"4","key":"29_CR16","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. Ann. Math. Stat. 14(4), 436\u2013440 (1943)","journal-title":"Ann. Math. Stat."},{"key":"29_CR17","series-title":"Applied Mathematics","volume-title":"Combinatorial Group Testing and Its Applications","author":"D Du","year":"2000","unstructured":"Du, D., Hwang, F.: Combinatorial Group Testing and Its Applications. Applied Mathematics. World Scientific, Singapore (2000)"},{"issue":"4","key":"29_CR18","first-page":"229","volume":"12","author":"AG D\u00fdachkov","year":"1983","unstructured":"D\u00fdachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Probl. Control. Inf. Theory 12(4), 229\u2013242 (1983)","journal-title":"Probl. Control. Inf. Theory"},{"issue":"16","key":"29_CR19","doi-asserted-by":"publisher","first-page":"4396","DOI":"10.1109\/TSP.2015.2446433","volume":"63","author":"A Emad","year":"2015","unstructured":"Emad, A., Milenkovic, O.: Poisson group testing: a probabilistic model for boolean compressed sensing. IEEE Trans. Signal Process. 63(16), 4396\u20134410 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"29_CR20","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1137\/050631847","volume":"36","author":"D Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comput. 36(5), 1360\u20131375 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"29_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of R others. Israel J. Math. 51(1), 79\u201389 (1985)","journal-title":"Israel J. Math."},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11496137_15","volume-title":"Applied Cryptography and Network Security","author":"MT Goodrich","year":"2005","unstructured":"Goodrich, M.T., Atallah, M.J., Tamassia, R.: Indexing information for data forensics. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 206\u2013221. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_15"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-99807-7_22","volume-title":"Information Security Practice and Experience","author":"S Hirose","year":"2018","unstructured":"Hirose, S., Shikata, J.: Non-adaptive group-testing aggregate MAC scheme. In: Su, C., Kikuchi, H. (eds.) ISPEC 2018. LNCS, vol. 11125, pp. 357\u2013372. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99807-7_22"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Inan, H.A., Kairouz, P., \u00d6zg\u00fcr, A.: Sparse group testing codes for low-energy massive random access. In: Allerton, pp. 658\u2013665. IEEE (2017)","DOI":"10.1109\/ALLERTON.2017.8262800"},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-39887-5_11","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: OMAC: one-key CBC MAC. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 129\u2013153. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_11"},{"key":"29_CR26","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and Their Codes","author":"EF Assmus","year":"1992","unstructured":"Assmus, E.F., Key, J.D.: Designs and Their Codes. Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992)"},{"issue":"4","key":"29_CR27","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1109\/TIT.2007.892770","volume":"53","author":"N Kamiya","year":"2007","unstructured":"Kamiya, N.: High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes. IEEE Trans. Inf. Theory 53(4), 1444\u20131459 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-79263-5_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"J Katz","year":"2008","unstructured":"Katz, J., Lindell, A.Y.: Aggregate message authentication codes. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 155\u2013169. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79263-5_10"},{"issue":"4","key":"29_CR29","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10(4), 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M Liskov","year":"2002","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 31\u201346. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_3"},{"issue":"1\u20133","key":"29_CR31","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(95)00296-9","volume":"162","author":"AJ Macula","year":"1996","unstructured":"Macula, A.J.: A simple construction of d-disjunct matrices with certain constant weights. Discrete Math. 162(1\u20133), 311\u2013312 (1996)","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"29_CR32","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.dam.2003.07.009","volume":"144","author":"AJ Macula","year":"2004","unstructured":"Macula, A.J., Popyack, L.J.: A group testing method for finding patterns in data. Discrete Appl. Math. 144(1\u20132), 149\u2013157 (2004)","journal-title":"Discrete Appl. Math."},{"key":"29_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-24174-6_10","volume-title":"Computer Security \u2013 ESORICS 2015","author":"K Minematsu","year":"2015","unstructured":"Minematsu, K.: Efficient message authentication codes with combinatorial group testing. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9326, pp. 185\u2013202. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24174-6_10"},{"key":"29_CR34","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1090\/dimacs\/055\/13","volume":"55","author":"HQ Ngo","year":"2000","unstructured":"Ngo, H.Q., Du, D.Z.: A survey on combinatorial group testing algorithms with applications to DNA library screening. DIMACS Ser. Discret. Math. Theor. Comput. Sci. 55, 171\u2013182 (2000)","journal-title":"DIMACS Ser. Discret. Math. Theor. Comput. Sci."},{"key":"29_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-22006-7_47","volume-title":"Automata, Languages and Programming","author":"HQ Ngo","year":"2011","unstructured":"Ngo, H.Q., Porat, E., Rudra, A.: Efficiently decodable error-correcting list disjunct matrices and applications. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 557\u2013568. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_47"},{"key":"29_CR36","unstructured":"Oprea, A., Reiter, M.K.: Space-efficient block storage integrity. In: NDSS. The Internet Society (2005)"},{"key":"29_CR37","unstructured":"Oprea, A., Reiter, M.K.: Integrity checking in cryptographic file systems with constant trusted storage. In: USENIX Security Symposium. USENIX Association (2007)"},{"issue":"12","key":"29_CR38","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1109\/TIT.2011.2163296","volume":"57","author":"E Porat","year":"2011","unstructured":"Porat, E., Rothschild, A.: Explicit nonadaptive combinatorial group testing schemes. IEEE Trans. Inf. Theory 57(12), 7982\u20137989 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30539-2_2","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"P Rogaway","year":"2004","unstructured":"Rogaway, P.: Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 16\u201331. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30539-2_2"},{"key":"29_CR40","unstructured":"Rudra, A.: CSE 709: compressed sensing and group testing, Part I (fall 2011 seminar) (2011)"},{"issue":"12","key":"29_CR41","doi-asserted-by":"publisher","first-page":"7518","DOI":"10.1109\/TIT.2016.2614726","volume":"62","author":"C Shangguan","year":"2016","unstructured":"Shangguan, C., Ge, G.: New bounds on the number of tests for disjunct matrices. IEEE Trans. Inf. Theory 62(12), 7518\u20137521 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR42","unstructured":"Smith, K.J.C.: Majority Decodable Codes Derived from Finite Geometries. Institute of Statistics Mimeo Series 561 (1967)"},{"key":"29_CR43","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1186\/1471-2105-7-28","volume":"7","author":"N Thierry-Mieg","year":"2006","unstructured":"Thierry-Mieg, N.: A new pooling strategy for high-throughput screening: the shifted transversal design. BMC Bioinform. 7, 28 (2006)","journal-title":"BMC Bioinform."},{"key":"29_CR44","unstructured":"Ubaru, S., Mazumdar, A.: Multilabel classification with group testing and codes. In: ICML. Proceedings of Machine Learning Research, vol. 70, pp. 3492\u20133501. PMLR (2017)"},{"key":"29_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-14496-7_12","volume-title":"Information Theoretic Security","author":"GM Zaverucha","year":"2010","unstructured":"Zaverucha, G.M., Stinson, D.R.: Group testing and batch verification. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 140\u2013157. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_12"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29959-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:07:58Z","timestamp":1726358878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29959-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299583","9783030299590"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29959-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.laas.fr\/esorics\/","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":"344","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":"67","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":"19% - 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,2","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":"11","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"}]}}