Explicit constructions of separating hash families from algebraic curves over finite fields

DOI10.1007/S10623-006-9004-YMaRDI QIDQ851784zbMATH OpenOpenAlexFDO

Authors Li Hua Liu, Hao Shen

Publication date 22 November 2006

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-006-9004-y

zbMATH Keywords

Algebraic curveFrameproof (FP) codeIdentifiable parent property (IPP) codeSecure frameproof (SFP) codeSeparating hash familyStrong separating hash family

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Extremal set theory (05D05)

Recommendations

• Improved bounds for separating hash families
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• A tight bound on the size of certain separating hash families
• Constructions and bounds for separating hash families
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

Cites work

• scientific article; zbMATH DE number 2069521 (Why is no real title available?)
• scientific article; zbMATH DE number 1462939 (Why is no real title available?)
• scientific article; zbMATH DE number 1857520 (Why is no real title available?)
• A hypergraph approach to the identifying parent property: The case of multiple parents
• Algebraic function fields and codes
• Collusion-secure fingerprinting for digital data
• Combinatorial properties of frameproof and traceability codes
• Constructions of 2-cover-free families and related separating hash families
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• Generalized cover-free families.
• New constructions for IPP codes
• On codes with the identifiable parent property
• On some methods for unconditionally secure key distribution and broadcast encryption
• On the asymptotic behaviour of some towers of function fields over finite fields
• Rational points on curves over finite fields. Theory and Applications
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• The Lovász local lemma and its applications to some combinatorial arrays

Cited in

(7)

• Explicit constructions of perfect hash families from algebraic curves over finite fields
• Constructions and bounds for separating hash families
• Anonymity in shared symmetric key primitives
• A survey of cover-free families: constructions, applications, and generalizations
• Randomized Post-optimization for t-Restrictions
• Linear Time Constructions of Some $$d$$-Restriction Problems
• Almost optimal cover-free families

This page was built for publication: Explicit constructions of separating hash families from algebraic curves over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851784)