Optimal broadcast encryption from pairings and LWE
From MaRDI portal
Publication:2055600
DOI10.1007/978-3-030-45721-1_2zbMath1479.94105OpenAlexW3013896566MaRDI QIDQ2055600
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_2
Related Items (19)
Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin ⋮ Asymptotically tight lower bounds in anonymous broadcast encryption and authentication ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ A survey of lattice based expressive attribute based encryption ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication ⋮ ABE for circuits with constant-size secret keys and adaptive security ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ To label, or not to label (in generic groups) ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Succinct and adaptively secure ABE for ABP from \(k\)-Lin ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings ⋮ Generic transformation from broadcast encryption to round-optimal deniable ring authentication
Cites Work
- Unnamed Item
- Stronger security for reusable garbled circuits, general definitions and attacks
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Riding on Asymmetry: Efficient ABE for Branching Programs
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- (Leveled) fully homomorphic encryption without bootstrapping
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Automated Analysis of Cryptographic Assumptions in Generic Group Models
- Low Overhead Broadcast Encryption from Multilinear Maps
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Cryptanalysis of the Multilinear Map over the Integers
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Trapdoors for hard lattices and new cryptographic constructions
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Attribute-based encryption for circuits
- Classical hardness of learning with errors
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Cryptography and Coding
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Optimal broadcast encryption from pairings and LWE
