Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth

DOI10.1007/978-981-95-5122-4_8MaRDI QIDQ7232716zbMATH OpenFDO

Authors F. Zhao, Shixin Chen, Man Ho Au, Jian Weng, Huaxiong Wang, Jian Guo

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5122-4_8

zbMATH Keywords

attribute-based encryptionbootstrappinghomomorphic encryptionproxy re-encryptionunbounded depth

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A full RNS variant of approximate homomorphic encryption
• ABE for circuits with constant-size secret keys and adaptive security
• An improved RNS variant of the BFV homomorphic encryption scheme
• Attribute-based encryption for circuits
• Attribute-based fully homomorphic encryption with a bounded number of inputs
• Attribute-based functional encryption on lattices
• Bonsai trees, or how to delegate a lattice basis
• Bootstrapping for BGV and BFV revisited
• Bootstrapping small integers with CKKS
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Dynamic multi target homomorphic attribute-based encryption
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Efficient lattice (H)IBE in the standard model
• Fast blind rotation for bootstrapping FHEs
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Fuzzy Identity-Based Encryption
• Generating shorter bases for hard random lattices
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
• scientific article; zbMATH DE number 1024063 (Why is no real title available?)
• Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
• Multi-key FHE from LWE, revisited
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• Targeted homomorphic attribute-based encryption
• TFHE: fast fully homomorphic encryption over the torus
• Threshold cryptosystems from threshold fully homomorphic encryption
• Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Two round multiparty computation via multi-key FHE

This page was built for publication: Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth

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