Probabilistic distributed key pre-distribution for mobile ad hoc networks

IEEE International Conference on Communications

Volumn 6, Issue , 2004, Pages 3743-3747

  Chan, Aldar C F ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; PUBLIC KEY CRYPTOGRAPHY; TELECOMMUNICATION NETWORKS; TOPOLOGY;

AD HOC NETWORKS; DISTRIBUTED KEY PREDISTRIBUTION SCHEME (DKPS); HOMOMORPHIC ENCRYPTION; KEY PREDISTRIBUTION SCHEMES (KPS);

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 4143052629     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2004.1313241     Document Type: Conference Paper

References (17)

1. G. Ateniese, M. Steiner, and G. Tsudik. New multiparty authentication services and key agreement protocols. IEEE Journal on Selected Areas in Communication, 18(4):628-640, April 2000.
2. K. Becker and U. Wille. Communication complexity of group key distribution. In proc. ACM CCS'98, pages 1-6, Washington D.C., USA, November 1998.
3. R. Blom. An optimal class of symmetric key generation system. In Advances in Cryptology - Eurocrypt'84, Springer-Verlag LNCS vol. 209, pages 335-338, 1985.
4. C. Blundo, A. De Santi, A. Herzberg, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In Advances in Cryptology - Crypto'92, Springer-Verlag LNCS vol. 740, pages 471-486, 1993.
5. A. C-F. Chan. Distributed symmetric key management for mobile ad hoc networks. In proc. IEEE INFOCOM'04, March 2004.
6. H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Security and Privacy 2003, May 2003.
7. P. Erdös, P. Frankl, and Z. Füredi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51(1-2):75-89, 1985.
8. L. Eschenauer and V. D. Gilgor. A key management scheme for distributed sensor networks. In proc. ACM CCS'02, pages 41-47, November 2002.
9. A. Fiat and M. Naor. Broadcast encryption. In Advances in Cryptology - Crypto'93, Springer-Verlag LNCS vol. 773, pages 480-491, 1994.
10. D. Halevy and A. Shamir. The LSD broadcast encryption scheme. In Advances in Cryptology - Crypto'02, Springer-Verlag LNCS vol. 2442, pages 47-60, 2002.
11. Y. Kim, A. Perrig, and G. Tsudik. Simple and fault-tolerant key agreement for dynamic collaborative groups. In proc. ACM CCS'00, pages 235-244, November 2000.
12. R. Kumar, S. Rajagopalan, and A. Sahai. Coding contractions for blacklisting problems without computational assumptions. In Advances in Cryptology - Crypto'99, Springer-Verlag LNCS vol. 1666, pages 609-623, 1999.
13. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
14. C. J. Mitchell and F. C. Piper. Key storage in secure networks. Discrete Applied Mathematics, 21:215-228, 1988.
15. D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for stateless receivers. In Advances in Cryptology - Crypto'01, Springer-Verlag LNCS vol. 2139, pages 41-62, 2001.
16. B. C. Neuman and T. Tso. Kerberos: An authentication service for computer networks. IEEE Trans. on Communication, 32:33-38, 1994.
17. D. R. Stinson, R Wei, and L. Zhu. Some new bounds for cover-free families. J. Combin. Theory A, 90:224-234, 200.