Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
From MaRDI portal
Publication:2170046
Recommendations
- Optimal broadcast encryption from pairings and LWE
- Optimal broadcast encryption from LWE and pairings in the standard model
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Tight adaptively secure broadcast encryption with short ciphertexts and keys
Cites work
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate iO from homomorphic encryption schemes
- Candidate Multilinear Maps from Ideal Lattices
- Candidate obfuscation via oblivious LWE sampling
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Counterexamples to new circular security assumptions underlying iO
- CP-ABE for circuits (and More) in the symmetric key setting
- Cryptanalysis of GGH15 multilinear maps
- Cryptanalysis of the multilinear map over the integers
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption for inner products, from standard assumptions
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Fuzzy Identity-Based Encryption
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- Hardness of \(k\)-LWE and applications in traitor tracing
- scientific article; zbMATH DE number 1024079 (Why is no real title available?)
- Improved dual system ABE in prime-order groups via predicate encodings
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Key homomorphic PRFs and their applications
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Low overhead broadcast encryption from multilinear maps
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Obfuscating simple functionalities from knowledge assumptions
- Optimal broadcast encryption from LWE and pairings in the standard model
- Optimal broadcast encryption from pairings and LWE
- Return of GGH15: provable security against zeroizing attacks
- Secure Obfuscation in a Weak Multilinear Map Model
Cited in
(52)- Optimal broadcast encryption from pairings and LWE
- Optimal broadcast encryption from LWE and pairings in the standard model
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- Fully adaptive decentralized multi-authority \textsf{ABE}
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded
- Multi-authority ABE from lattices without random oracles
- Witness encryption and null-iO from evasive LWE
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- Lattice-based functional commitments: fast verification and cryptanalysis
- Distributed broadcast encryption from bilinear groups
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Attribute based encryption for Turing machines from lattices
- Time-lock puzzles from lattices
- Two-round threshold signature from algebraic one-more learning with errors
- Adaptively sound zero-knowledge SNARKs for UP
- FE for inner products and its application to multi-authority ABE
- Simple and general counterexamples for private-coin evasive LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- PKE and ABE with collusion-resistant secure key leasing
- Registered ABE and adaptively-secure broadcast encryption from succinct LWE
- Attribute-based encryption using sum-product decomposition of Boolean functions
- A generic approach to adaptively-secure broadcast encryption in the plain model
- Faster ABE for Turing machines from circular evasive LWE
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Two-round threshold signature from algebraic one-more learning with errors
- Dynamic decentralized functional encryption: generic constructions with strong security
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Distributed broadcast encryption from lattices
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Bounded collusion-resistant registered functional encryption for circuits
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Partial lattice trapdoors: how to split lattice trapdoors, literally
- Cross-primitive comparison in CP-ABE
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Obfuscating pseudorandom functions is post-quantum complete
- Pseudorandom FE, iO and applications
- Zeroizing attacks against evasive and circular evasive LWE
- Constrained verifiable random functions without obfuscation and friends
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- ABE for circuits with \(\mathsf{poly}(\lambda)\)-sized keys from LWE
- \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
- Lattice-based multi-authority/client attribute-based encryption for circuits
- Leaky LWE: learning with errors with semi-adaptive secret- and error-leakage
- A note on obfuscation-based attacks on private-coin evasive LWE
This page was built for publication: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170046)
