{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:11Z","timestamp":1772283731734,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642144950","type":"print"},{"value":"9783642144967","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_12","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T07:51:35Z","timestamp":1284105095000},"page":"140-157","source":"Crossref","is-referenced-by-count":14,"title":["Group Testing and Batch Verification"],"prefix":"10.1007","author":[{"given":"Gregory M.","family":"Zaverucha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36231-2_16","volume-title":"Progress in Cryptology - INDOCRYPT 2002","author":"M. Al-Ibrahim","year":"2002","unstructured":"Al-Ibrahim, M., Ghodosi, H., Pieprzyk, J.: Authentication of concast communication. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol.\u00a02551, pp. 185\u2013198. Springer, Heidelberg (2002)"},{"key":"12_CR2","series-title":"Math. and Its Applications","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-1-4612-0751-1_8","volume-title":"Genetic Mapping and DNA Sequencing, IMA","author":"D.J. Balding","year":"1996","unstructured":"Balding, D.J., Bruno, W.J., Knill, E., Torney, D.C.: A comparative survey of nonadaptive probing designs. In: Genetic Mapping and DNA Sequencing, IMA. Math. and Its Applications, pp. 133\u2013154. Springer, Heidelberg (1996)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(92)00185-O","volume":"52","author":"A. Bar-Noy","year":"1994","unstructured":"Bar-Noy, A., Hwang, F.K., Kessler, I., Kutten, S.: Competitive group testing in high speed networks. Discrete Applied Math.\u00a052, 29\u201338 (1994)","journal-title":"Discrete Applied Math."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Garay, J., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 236\u2013250. Springer, Heidelberg (1998)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. Journal of Cryptology\u00a017, 297\u2013319 (2004)","journal-title":"Journal of Cryptology"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-44448-3_5","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"C. Boyd","year":"2000","unstructured":"Boyd, C., Pavlovski, C.: Attacking and repairing batch verification schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 58\u201371. Springer, Heidelberg (2000)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 268\u2013289. Springer, Heidelberg (2003)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-72540-4_14","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Camenisch","year":"2007","unstructured":"Camenisch, J., Hohenberger, S., \u00d8stergaard Pedersen, M.: Batch verification of short signatures. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 246\u2013263. Springer, Heidelberg (2007)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., Meyerovich, M.: How to win the clonewars: efficient periodic n-times anonymous authentication. In: Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS), pp. 201\u2013210 (2006)","DOI":"10.1145\/1180405.1180431"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Cha","year":"2002","unstructured":"Cha, J., Cheon, J.: An identity-based signature scheme from gap Diffie-Hellman groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 18\u201330. Springer, Heidelberg (2002)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11734727_33","volume-title":"Information Security and Cryptology - ICISC 2005","author":"S. Chatterjee","year":"2006","unstructured":"Chatterjee, S., Sarkar, P.: Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol.\u00a03935, pp. 424\u2013440. Springer, Heidelberg (2006)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","volume":"302","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Th. Comp. Sci.\u00a0302, 337\u2013364 (2003)","journal-title":"Th. Comp. Sci."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(03)00281-0","volume":"306","author":"A. Bonis De","year":"2003","unstructured":"De Bonis, A., Vaccaro, U.: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Th. Comp. Sci.\u00a0306, 223\u2013243 (2003)","journal-title":"Th. Comp. Sci."},{"key":"12_CR14","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. Statist.\u00a014, 436\u2013440 (1943)","journal-title":"Ann. Math. Statist."},{"key":"12_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/9789812798183","volume-title":"Combinatorial Group Testing and its Applications","author":"D. Du","year":"1993","unstructured":"Du, D., Hwang, F.K.: Combinatorial Group Testing and its Applications. World Scientific, Singapore (1993)"},{"key":"12_CR16","volume-title":"Combinatorial Group Testing and its Applications","author":"D. Du","year":"2000","unstructured":"Du, D., Hwang, F.K.: Combinatorial Group Testing and its Applications, 2nd edn. World Scientific, Singapore (2000)","edition":"2"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0378-3758(01)00140-9","volume":"100","author":"A.G. D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Optimal superimposed codes and designs for Renyi\u2019s search model. J. Statist. Plann. Inference\u00a0100, 281\u2013302 (2002)","journal-title":"J. Statist. Plann. Inference"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-00862-7_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"A.L. Ferrara","year":"2009","unstructured":"Ferrara, A.L., Green, M., Hohenberger, S., \u00d8stergaard Pedersen, M.: Practical Short Signature Batch Verification. In: Fischlin, M. (ed.) RSA Conference 2009. LNCS, vol.\u00a05473, pp. 309\u2013324. Springer, Heidelberg (2009)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/0-387-34805-0_17","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"A. Fiat","year":"1990","unstructured":"Fiat, A.: Batch RSA. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 175\u2013185. Springer, Heidelberg (1990)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s001459900021","volume":"10","author":"A. Fiat","year":"1997","unstructured":"Fiat, A.: Batch RSA. Journal of Cryptology\u00a010, 75\u201388 (1997)","journal-title":"Journal of Cryptology"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-44598-6_21","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.A. Garay","year":"2000","unstructured":"Garay, J.A., Staddon, J.N., Wool, A.: Long-lived broadcast encryption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 333\u2013352. Springer, Heidelberg (2000)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/0602011","volume":"2","author":"M.C. Hu","year":"1981","unstructured":"Hu, M.C., Hwang, F.K., Wang, J.K.: A boundary problem for group testing. SIAM J. Alg. Disc. Methods\u00a02, 81\u201387 (1981)","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","volume":"36","author":"R.M. Karp","year":"1988","unstructured":"Karp, R.M., Upfal, E., Wigderson, A.: The complexity of parallel search. J. Comput. Syst. Sci.\u00a036, 225\u2013253 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W.H. Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.G.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory\u00a010, 363\u2013373 (1964)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-77272-9_3","volume-title":"Cryptography and Coding","author":"L. Law","year":"2007","unstructured":"Law, L., Matt, B.J.: Finding invalid signatures in pairing-based batches. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol.\u00a04887, pp. 34\u201353. Springer, Heidelberg (2007)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Matt, B.J.: Identification of multiple invalid signatures in pairing-based batched signatures. In: PKC 2009. LNCS, vol.\u00a05443, pp. 337\u2013356 (2009)","DOI":"10.1007\/978-3-642-00468-1_19"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","volume":"21","author":"C.J. Mitchell","year":"1988","unstructured":"Mitchell, C.J., Piper, F.C.: Key storage in secure networks. Discrete applied mathematics\u00a021, 215\u2013228 (1988)","journal-title":"Discrete applied mathematics"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0053426","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"D. Naccache","year":"1995","unstructured":"Naccache, D., M\u2019raihi, D., Vaudenay, S., Raphaeli, D.: Can DSA be improved? Complexity trade-offs with the digital signature standard. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 77\u201385. Springer, Heidelberg (1995)"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-3-540-46588-1_3","volume-title":"Public Key Cryptography","author":"J. Pastuszak","year":"2000","unstructured":"Pastuszak, J., Michalek, D., Pieprzyk, J., Seberry, J.: Identification of bad signatures in batches. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 28\u201345. Springer, Heidelberg (2000)"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-44495-5_13","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"J. Pastuszak","year":"2000","unstructured":"Pastuszak, J., Pieprzyk, J., Seberry, J.: Codes identifying bad signatures in batches. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 143\u2013154. Springer, Heidelberg (2000)"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/978-3-540-70575-8_61","volume-title":"Automata, Languages and Programming","author":"E. Porat","year":"2008","unstructured":"Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 748\u2013759. Springer, Heidelberg (2008)"},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1090\/S0002-9904-1965-11402-1","volume":"71","author":"A. Reyni","year":"1965","unstructured":"Reyni, A.: On the theory of random search. Bull. Amer. Math Soc.\u00a071, 809\u2013828 (1965)","journal-title":"Bull. Amer. Math Soc."},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M. Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the upper bound of the size of the r-cover-free families. Journal of Combinatorial Theory Series A\u00a066, 302\u2013310 (1994)","journal-title":"Journal of Combinatorial Theory Series A"},{"key":"12_CR34","unstructured":"Shultz, D.J.: Topics in nonadaptive group testing. Ph.D. Dissertation, Temple University (1992)"},{"key":"12_CR35","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/S0021-9800(70)80038-2","volume":"8","author":"J. Spencer","year":"1970","unstructured":"Spencer, J.: Minimal completely separating systems. Journal of Combinatorial Theory\u00a08, 446\u2013447 (1970)","journal-title":"Journal of Combinatorial Theory"},{"key":"12_CR36","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"Sperner, E.: Ein Satz Uber Untermengen einer endliche Menge. Math. Zeit.\u00a027, 544\u2013548 (1928)","journal-title":"Math. Zeit."},{"key":"12_CR37","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J.N. Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory\u00a047, 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR38","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference\u00a086, 595\u2013617 (2000)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R., Zhu, L.: Some new bounds for cover-free families. Journal of Combinatorial Theory Series A\u00a090, 224\u2013234 (2000)","journal-title":"Journal of Combinatorial Theory Series A"},{"key":"12_CR40","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2003.12.010","volume":"91","author":"D.R. Stinson","year":"2004","unstructured":"Stinson, D.R.: Attack on a concast signature scheme. Information Processing Letters\u00a091, 39\u201341 (2004)","journal-title":"Information Processing Letters"},{"key":"12_CR41","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1002\/j.1538-7305.1959.tb03914.x","volume":"28","author":"M. Sobel","year":"1959","unstructured":"Sobel, M., Groll, P.A.: Group testing to eliminate efficiently all defectives in a binomial sample. Bell System Tech. J.\u00a028, 1179\u20131252 (1959)","journal-title":"Bell System Tech. J."}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:28:04Z","timestamp":1619771284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}