Linear code implies public-key traitor tracing

DOI10.1007/3-540-45664-3_12MaRDI QIDQ3043936zbMATH OpenFDO

Authors Kaoru Kurosawa, Takuya Yoshida

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2274/22740172.htm

zbMATH Keywords

Kurosawa-Desmedt schemelinear coded schemestraceability schemes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• Information Security and Privacy
• Improving the Boneh-Franklin Traitor Tracing Scheme
• An efficient public key traitor tracing scheme. (Extended abstract)
• Applied Cryptography and Network Security
• A Note About the Traceability Properties of Linear Codes

Cited in

(11)

• Hardness of \(k\)-LWE and applications in traitor tracing
• New approaches to traitor tracing with embedded identities
• A public-key traitor tracing scheme with revocation using dynamic shares
• Multi-round secure light-weight broadcast exclusion protocol with pre-processing
• Collusion resistant traitor tracing from learning with errors
• Information Security and Privacy
• A Note About the Traceability Properties of Linear Codes
• Public Key Broadcast Encryption with Low Number of Keys and Constant Decryption Time
• Watermarking cryptographic functionalities from standard lattice assumptions
• Beyond software watermarking: traitor-tracing for pseudorandom functions
• Fully collusion resistant traceable identity-based inner product functional encryption

This page was built for publication: Linear code implies public-key traitor tracing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043936)