Broadcast anti-jamming systems

Computer Networks - Tập 35 - Trang 223-236 - 2001
Yvo Desmedt1, Rei Safavi-Naini2, Huaxiong Wang2, Lynn Batten3, Chris Charnes4, Josef Pieprzyk2
1Department of Computer Science, Florida State University, 206 Love Building, Tallahassee, FL 32306, USA
2School of IT and CS, University of Wollongong, Wollongong, NSW, 2522, Australia
3School of Computing and Mathematics, Deakin University, Clayton, Victoria 3168, Australia
4Department of Computer Science and Software Engineering, University of Melbourne, Carlton, Victoria 3053, Australia

Tài liệu tham khảo

Atici, 1996, Some recursive constructions for perfect hash families, Journal of Combinatorial Designs, 4, 353, 10.1002/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E Alon, 1996, Derandomization witnesses for Boolean matrix multiplication and construction of perfect hash functions, Algorithmica, 16, 434, 10.1007/BF01940874 Beth, 1986 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–70 S.R. Blackburn, M. Burmester, Y. Desmedt, P.R. Wild, Efficient multiplicative sharing schemes, in: Advances in Cryptology–Eurocrypt '96, Lecture Notes in Computer Science, vol. 1070, Springer, Berlin, 1996, pp. 107–118 Blackburn, 1998, Optimal linear perfect hash families, Journal of Combinatorial Theory A, 83, 233, 10.1006/jcta.1998.2876 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 — Crypto '92, Proceedings, Lecture Notes in Computer Science, vol. 740, Springer, Berlin, 1993, pp. 471–486 Bruegge, 1996, Applications of mobile computing and communication, IEEE Personal Communication, 3, 64, 10.1109/98.486977 Czech, 1997, Perfect hashing, Theoretical Computer Science, 182, 1, 10.1016/S0304-3975(96)00146-6 1996 1998 Cameron, 1991 Y. Desmedt, R. Safavi-Naini, H. Wang, C. Charnes, J. Pieprzyk, Broadcast anti-jamming systems, in: IEEE International Conference in Netwoking, ICON'99 Dyer, 1995, On key storage in secure networks, Journal of Cryptology, 8, 189, 10.1007/BF00191355 Erdös, 1982, Families of finite sets in which no set is covered by the union of two others, Journal of Combinatorial Theory A, 33, 158, 10.1016/0097-3165(82)90004-8 Erdós, 1985, Families of finite sets in which no set is covered by the union of r others, Israel Journal of Mathematics, 51, 79, 10.1007/BF02772959 A. Fiat, M. Naor, Broadcast encryption, in: Advances in Cryptology–Crypto '93, Lecture Notes in Computer Science, vol. 773, Springer, Berlin, 1994, pp. 480–491 Fujii, 1996, Combinatorial bounds and design of broadcast authentication, IEICE Trans. E -A, 79, 502 Gong, 1990, A matrix key-distribution scheme, J. Cryptology, 2, 51, 10.1007/BF02252869 K. Mehlhorn, Data Structures and Algorithms, Vol. 1, Springer, Berlin, 1984 Menezes, 1996 Mitchell, 1988, Key storage in secure networks, Discrete Applied Mathematics, 21, 215, 10.1016/0166-218X(88)90068-6 O'Keefe, 1995, Key distribution patterns using Minkowski planes, Designs, Codes and Cryptography, 5, 261, 10.1007/BF01388388 President's Commission on Critical Infrastructure Protection, 1998, http://www.pccip.gov/ Quinn, 1994, Some constructions for key distribution patterns, Designs Codes and Cryptography, 4, 177, 10.1007/BF01578871 Satyanarayanan, 1996, Mobile information access, IEEE Personal Communication, 3, 26, 10.1109/98.486973 Stinson, 1997, On some methods for unconditionally secure key distribution and broadcast encryption, Designs Codes and Cryptography, 12, 215, 10.1023/A:1008268610932 Viterbi, 1995