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

DOI10.1007/s10623-006-9004-yzbMath1200.94047OpenAlexW2068590051MaRDI QIDQ851784

Lihua 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

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

Related Items

Almost Optimal Cover-Free Families ⋮ Anonymity in shared symmetric key primitives ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Randomized Post-optimization for t-Restrictions ⋮ Constructions and bounds for separating hash families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• On codes with the identifiable parent property
• On the asymptotic behaviour of some towers of function fields over finite fields
• On some methods for unconditionally secure key distribution and broadcast encryption
• Generalized cover-free families.
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• New constructions for IPP codes
• The Lovász local lemma and its applications to some combinatorial arrays
• A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
• Constructions of 2-cover-free families and related separating hash families
• Combinatorial properties of frameproof and traceability codes
• Collusion-secure fingerprinting for digital data
• Explicit constructions of perfect hash families from algebraic curves over finite fields