On generalized separating hash families

Authors:
D. R. Stinson;R. Wei;K. Chen
Affiliations:
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada;Department of Computer Science, Lakehead University, Thunder Bay, ON P7B 5E1, Canada;Department of Mathematics, Yancheng Teachers College, Jiangsu 224002, China
Venue:
Journal of Combinatorial Theory Series A
Year:
2008

Citing 18
Cited 6

On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
Optimal linear perfect hash families

Journal of Combinatorial Theory Series A
Perfect hash families: probabilistic methods and explicit constructions

Journal of Combinatorial Theory Series A
Explicit constructions of perfect hash families from algebraic curves over finite fields

Journal of Combinatorial Theory Series A
Frameproof codes against limited coalitions of pirates

Theoretical Computer Science
Parent-identifying codes

Journal of Combinatorial Theory Series A
Frameproof and IPP Codes

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
An upper bound on the size of a code with the k-identifiable parent property

Journal of Combinatorial Theory Series A
Intersecting codes and separating codes

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
A class of I.P.P. codes with efficient identification

Journal of Complexity - Special issue on coding and cryptography
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents

Combinatorics, Probability and Computing
New Constructions for IPP Codes

Designs, Codes and Cryptography
Recursive constructions of secure codes and hash families using difference function families

Journal of Combinatorial Theory Series A
A trellis-based bound on (2,1)-separating codes

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
Asymptotic bounds on frameproof codes

IEEE Transactions on Information Theory
Digital fingerprinting codes: problem statements, constructions, identification of traitors

IEEE Transactions on Information Theory
Upper bounds on separating codes

IEEE Transactions on Information Theory

A bound on the size of separating hash families

Journal of Combinatorial Theory Series A
Bounds for separating hash families

Journal of Combinatorial Theory Series A
Efficient conditional expectation algorithms for constructing hash families

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Strengthening hash families and compressive sensing

Journal of Discrete Algorithms
Testers and their applications

Proceedings of the 5th conference on Innovations in theoretical computer science
Improved bounds for separating hash families

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Separating hash families are useful combinatorial structures which are studied in a general form in this paper. Necessary and sufficient conditions for the existence of certain types of generalized hash functions are considered.