Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

DOI10.1016/S0378-3758(99)00131-7zbMath1054.94013OpenAlexW2091887150WikidataQ60962397 ScholiaQ60962397MaRDI QIDQ1569877

Tran van Trung, Rui Zhong Wei, Douglas R. Stinson

Publication date: 2000

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(99)00131-7

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (62)

Almost Optimal Cover-Free Families ⋮ Strongly separable codes ⋮ A group testing method for finding patterns in data ⋮ Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ Perfect Hash Families: Constructions and Existence ⋮ Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ On generalizations of separating and splitting families ⋮ A sequence approach to linear perfect hash families ⋮ Generalised cumulative arrays in secret sharing ⋮ Secret sharing schemes with partial broadcast channels ⋮ Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ On Symmetric Designs and Binary 3-Frameproof Codes ⋮ Unnamed Item ⋮ Improved bounds for separating hash families ⋮ On optimal cryptographic key derivation ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ On tight bounds for binary frameproof codes ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ Strengthening hash families and compressive sensing ⋮ The design of (almost) disjunct matrices by evolutionary algorithms ⋮ Detecting arrays for effects of single factors ⋮ A hierarchical framework for recovery in compressive sensing ⋮ New combinatorial structures with applications to efficient group testing with inhibitors ⋮ Bounds for separating hash families ⋮ Wide-sense 2-frameproof codes ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Splitting systems and separating systems. ⋮ Generalized cover-free families. ⋮ Uniqueness of some optimal superimposed codes ⋮ Some intriguing upper bounds for separating hash families ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ Some new bounds for cover-free families ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ A recursive construction for perfect hash families ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ Asymptotically optimal \(\overline {2}\)-separable codes with length 4 ⋮ On generalized separating hash families ⋮ Geometric constructions of optimal linear perfect hash families ⋮ 2-secure codes from 2-SFP codes ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ Threshold and Majority Group Testing ⋮ Randomized Post-optimization for t-Restrictions ⋮ A bound on the size of separating hash families ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ Explicit constructions of perfect hash families from algebraic curves over finite fields ⋮ Binary fingerprinting codes ⋮ Recursive constructions of secure codes and hash families using difference function families. ⋮ New constructions for IPP codes ⋮ Constructions and bounds for separating hash families ⋮ Broadcast authentication for group communication ⋮ Explicit constructions for perfect hash families ⋮ Linear hash families and forbidden configurations ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ On optimal superimposed codes ⋮ Error-tolerant nonadaptive interval group testing with density-based tests ⋮ RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES ⋮ Unnamed Item ⋮ Distributing hash families with few rows ⋮ Perfect hash families: Probabilistic methods and explicit constructions ⋮ Distributing the encryption and decryption of a block cipher ⋮ Frameproof codes against limited coalitions of pirates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A matrix key-distribution scheme
• New combinatorial designs and their applications to group testing
• Families of finite sets in which no set is covered by the union of \(r\) others
• Key storage in secure networks
• Families of finite sets in which no set is covered by the union of two others
• Some new results on key distribution patterns and broadcast encryption
• Some constructions for key distribution patterns
• On some methods for unconditionally secure key distribution and broadcast encryption
• Key distribution patterns using Minkowski planes
• Bounds for key distribution patterns
• On the extremal combinatorics of the Hamming space
• On key storage in secure networks
• Asymmetric Fingerprinting
• Efficient Multiplicative Sharing Schemes
• Separating Partition Systems and Locally Different Sequences
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Protocols for collusion-secure asymmetric fingerprinting
• Nonrandom binary superimposed codes

This page was built for publication: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures