Pages that link to "Item:Q4544540"
From MaRDI portal
The following pages link to Combinatorial properties of frameproof and traceability codes (Q4544540):
Displaying 50 items.
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3 (Q306344) (← links)
- Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection (Q327317) (← links)
- Improved bounds for separating hash families (Q369437) (← links)
- Black-box Trace\&Revoke codes (Q378263) (← links)
- New bounds on \(\bar{2}\)-separable codes of length 2 (Q488247) (← links)
- On traceability property of equidistant codes (Q507497) (← links)
- Asymptotically optimal \(\overline {2}\)-separable codes with length 4 (Q507954) (← links)
- Cover-free codes and separating system codes (Q510467) (← links)
- Codes with the identifiable parent property for multimedia fingerprinting (Q517266) (← links)
- On codes with \(w\)-identifiable parent property (Q655125) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- Explicit constructions of separating hash families from algebraic curves over finite fields (Q851784) (← links)
- On tight bounds for binary frameproof codes (Q887414) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes (Q1008972) (← links)
- Upper bounds for parent-identifying set systems (Q1009142) (← links)
- Generalized hashing and parent-identifying codes. (Q1417959) (← links)
- New upper bounds for parent-identifying codes and traceability codes (Q1650430) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Improved bounds on 2-frameproof codes with length 4 (Q1755996) (← links)
- New constructions for IPP codes (Q1781000) (← links)
- A class of I.P.P. codes with efficient identification (Q1827562) (← links)
- An upper bound on the size of a code with the \(k\)-identifiable parent property (Q1873820) (← links)
- Traceability codes (Q1957960) (← links)
- New bounds on 2-frameproof codes of length 4 (Q1989034) (← links)
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance (Q2115728) (← links)
- New approaches to traitor tracing with embedded identities (Q2175935) (← links)
- Multimedia IPP codes with efficient tracing (Q2182061) (← links)
- On non-binary traceability set systems (Q2200518) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- A tight bound for frameproof codes viewed in terms of separating hash families (Q2249796) (← links)
- Sliding-window dynamic frameproof codes (Q2383995) (← links)
- Sequential and dynamic frameproof codes (Q2384002) (← links)
- On optimal codes with \(w\)-identifiable parent property (Q2384057) (← links)
- Bounds for separating hash families (Q2431271) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Binary fingerprinting codes (Q2486878) (← links)
- Recursive constructions of secure codes and hash families using difference function families. (Q2490863) (← links)
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions (Q2692377) (← links)
- Optimal 2-traceability codes of length 4 (Q2697541) (← links)
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems (Q3005592) (← links)
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes (Q3548833) (← links)
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys (Q3593119) (← links)
- Defending against the Pirate Evolution Attack (Q3618672) (← links)
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes (Q4388977) (← links)
- On the Properties of Algebraic Geometric Codes as Copy Protection Codes (Q5060052) (← links)
- Traceable PRFs: Full Collusion Resistance and Active Security (Q5087266) (← links)