Distributed broadcast encryption from lattices

Cites work

A modular approach to registered ABE for unbounded predicates
A note on discrete Gaussian combinations of lattice vectors
Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
Attribute-based encryption for circuits
Attribute-based encryption for circuits of unbounded depth from lattices
Bonsai trees, or how to delegate a lattice basis
Candidate indistinguishability obfuscation and functional encryption for all circuits
Candidate witness encryption from lattice techniques
Chainable functional commitments for unbounded-depth circuits
Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
Decentralized dynamic broadcast encryption
Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
Discrete Gaussian leftover hash lemma over infinite domains
Distributed broadcast encryption from bilinear groups
Efficient laconic cryptography from learning with errors
Efficient lattice (H)IBE in the standard model
Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
scientific article; zbMATH DE number 1256724 (Why is no real title available?)
scientific article; zbMATH DE number 1024079 (Why is no real title available?)
scientific article; zbMATH DE number 1842483 (Why is no real title available?)
scientific article; zbMATH DE number 7829260 (Why is no real title available?)
Key homomorphic PRFs and their applications
Lattice-based functional commitments: fast verification and cryptanalysis
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
Lattice-based succinct arguments from vanishing polynomials (extended abstract)
Multi-authority ABE from lattices without random oracles
Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
On lattices, learning with errors, random linear codes, and cryptography
Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
Optimizing registration based encryption
Reducing the CRS size in registered ABE systems
Registered (inner-product) functional encryption
Registered ABE via predicate encodings
Registered attribute-based encryption
Registration-based encryption from standard assumptions
Registration-based encryption: removing private-key generator from IBE
SLAP: succinct lattice-based polynomial commitments from standard assumptions
Succinct vector, polynomial, and functional commitments from lattices
Threshold encryption with silent setup
Tight adaptively secure broadcast encryption with short ciphertexts and keys
Trapdoors for hard lattices and new cryptographic constructions
Trapdoors for lattices: simpler, tighter, faster, smaller
Verifiable registration-based encryption
Witness encryption and null-iO from evasive LWE

Cited in

(10)

Unbounded distributed broadcast encryption and registered ABE from succinct LWE
Registered ABE and adaptively-secure broadcast encryption from succinct LWE
A generic approach to adaptively-secure broadcast encryption in the plain model
Multi-authority registered attribute-based encryption
Pairing-based aggregate signatures without random oracles
Succinct witness encryption for batch languages and applications
Pseudorandom FE, iO and applications
Distributed monotone-policy encryption for DNFs from lattices
Silent threshold cryptography from pairings: expressive policies in the plain model
Threshold batched identity-based encryption from pairings in the plain model

This page was built for publication: Distributed broadcast encryption from lattices

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