Predicate encryption from lattices: enhanced compactness and refined functionality

DOI10.1007/978-3-031-91826-1_2MaRDI QIDQ6951342zbMATH OpenFDO

Authors Yuejun Wang, Baocang Wang, Qiqi Lai, Huaxiong Wang

Publication date 29 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91826-1_2

zbMATH Keywords

compactnessfunctionalityselective fully attribute-hiding security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Adaptive simulation security for inner product functional encryption
• Adaptively simulation-secure attribute-hiding predicate encryption
• Attribute-hiding predicate encryption in bilinear groups, revisited
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Efficient lattice (H)IBE in the standard model
• FE for inner products and its application to decentralized ABE
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Fully secure functional encryption for inner products, from standard assumptions
• Functional encryption for bounded collusions, revisited
• Functional encryption with bounded collusions via multi-party computation
• Functional encryption: definitions and challenges
• Functional encryption: new perspectives and lower bounds
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Indistinguishability obfuscation from compact functional encryption
• Indistinguishability obfuscation from functional encryption
• Inner-product functional encryption with fine-grained access control
• New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
• Optimal bounded-collusion secure functional encryption
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Predicate encryption for circuits from LWE
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Private constrained PRFs (and more) from LWE
• Reusable garbled circuits and succinct functional encryption
• Semi-adaptive security and bundling functionalities made generic and easy
• Stronger security for reusable garbled circuits, general definitions and attacks
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Unbounded predicate inner product functional encryption from pairings

This page was built for publication: Predicate encryption from lattices: enhanced compactness and refined functionality

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