Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication

DOI10.1007/S10623-023-01211-XMaRDI QIDQ6101280zbMATH OpenOpenAlexFDO

Authors Hirokazu Kobayashi, Yohei Watanabe, Kazuhiko Minematsu, Junji Shikata

Publication date 20 June 2023

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10623-023-01211-x

zbMATH Keywords

anonymitybroadcast authenticationbroadcast encryptionlower bound

Mathematics Subject Classification ID

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

Recommendations

• Asymptotically tight lower bounds in anonymous broadcast encryption and authentication
• Improved anonymous broadcast encryptions -- tight security and shorter ciphertext
• Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
• Anonymous broadcast authentication with logarithmic-order ciphertexts from LWE
• A concise bounded anonymous broadcast yielding combinatorial trace-and-revoke schemes

Cites work

• (Hierarchical) identity-based encryption from affine message authentication
• Adaptive partitioning
• Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
• An algebraic framework for Diffie-Hellman assumptions
• Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
• Asymptotically tight lower bounds in anonymous broadcast encryption and authentication
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Déjà Q: encore! Un petit IBE
• scientific article; zbMATH DE number 1304088 (Why is no real title available?)
• scientific article; zbMATH DE number 1024079 (Why is no real title available?)
• scientific article; zbMATH DE number 2081086 (Why is no real title available?)
• scientific article; zbMATH DE number 1842485 (Why is no real title available?)
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Improved anonymous broadcast encryptions -- tight security and shorter ciphertext
• Kurosawa-Desmedt meets tight security
• Low overhead broadcast encryption from multilinear maps
• On the adaptive security of MACs and PRFs
• 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
• Quasi-adaptive NIZK for linear subspaces revisited
• The kernel matrix Diffie-Hellman assumption
• The “Coefficients H” Technique
• Tight adaptively secure broadcast encryption with short ciphertexts and keys
• Tightly CCA-secure encryption without pairings
• Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
• Tightly secure hierarchical identity-based encryption
• Tightly SIM-SO-CCA secure public key encryption from standard assumptions

Cited in

(4)

• Anonymous certificate-based broadcast encryption with constant decryption cost
• A concise bounded anonymous broadcast yielding combinatorial trace-and-revoke schemes
• An Anonymous Trace-and-Revoke Broadcast Encryption Scheme
• Anonymous broadcast authentication with logarithmic-order ciphertexts from LWE

This page was built for publication: Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication

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