Efficient dynamic traitor tracing

DOI10.1137/S0097539700367984MaRDI QIDQ2706136zbMATH OpenFDO

Authors Omer Berkman, Michal Parnas, Jiří Sgall

Publication date 19 March 2001

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539700367984

zbMATH Keywords

analysis of algorithmsasymptotic complexitycryptographytraitor tracing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Publication:4952673
• scientific article; zbMATH DE number 2081065
• Publication:4941865
• Improving the round complexity of traitor tracing schemes
• Low bandwidth dynamic traitor tracing schemes

Cited in

(9)

• Sliding-window dynamic frameproof codes
• Improving the round complexity of traitor tracing schemes
• scientific article; zbMATH DE number 2081065 (Why is no real title available?)
• scientific article; zbMATH DE number 1418305 (Why is no real title available?)
• scientific article; zbMATH DE number 1445354 (Why is no real title available?)
• Trade-Off Traitor Tracing
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Low bandwidth dynamic traitor tracing schemes
• An optimal endpoint trace embedding

This page was built for publication: Efficient dynamic traitor tracing

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