Broadcast anti-jamming systems

IEEE International Conference on Networks, ICON

Volumn , Issue , 1999, Pages 349-355

  Desmedt, Yvo ^a   Safavi Naini, Rei ^b   Wang, Huaxiong ^b   Charnes, Chris ^b   Pieprzyk, Josef ^b  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANTI-JAMMING; CODING METHODS; COMBINATORICS; FREQUENCY SPECTRA; GENERALISATION; KEY DISTRIBUTION; MULTIPLE RECEIVERS; SIGNAL POWER;

JAMMING; SECURITY SYSTEMS;

SIGNAL RECEIVERS;

EID: 84890457246     PISSN: 15566463     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICON.1999.796197     Document Type: Conference Paper

References (21)

1. President's commission on critical infrastructure protection. http://www.pccip.gov/, 1998.
2. M. J. Atallah, editor. The CRC HandBook of Algorithms and Theory of Computation. CRC Press, Boca Raton, 1998.
3. M. Atici, S. S. Magliveras, D. R. Stinson, and W. D. Wei. Some recursive constructions for perfect hash families. Journal of Combinatorial Designs, (4):353-363, 1996.
4. S. R. Blackburn. Combinatoriocs and threshold cryptology. Combinatorial Designs and their Applications, to appear.
5. S. R. Blackburn, M. Burmester, Y. Desmedt, and P. R. Wild. Efficient multiplicative sharing schemes. Advances in Cryptology-Eurocrypt '96, LNCS, 1996:107-118.
6. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly secure key distribution for dynamic conferences. Advances in Cryptology - Crypto 92, LNCS, 1993:471-486.
7. C. J. Colburn and J. H. Dinitz, editors. The CRC HandBook of Combinatorial Designs . CRC Press, New York, 1996.
8. Z. J. Czech, G. Havas, and B. S. Majewski. Perfect hashing. Theoretical Computer Science, 182:1-143, 1997.
9. M. Dyer, T. Fenner, A. Frieze, and A. Thomson. On key storage in secure networks. Journal of Cryptology, 8:189- 200, 1995.
10. P. Erdös, P. Frankl, and Z. Furedi. Families of finite sets in which no set is covered by the union of two others. Journal of Combinatorial Theory, Series A, 33:158-166, 1982.
11. P. Erdös, P. Frankl, and Z. Furedi. Families of finite sets in which no set is covered by the union of two others. Israel Journal of Mathematics, 51:79-89, 1985.
12. A. Fiat and M. Naor. Broadcast encryption. Advances in Cryptology - Crypto '93, LNCS, 773:480-491, 1994.
13. H. Fujii, W. Kachen, and K. Kurosawa. Combinatorial bounds and design of broadcast authentication. IEICE Transactions, E 79(4):502-506, 1996.
14. L. Gong and D. J. Wheeler. A matrix key-distribution scheme. Journal of Cryptology, 2:51-59, 1990.
15. K. Mehlhorn. Data Structures and Algorithms Vol. 1. Springer-Verlag, 1984.
16. A. Menezes, P. van Oorschot, and S. Vanstone. Applied Cryptography. CRC Press, Boca Raton, 1996.
17. C. J. Mitchell and F. C. Piper. Key storage in secure networks. Discrete Applied Mathematics, 21:215-228, 1988.
18. C. M. O'Keefe. Key distribution patterns using minkowski planes. Designs, codes and Cryptography, 5:261-267, 1995.
19. K. A. S. Quinn. Some constructions for key distribution patterns. Designs, Codes and Cryptography, 4:177-191, 1994.
20. D. R. Stinson. On some methods for unconditionally secure key distribution and broadcast encryption. Designs, Codes and Cryptography, 12:215-243, 1997.
21. A. J. Viterbi. CDMA, Principles of spread spectrum communications. Addison-Wesley, Reading, Massachusettes, 1995.