A bound on the size of separating hash families (2008)

First Author: Blackburn S
Attributed to:  Combinatorial Problems in Cryptography and Communication funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.jcta.2008.01.009

Publication URI: http://dx.doi.org/10.1016/j.jcta.2008.01.009

Type: Journal Article/Review

Parent Publication: Journal of Combinatorial Theory, Series A

Issue: 7