Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
From MaRDI portal
DOI10.1016/S0378-3758(99)00131-7zbMATH Open1054.94013OpenAlexW2091887150WikidataQ60962397 ScholiaQ60962397MaRDI QIDQ1569877FDOQ1569877
Authors: Tran van Trung, D. R. Stinson, Ruizhong Wei 
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
Recommendations
Cites Work
- Families of finite sets in which no set is covered by the union of two others
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonrandom binary superimposed codes
- Title not available (Why is that?)
- Some new results on key distribution patterns and broadcast encryption
- On some methods for unconditionally secure key distribution and broadcast encryption
- Separating Partition Systems and Locally Different Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Families of finite sets in which no set is covered by the union of \(r\) others
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the extremal combinatorics of the Hamming space
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Key storage in secure networks
- On key storage in secure networks
- A matrix key-distribution scheme
- Title not available (Why is that?)
- New combinatorial designs and their applications to group testing
- Efficient Multiplicative Sharing Schemes
- Asymmetric fingerprinting
- Some constructions for key distribution patterns
- Key distribution patterns using Minkowski planes
- Bounds for key distribution patterns
- Protocols for collusion-secure asymmetric fingerprinting (extended abstract)
Cited In (66)
- Non-adaptive complex group testing with multiple positive sets
- Title not available (Why is that?)
- Broadcast authentication for group communication
- A survey of cover-free families: constructions, applications, and generalizations
- Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
- The design of (almost) disjunct matrices by evolutionary algorithms
- Binary fingerprinting codes
- 2-secure codes from 2-SFP codes
- Randomized Post-optimization for t-Restrictions
- RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES
- On symmetric designs and binary 3-frameproof codes
- Wide-sense 2-frameproof codes
- A group testing method for finding patterns in data
- Intersecting codes and partially identifying codes
- Frameproof Codes
- Frameproof codes against limited coalitions of pirates
- Generalized cover-free families.
- New constructions for IPP codes
- Distributing hash families with few rows
- Strongly separable codes
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Some new bounds for cover-free families
- Linear hash families and forbidden configurations
- Generalised cumulative arrays in secret sharing
- Secret sharing schemes with partial broadcast channels
- New bounds on \(\bar{2}\)-separable codes of length 2
- Improved bounds on 2-frameproof codes with length 4
- Constructions and bounds for separating hash families
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Explicit constructions of separating hash families from algebraic curves over finite fields
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3
- Improved bounds for separating hash families
- Detecting arrays for effects of single factors
- On generalizations of separating and splitting families
- On tight bounds for binary frameproof codes
- Secure Frameproof Code Through Biclique Cover
- New combinatorial structures with applications to efficient group testing with inhibitors
- Some intriguing upper bounds for separating hash families
- Separating hash families: a Johnson-type bound and new constructions
- A sequence approach to linear perfect hash families
- Geometric constructions of optimal linear perfect hash families
- Threshold and Majority Group Testing
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- Perfect hash families: Probabilistic methods and explicit constructions
- Distributing the encryption and decryption of a block cipher
- On optimal superimposed codes
- Asymptotically optimal \(\overline {2}\)-separable codes with length 4
- Splitting systems and separating systems.
- Bounds for separating hash families
- Non-adaptive complex group testing with multiple positive sets
- Recursive constructions of secure codes and hash families using difference function families.
- A tight bound for frameproof codes viewed in terms of separating hash families
- A recursive construction for perfect hash families
- Uniqueness of some optimal superimposed codes
- A hierarchical framework for recovery in compressive sensing
- Perfect Hash Families: Constructions and Existence
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Strengthening hash families and compressive sensing
- On generalized separating hash families
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Error-tolerant nonadaptive interval group testing with density-based tests
- Almost optimal cover-free families
- On optimal cryptographic key derivation
- A bound on the size of separating hash families
- Explicit constructions for perfect hash families
This page was built for publication: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569877)
