Combinatorial problems in cryptography and communication

Research output

Research output per year 2008 2008 2008

• 2 Article
• 1 Chapter

Research output per year

Research output per year

Search results

• 2008

  A bound on the size of separating hash families

  Blackburn, S. R., Etzion, T., Stinson, D. R. & Zaverucha, G. M., Oct 2008, In: Journal of Combinatorial Theory, Series A. 115, 7, p. 1246-1256 11 p.

  Research output: Contribution to journal › Article › peer-review

• Efficient key predistribution for grid-based wireless sensor networks

  Blackburn, S. R., Etzion, T., Martin, K. M. & Paterson, M. B., 2008, Information Theoretic Security. Safavi-Naini, R. (ed.). Berlin: Springer, Vol. 5155. p. 54-69 16 p. (Lecture Notes in Computer Science; vol. 5155).

  Research output: Chapter in Book/Report/Conference proceeding › Chapter

• Prolific codes with the identifiable parent property

  Blackburn, S. R., Etzion, T. & Ng, S.-L., 2008, In: SIAM Journal on Discrete Mathematics. 22, 4, p. 1393-1410 18 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  File

  82 Downloads (Pure)