Asymptotically tight lower bounds in anonymous broadcast encryption and authentication

DOI10.1007/978-3-030-92641-0_6MaRDI QIDQ2149789zbMATH OpenOpenAlexFDO

Authors Hirokazu Kobayashi, Junji Shikata, Yodai Watanabe

Publication date 29 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92641-0_6

zbMATH Keywords

anonymitybroadcast encryptionlower bound

Mathematics Subject Classification ID

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

Recommendations

• Improved anonymous broadcast encryptions -- tight security and shorter ciphertext
• Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
• Outsider-anonymous broadcast encryption with sublinear ciphertexts
• Anonymous certificate-based broadcast encryption with constant decryption cost
• Anonymous trace and revoke

Cites work

• Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
• Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• scientific article; zbMATH DE number 1842485 (Why is no real title available?)
• Improved anonymous broadcast encryptions -- tight security and shorter ciphertext
• Low overhead broadcast encryption from multilinear maps
• Optimal broadcast encryption from LWE and pairings in the standard model
• Optimal broadcast encryption from pairings and LWE
• Outsider-anonymous broadcast encryption with sublinear ciphertexts
• Privacy in Encrypted Content Distribution Using Private Broadcast Encryption
• Tight adaptively secure broadcast encryption with short ciphertexts and keys

Cited in

(5)

• Improved anonymous broadcast encryptions -- tight security and shorter ciphertext
• Anonymous certificate-based broadcast encryption with constant decryption cost
• A concise bounded anonymous broadcast yielding combinatorial trace-and-revoke schemes
• Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
• Anonymous broadcast authentication with logarithmic-order ciphertexts from LWE

This page was built for publication: Asymptotically tight lower bounds in anonymous broadcast encryption and authentication

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