Constant input attribute based (and predicate) encryption from evasive and tensor LWE
From MaRDI portal
Publication:6190122
DOI10.1007/978-3-031-38551-3_17OpenAlexW4385654115MaRDI QIDQ6190122
Anshu Yadav, Shweta Agrawal, Mélissa Rossi, Shota Yamada
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_17
evasive \textsf{LWE}multi-input attribute based encryptionmulti-input predicate encryptiontensor \textsf{LWE}
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Cites Work
- Unnamed Item
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Decentralized multi-client functional encryption for inner product
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Non-trivial witness encryption and null-iO from standard assumptions
- Optimal broadcast encryption from pairings and LWE
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Optimal broadcast encryption from LWE and pairings in the standard model
- Candidate obfuscation via oblivious LWE sampling
- Multi-input quadratic functional encryption from pairings
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Multi-client functional encryption for linear functions in the standard model from LWE
- From single-input to multi-client inner-product functional encryption
- Decentralizing inner-product functional encryption
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Multi-party functional encryption
- Succinct LWE sampling, random polynomials, and obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Pseudorandom Functions and Lattices
- Indistinguishability Obfuscation from Compact Functional Encryption
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Multi-input Functional Encryption
- Multi-input Inner-Product Functional Encryption from Pairings
- Dual System Encryption via Predicate Encodings
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Multi-key and multi-input predicate encryption from learning with errors
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Indistinguishability obfuscation from circular security
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Witness encryption and null-iO from evasive LWE
- Candidate witness encryption from lattice techniques
- Multi-input attribute based encryption and predicate encryption
This page was built for publication: Constant input attribute based (and predicate) encryption from evasive and tensor LWE