|
|||||
|
|
A bound on the size of separating hash families |
|
| Authors: | Simon R. Blackburn |
| Affiliation: | a Department of Mathematics, Royal Holloway, University of London, Egham, Surrey TW20 0EX, United Kingdom b Department of Computer Science, Technion - Israel Institute of Technology, Technion City, Haifa 32000, Israel c David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada |
| Abstract: | The paper provides an upper bound on the size of a (generalized) separating hash family, a notion introduced by Stinson, Wei and Chen. The upper bound generalizes and unifies several previously known bounds which apply in special cases, namely bounds on perfect hash families, frameproof codes, secure frameproof codes and separating hash families of small type. |
| Keywords: | Separating hash family Perfect hash family Frameproof code Secure frameproof code |
| 本文献已被 ScienceDirect 等数据库收录！ | |