Some bounds and a construction for secure broadcast encryption

DOI10.1007/3-540-49649-1_33MaRDI QIDQ4249285zbMATH OpenFDO

Authors Kaoru Kurosawa, Takuya Yoshida, Yvo Desmedt, M. V. D. Burmester

Publication date 17 June 1999

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

Full work available at URL https://doi.org/10.1007/3-540-49649-1_33

zbMATH Keywords

ElGamal cryptosystemkey predistribution schemelower boundsmultiple-use broadcast encryption schemeone-time use broadcast encryption schemesize of the secret keys

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constructions of unconditionally secure broadcast encryption from key predistribution systems with trade-offs between communication and storage
• Broadcast encryption
• Combinatorial bounds for broadcast encryption
• Space requirements for broadcast encryption

Cited in

(12)

• Broadcast encryption with guessing secrecy
• Linear broadcast encryption schemes
• Improving the trade-off between storage and communication in broadcast encryption schemes
• Linear broadcast encryption schemes
• An application of ramp schemes to broadcast encryption
• Unconditionally secure revocable storage: tight bounds, optimal construction, and robustness
• Constructions of unconditionally secure broadcast encryption from key predistribution systems with trade-offs between communication and storage
• Combinatorial bounds for broadcast encryption
• Space requirements for broadcast encryption
• Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
• Constructions of Secure Multi-Channel Broadcast Encryption Schemes in Public Key Framework
• \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption

This page was built for publication: Some bounds and a construction for secure broadcast encryption

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