Equivocal broadcast encryption: adaptively-secure optimal distributed broadcast encryption from lattices
From MaRDI portal
Cites work
- A generic approach to adaptively-secure broadcast encryption in the plain model
- A quasipolynomial reduction for generalized selective decryption on trees
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Adaptive Security of Constrained PRFs
- Adaptive security of Yao's garbled circuits
- Adaptively secure garbled circuits from one-way functions
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Be adaptive, avoid overcommitting
- Bonsai trees, or how to delegate a lattice basis
- Broadcast encryption
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Collusion resistant broadcast and trace from positional witness encryption
- Collusion resistant traitor tracing from learning with errors
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Distributed broadcast encryption from bilinear groups
- Distributed broadcast encryption from lattices
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient lattice (H)IBE in the standard model
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fuzzy Identity-Based Encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
- Registered ABE and adaptively-secure broadcast encryption from succinct LWE
- Registered ABE via predicate encodings
- Registered attribute-based encryption
- Registration-based encryption: removing private-key generator from IBE
- Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
- Short and Stateless Signatures from the RSA Assumption
- Succinct computational secret sharing
- Threshold encryption with silent setup
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Unbounded distributed broadcast encryption and registered ABE from succinct LWE
- Verifiable registration-based encryption
This page was built for publication: Equivocal broadcast encryption: adaptively-secure optimal distributed broadcast encryption from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443215)