Fast Algorithms for the Free Riders Problem in Broadcast Encryption

DOI10.1007/11818175_18MaRDI QIDQ5756653zbMATH OpenOpenAlexFDO

Authors Zulfikar Ramzan, David P. Woodruff

Publication date 4 September 2007

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

Full work available at URL https://doi.org/10.1007/11818175_18

zbMATH Keywords

applicationsbroadcast encryptionfree riders

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Optimal subset-difference broadcast encryption with free riders
• Punctured interval broadcast encryption scheme with free riders
• An Optimal Subset Cover for Broadcast Encryption
• scientific article; zbMATH DE number 1942412
• scientific article; zbMATH DE number 1024079

Cited in

(2)

• Punctured interval broadcast encryption scheme with free riders
• Optimal subset-difference broadcast encryption with free riders

This page was built for publication: Fast Algorithms for the Free Riders Problem in Broadcast Encryption

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