Distributed broadcast encryption from bilinear groups
From MaRDI portal
Publication:6604936
DOI10.1007/978-981-99-8733-7_13zbMATH Open1547.94379MaRDI QIDQ6604936
Giulio Malavolta, Hoeteck Wee, Dimitris Kolonelos
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Updatable and universal common reference strings with applications to zk-SNARKs
- Registration-based encryption: removing private-key generator from IBE
- Tight adaptively secure broadcast encryption with short ciphertexts and keys
- Optimal broadcast encryption from pairings and LWE
- Candidate iO from homomorphic encryption schemes
- Optimal broadcast encryption from LWE and pairings in the standard model
- Candidate obfuscation via oblivious LWE sampling
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Registration-based encryption from standard assumptions
- An Algebraic Framework for Diffie-Hellman Assumptions
- Low Overhead Broadcast Encryption from Multilinear Maps
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Decentralized Dynamic Broadcast Encryption
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Advances in Cryptology – CRYPTO 2004
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Efficient laconic cryptography from learning with errors
- Registered attribute-based encryption
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
- Factoring and pairings are not necessary for iO: circular-secure LWE suffices
Related Items (1)
This page was built for publication: Distributed broadcast encryption from bilinear groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604936)
