{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:04:32Z","timestamp":1761401072106},"reference-count":28,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s1389-1286(00)00169-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:05:15Z","timestamp":1027616715000},"page":"223-236","source":"Crossref","is-referenced-by-count":27,"title":["Broadcast anti-jamming systems"],"prefix":"10.1016","volume":"35","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[]},{"given":"Rei","family":"Safavi-Naini","sequence":"additional","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lynn","family":"Batten","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Charnes","sequence":"additional","affiliation":[]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(00)00169-9_BIB1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","article-title":"Some recursive constructions for perfect hash families","volume":"4","author":"Atici","year":"1996","journal-title":"Journal of Combinatorial Designs"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB2","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/BF01940874","article-title":"Derandomization witnesses for Boolean matrix multiplication and construction of perfect hash functions","volume":"16","author":"Alon","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB3","series-title":"Design Theory","author":"Beth","year":"1986"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB4","doi-asserted-by":"crossref","unstructured":"S.R. Blackburn, Combinatorics and threshold cryptology, in: Combinatorial Designs and their Applications, Chapman and Hall\/CRC Research Notes in Mathematics, CRC Press, London, 1999, 49\u201370","DOI":"10.1201\/9781315139722-3"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB5","doi-asserted-by":"crossref","unstructured":"S.R. Blackburn, M. Burmester, Y. Desmedt, P.R. Wild, Efficient multiplicative sharing schemes, in: Advances in Cryptology\u2013Eurocrypt '96, Lecture Notes in Computer Science, vol. 1070, Springer, Berlin, 1996, pp. 107\u2013118","DOI":"10.1007\/3-540-68339-9_10"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/jcta.1998.2876","article-title":"Optimal linear perfect hash families","volume":"83","author":"Blackburn","year":"1998","journal-title":"Journal of Combinatorial Theory A"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB7","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung, Perfectly-secure key distribution for dynamic conferences, in: E.F. Brickell (Ed.), Advances in Cryptology \u2014 Crypto '92, Proceedings, Lecture Notes in Computer Science, vol. 740, Springer, Berlin, 1993, pp. 471\u2013486","DOI":"10.1007\/3-540-48071-4_33"},{"issue":"1","key":"10.1016\/S1389-1286(00)00169-9_BIB8","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/98.486977","article-title":"Applications of mobile computing and communication","volume":"3","author":"Bruegge","year":"1996","journal-title":"IEEE Personal Communication"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","article-title":"Perfect hashing","volume":"182","author":"Czech","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB10","series-title":"The CRC Handbook of Combinatorial Designs","year":"1996"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB11","series-title":"CRC Handbook of Algorithms and Theory of Computation","year":"1998"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB12","series-title":"Deisigns Graphs Codes and their Links","author":"Cameron","year":"1991"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB13","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, R. Safavi-Naini, H. Wang, C. Charnes, J. Pieprzyk, Broadcast anti-jamming systems, in: IEEE International Conference in Netwoking, ICON'99","DOI":"10.1109\/ICON.1999.796197"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00191355","article-title":"On key storage in secure networks","volume":"8","author":"Dyer","year":"1995","journal-title":"Journal of Cryptology"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0097-3165(82)90004-8","article-title":"Families of finite sets in which no set is covered by the union of two others","volume":"33","author":"Erd\u00f6s","year":"1982","journal-title":"Journal of Combinatorial Theory A"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u00f3s","year":"1985","journal-title":"Israel Journal of Mathematics"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB17","doi-asserted-by":"crossref","unstructured":"A. Fiat, M. Naor, Broadcast encryption, in: Advances in Cryptology\u2013Crypto '93, Lecture Notes in Computer Science, vol. 773, Springer, Berlin, 1994, pp. 480\u2013491","DOI":"10.1007\/3-540-48329-2_40"},{"issue":"4","key":"10.1016\/S1389-1286(00)00169-9_BIB18","first-page":"502","article-title":"Combinatorial bounds and design of broadcast authentication","volume":"79","author":"Fujii","year":"1996","journal-title":"IEICE Trans. E -A"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02252869","article-title":"A matrix key-distribution scheme","volume":"2","author":"Gong","year":"1990","journal-title":"J. Cryptology"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB20","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, Data Structures and Algorithms, Vol. 1, Springer, Berlin, 1984","DOI":"10.1007\/978-3-642-69672-5"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB21","series-title":"Applied Cryptography","author":"Menezes","year":"1996"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB22","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","article-title":"Key storage in secure networks","volume":"21","author":"Mitchell","year":"1988","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01388388","article-title":"Key distribution patterns using Minkowski planes","volume":"5","author":"O'Keefe","year":"1995","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB24","unstructured":"President's Commission on Critical Infrastructure Protection, 1998, http:\/\/www.pccip.gov\/"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB25","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01578871","article-title":"Some constructions for key distribution patterns","volume":"4","author":"Quinn","year":"1994","journal-title":"Designs Codes and Cryptography"},{"issue":"1","key":"10.1016\/S1389-1286(00)00169-9_BIB26","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/98.486973","article-title":"Mobile information access","volume":"3","author":"Satyanarayanan","year":"1996","journal-title":"IEEE Personal Communication"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB27","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1008268610932","article-title":"On some methods for unconditionally secure key distribution and broadcast encryption","volume":"12","author":"Stinson","year":"1997","journal-title":"Designs Codes and Cryptography"},{"key":"10.1016\/S1389-1286(00)00169-9_BIB28","series-title":"CDMA Principles of Spread Spectrum Communications","author":"Viterbi","year":"1995"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128600001699?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128600001699?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T17:36:38Z","timestamp":1681148198000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128600001699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":28,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S1389128600001699"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(00)00169-9","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}