{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T23:16:45Z","timestamp":1781479005105,"version":"3.54.1"},"publisher-location":"Cham","reference-count":71,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319181721","type":"print"},{"value":"9783319181738","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_5","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"74-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Linear Time Constructions of Some $$d$$-Restriction Problems"],"prefix":"10.1007","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N Alon","year":"1986","unstructured":"Alon, N.: Explicit construction of exponential sized families of k-independent sets. Discrete Math. 58, 191\u2013193 (1986)","journal-title":"Discrete Math."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-27836-8_12","volume-title":"Automata, Languages and Programming","author":"N Alon","year":"2004","unstructured":"Alon, N., Asodi, V.: Learning a hidden subgraph. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 110\u2013121. Springer, Heidelberg (2004)"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/S0097539702420139","volume":"33","author":"N Alon","year":"2004","unstructured":"Alon, N., Beigel, R., Kasif, S., Rudich, S., Sudakov, B.: Learning a Hidden Matching. SIAM J. Comput. 33(2), 487\u2013501 (2004)","journal-title":"SIAM J. Comput."},{"key":"5_CR4","first-page":"2215","volume":"7","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Chen, J.: Learning a Hidden Hypergraph. Journal of Machine Learning Research 7, 2215\u20132236 (2006)","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","volume":"74","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Chen, J.: Learning a hidden graph using $$O(\\log n)$$ queries per edge. J. Comput. Syst. Sci. 74(4), 546\u2013556 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N Alon","year":"1996","unstructured":"Alon, N., Naor, M.: Rerandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 434\u2013449 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for $$k$$-restrictions. ACM Transactions on Algorithms 2(2), 153\u2013177 (2006)","journal-title":"ACM Transactions on Algorithms"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M Atici","year":"1996","unstructured":"Atici, M., Magliveras, S.S., Stinson, D.R., Wei, W.-D.: Some Recursive Constructions for Perfect Hash Families. Journal of Combinatorial Designs 4(5), 353\u2013363 (1996)","journal-title":"Journal of Combinatorial Designs"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38(2), 509\u2013516 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jcta.1999.3050","volume":"92","author":"SR Blackburn","year":"2000","unstructured":"Blackburn, S.R.: Perfect Hash Families: Probabilistic Methods and Explicit Constructions. Journal of Combinatorial Theory, Series A 92, 54\u201360 (2000)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"5_CR11","series-title":"Research Notes in Mathematics","first-page":"44","volume-title":"Combinatorial Designs and Their Applications","author":"SR Blackburn","year":"1999","unstructured":"Blackburn, S.R.: Combinatorics and threshold cryptography. In: Holroyd, F.C., Quinn, K.A.S., Rowley, C., Webb, B.S. (eds.) Combinatorial Designs and Their Applications. Research Notes in Mathematics, vol. 403, pp. 44\u201370. CRC Press, London (1999)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"SR Blackburn","year":"1996","unstructured":"Blackburn, S.R., Burmester, M., Desmedt, Y.G., Wild, P.R.: Efficient multiplicative sharing schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 107\u2013118. Springer, Heidelberg (1996)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Bshouty, N.H.: Testers and their applications. In: ITCS 2014, pp. 327\u2013352 (2014). Full version: Electronic Colloquium on Computational Complexity (ECCC) 19, 11 (2012)","DOI":"10.1145\/2554797.2554828"},{"key":"5_CR14","unstructured":"Bshouty, N.H.: Dense Testers: Almost Linear Time and Locally Explicit Constructions. Electronic Colloquium on Computational Complexity (ECCC) 22: 6 (2015)"},{"key":"5_CR15","unstructured":"Bshouty, N.H.: Linear time Constructions of some $$d$$-Restriction Problems. CoRR abs\/1406.2108. (2014)"},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/369133.369152","volume":"2001","author":"R Beigel","year":"2001","unstructured":"Beigel, R., Alon, N., Kasif, S., Apaydin, M.S., Fortnow, L.: An optimal procedure for gap closing in whole genome shotgun sequencing. RECOMB 2001, 22\u201330 (2001)","journal-title":"RECOMB"},{"issue":"7","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1016\/j.jcta.2008.01.009","volume":"115","author":"SR Blackburn","year":"2008","unstructured":"Blackburn, S.R., Etzion, T., Stinson, D.R., Zaverucha, G.M.: A bound on the size of separating hash families. Journal of Combinatorial Theory, Series A 115(7), 1246\u20131256 (2008)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"5_CR18","first-page":"16","volume":"2005","author":"M Bouvel","year":"2005","unstructured":"Bouvel, M., Grebinski, V., Kucherov, G.: Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. WG 2005, 16\u201327 (2005)","journal-title":"WG"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Baker, R.C., Harman, G., Pintz, J.: The difference between consecutive primes. II. Proceedings of the London Mathematical Society 83(3), 532\u2013562 (2001)","DOI":"10.1112\/plms\/83.3.532"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2007.09.003","volume":"14","author":"SG Barwick","year":"2008","unstructured":"Barwick, S.G., Jackson, W.-A.: Geometric constructions of optimal linear perfect hash families. Finite Fields and Their Applications 14(1), 1\u201313 (2008)","journal-title":"Finite Fields and Their Applications"},{"issue":"5","key":"5_CR21","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/jcd.20010","volume":"12","author":"SG Barwick","year":"2004","unstructured":"Barwick, S.G., Jackson, W.-A., Quinn, C.T.: Optimal Linear Perfect Hash Families with Small Parameters. Journal of Combinatorial Designs 12(5), 311\u2013324 (2004)","journal-title":"Journal of Combinatorial Designs"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.jcta.2010.11.006","volume":"118","author":"M Bazrafshan","year":"2011","unstructured":"Bazrafshan, M., van Trung, T.: Bounds for separating hash families. Journal of Combinatorial Theory, Series A 118(3), 1129\u20131135 (2011)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1006\/jcta.1998.2876","volume":"83","author":"SR Blackburn","year":"1998","unstructured":"Blackburn, S.R., Wild, P.R.: Optimal linear perfect hash families. Journal of Combinatorial Theory, Series A 83(2), 233\u2013250 (1998)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s10878-010-9291-0","volume":"22","author":"H Chang","year":"2011","unstructured":"Chang, H., Chen, H.-B., Fu, H.-L., Shi, C.-H.: Reconstruction of hidden graphs and threshold group testing. J. Comb. Optim. 22(2), 270\u2013281 (2011)","journal-title":"J. Comb. Optim."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: a taxonomy and some efficient constructions. In: Proceedings of INFOCOM 1999, vol. 2, pp. 708\u2013716 (1999)","DOI":"10.1109\/INFCOM.1999.751457"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10878-007-9083-3","volume":"15","author":"H-B Chen","year":"2008","unstructured":"Chen, H.-B., Hwang, F.K.: A survey on nonadaptive group testing algorithms through the angle of decoding. J. Comb. Optim. 15(1), 49\u201359 (2008)","journal-title":"J. Comb. Optim."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"ZJ Czech","year":"1997","unstructured":"Czech, Z.J., Havas, G., Majewski, B.S.: Perfect hashing. Theoret. Comput. Sci. 182, 1\u2013143 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tcs.2013.04.011","volume":"505","author":"FYL Chin","year":"2013","unstructured":"Chin, F.Y.L., Leung, H.C.M., Yiu, S.-M.: Non-adaptive complex group testing with multiple positive sets. Theor. Comput. Sci. 505, 11\u201318 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00191355","volume":"8","author":"M Dyer","year":"1995","unstructured":"Dyer, M., Fenner, T., Frieze, A., Thomason, A.: On key storage in secure networks. J. Cryptol. 8, 189\u2013200 (1995)","journal-title":"J. Cryptol."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial group testing and its applications. Series on Applied Mathematics. 2nd edn., vol. 12. World Scientific, New York (2000)","DOI":"10.1142\/4252"},{"issue":"3","key":"5_CR31","first-page":"7","volume":"18","author":"AG D\u00fdachkov","year":"1982","unstructured":"D\u00fdachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Problemy Peredachi Inf. 18(3), 7\u201313 (1982)","journal-title":"Problemy Peredachi Inf."},{"issue":"4","key":"5_CR32","first-page":"237","volume":"18","author":"AG D\u00fdachkov","year":"1989","unstructured":"D\u00fdachkov, A.G., Rykov, V.V., Rashad, A.M.: Superimposed distance codes. Problems Control Inform. Theory\/Problemy Upravlen. Teor. Inform. 18(4), 237\u2013250 (1989)","journal-title":"Problems Control Inform. Theory\/Problemy Upravlen. Teor. Inform."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Safavi-Naini, R., Wang, H., Batten, L., Charnes, C., Pieprzyk, J.: Broadcast anti-jamming systems. Comput. Networks 35, 223\u2013236 (2001)","DOI":"10.1016\/S1389-1286(00)00169-9"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A., Vilenkin, P., Macula, A., Torney, D.: Families of finite sets in which no intersection of $$\\ell $$ sets is covered by the union of $$s$$ others. J. Comb. Theory Ser. A. 99, 195\u2013218 (2002)","DOI":"10.1006\/jcta.2002.3257"},{"issue":"3","key":"5_CR35","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10878-006-9634-z","volume":"12","author":"H Gao","year":"2006","unstructured":"Gao, H., Hwang, F.K., Thai, M.T., Wu, W., Znati, T.: Construction of d(H)-disjunct matrix for group testing in hypergraphs. J. Comb. Optim. 12(3), 297\u2013301 (2006)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"5_CR36","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/jcta.1996.0012","volume":"73","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On r-cover-free families. Journal of Combinatorial Theory, Series A 73(1), 172\u2013173 (1996)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"1","key":"5_CR37","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J.: On the size of seperating systems and families of perfect hash function. SIAM J. Algebraic and Discrete Methods 5(1), 61\u201368 (1984)","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"5_CR38","first-page":"142","volume":"2014","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. SODA 2014, 142\u2013151 (2014)","journal-title":"SODA"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480\u2013491. Springer, Heidelberg (1994)"},{"issue":"1\u20133","key":"5_CR40","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V Grebinski","year":"1998","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. Discrete Applied Mathematics 88(1\u20133), 147\u2013165 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR41","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":"JA Garay","year":"2000","unstructured":"Garay, J.A., Staddon, J., Wool, A.: Long-Lived Broadcast Encryption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 333\u2013352. Springer, Heidelberg (2000)"},{"issue":"4","key":"5_CR42","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/s10878-008-9179-4","volume":"19","author":"T Huang","year":"2010","unstructured":"Huang, T., Wang, K., Weng, C.-W.: A class of error-correcting pooling designs over complexes. J. Comb. Optim. 19(4), 486\u2013491 (2010)","journal-title":"J. Comb. Optim."},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Indyk, P., Ngo, H.Q., Rudra, A.: Efficiently decodable non-adaptive group testing. In: The 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 1126\u20131142 (2010)","DOI":"10.1137\/1.9781611973075.91"},{"issue":"4","key":"5_CR44","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0607062","volume":"7","author":"J K\u00f6rner","year":"1986","unstructured":"K\u00f6rner, J.: Fredman-Koml\u00f3s bounds and information theory. SIAM J. Algebraic and Discrete Methods 7(4), 560\u2013570 (1986)","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"issue":"6","key":"5_CR45","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0195-6698(88)80048-9","volume":"9","author":"J K\u00f6rner","year":"1988","unstructured":"K\u00f6rner, J., Marton, K.: New bounds for perfect hashing via information theory. Europ. J. of Combinatorics 9(6), 523\u2013530 (1988)","journal-title":"Europ. J. of Combinatorics"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R Kumar","year":"1999","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 609\u2013623. Springer, Heidelberg (1999)"},{"issue":"4","key":"5_CR47","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. Inform. Theory 10(4), 363\u2013377 (1964)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5_CR48","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10623-006-9004-y","volume":"41","author":"L Liu","year":"2006","unstructured":"Liu, L., Shen, H.: Explicit constructions of separating hash families from algebraic curves over finite fields. Designs, Codes and Cryptography 41(2), 221\u2013233 (2006)","journal-title":"Designs, Codes and Cryptography"},{"key":"5_CR49","unstructured":"Martirosyan, S.: Perfect Hash Families, Identifiable Parent Property Codes and Covering Arrays. Dissertation zur Erlangung des Grades eines Doktors der Naturwissenschaften (2003)"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Mehlborn, K.: Data Structures and Algorithms. 1. Sorting and Searching. Springer, Berlin (1984)","DOI":"10.1007\/978-3-642-69672-5_2"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: On the program size of perfect and universal hash functions. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS 1982), pp. 170\u2013175 (1982)","DOI":"10.1109\/SFCS.1982.80"},{"key":"5_CR52","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","volume":"21","author":"CJ Mitchell","year":"1988","unstructured":"Mitchell, C.J., Piper, F.C.: Key storage in secure networks. Discrete Appl. Math. 21, 215\u2013228 (1988)","journal-title":"Discrete Appl. Math."},{"key":"5_CR53","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. Discret Appl Math. 144, 149\u2013157 (2004)","journal-title":"Discret Appl Math."},{"issue":"1","key":"5_CR54","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10623-007-9138-6","volume":"46","author":"S Martirosyan","year":"2008","unstructured":"Martirosyan, S., van Trung, T.: Explicit constructions for perfect hash families. Designs, Codes and Cryptography 46(1), 97\u2013112 (2008)","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"5_CR55","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S0963548300001280","volume":"3","author":"A Nilli","year":"1994","unstructured":"Nilli, A.: Perfect hashing and probability. Combinatorics, Probability and Computing 3(3), 407\u2013409 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"key":"5_CR56","first-page":"171","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. Theoretical Computer Science 55, 171\u2013182 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"5_CR57","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"key":"5_CR58","first-page":"182","volume":"95","author":"M Naor","year":"1995","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and Near-optimal Derandomization. FOCS 95, 182\u2013191 (1995)","journal-title":"Splitters and Near-optimal Derandomization. FOCS"},{"key":"5_CR59","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/S0895480190283595","volume":"8","author":"I Newman","year":"1995","unstructured":"Newman, I., Wigderson, A.: Lower bounds on formula size of Boolean functions using hypergraph entropy. SIAM J. Discrete Math. 8, 536\u2013542 (1995)","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"5_CR60","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 Transactions on Information Theory 57(12), 7982\u20137989 (2011)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR61","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-75225-7_24","volume-title":"Algorithmic Learning Theory","author":"L Reyzin","year":"2007","unstructured":"Reyzin, L., Srivastava, N.: Learning and verifying graphs using queries with a focus on edge counting. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 285\u2013297. Springer, Heidelberg (2007)"},{"key":"5_CR62","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1008268610932","volume":"12","author":"DR Stinson","year":"1997","unstructured":"Stinson, D.R.: On some methods for unconditionally secure key distribution and broadcast encryption. Des. Codes Cryptogr. 12, 215\u2013243 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"5_CR63","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"DR Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11, 41\u201353 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR64","first-page":"148","volume":"151","author":"R Safavi-Naini","year":"1999","unstructured":"Safavi-Naini, R., Wang, H.: Multireceiver authentication codes: models, bounds, constructions, and extensions Inform. Comput. 151, 148\u2013172 (1999)","journal-title":"Comput."},{"issue":"3","key":"5_CR65","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-A","volume":"8","author":"DR Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R., Zhu, L.: New constructions for perfect hash families and related structures using combintorial designs and codes. J. Combin. Designs. 8(3), 189\u2013200 (2000)","journal-title":"J. Combin. Designs."},{"issue":"1","key":"5_CR66","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jcta.2007.04.005","volume":"115","author":"DR Stinson","year":"2008","unstructured":"Stinson, D.R., Wei, R., Chen, K.: On generalised separating hash families. Journal of Combinatorial Theory, Series A 115(1), 105\u2013120 (2008)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"1","key":"5_CR67","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"DR Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R., Zhu, L.: Some new bounds for cover-free families. Journal of Combinatorial Theory, Series A 90(1), 224\u2013234 (2000)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"5_CR68","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1008209004667","volume":"14","author":"DR Stinson","year":"1998","unstructured":"Stinson, D.R., van Trung, T.: Some new results on key distribution patterns and broadcast encryption. Des. Codes Cryptogr. 14, 261\u2013279 (1998)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"5_CR69","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"2000","unstructured":"Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Planning and Inference 86(2), 595\u2013617 (2000)","journal-title":"J. Stat. Planning and Inference"},{"key":"5_CR70","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01609879","volume":"3","author":"DC Torney","year":"1999","unstructured":"Torney, D.C.: Sets pooling designs. Ann. Comb. 3, 95\u2013101 (1999)","journal-title":"Ann. Comb."},{"key":"5_CR71","doi-asserted-by":"crossref","unstructured":"Wang, H., Xing, C.P.: Explicit Constructions of perfect hash families from algebraic curves over finite fields. J. of Combinatorial Theory, Series A 93(1), 112\u2013124 (2001)","DOI":"10.1006\/jcta.2000.3068"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:14:45Z","timestamp":1748391285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}