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

DOI10.1007/S10623-006-9004-YzbMATH Open1200.94047OpenAlexW2068590051MaRDI QIDQ851784FDOQ851784

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

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

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)

Cites Work

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

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)