The following pages link to Tracing traitors (Q4545764):
Displaying 36 items.
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes (Q1008972) (← links)
- Improved versions of Tardos' fingerprinting scheme (Q1009029) (← links)
- Upper bounds for parent-identifying set systems (Q1009142) (← links)
- New upper bounds for parent-identifying codes and traceability codes (Q1650430) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← links)
- New constructions for IPP codes (Q1781000) (← links)
- A class of I.P.P. codes with efficient identification (Q1827562) (← links)
- On 2-parent-identifying set systems of block size 4 (Q2004967) (← links)
- Union-intersection-bounded families and their applications (Q2026353) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← 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)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- Distributing hash families with few rows (Q2333821) (← links)
- Pirate decoder for the broadcast encryption schemes from Crypto 2005 (Q2385401) (← links)
- Codes for copyright protection: the case of two pirates (Q2388220) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← 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)
- What Can We Learn Privately? (Q3093624) (← links)
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys (Q3593119) (← links)
- Defending against the Pirate Evolution Attack (Q3618672) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- On the measurement complexity of differentially private query answering (Q5046476) (← links)
- Traceable PRFs: Full Collusion Resistance and Active Security (Q5087266) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- A Note About the Traceability Properties of Linear Codes (Q5385526) (← links)
- Trade-Off Traitor Tracing (Q5458220) (← links)
- Upper Bounds for Set Systems with the Identifiable Parent Property (Q5502795) (← links)
- Efficient Traitor Tracing from Collusion Secure Codes (Q5502800) (← links)
- Watermarking cryptographic functionalities from standard lattice assumptions (Q5918350) (← links)
