New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
From MaRDI portal
Publication:2056698
DOI10.1007/978-3-030-77870-5_18zbMath1479.94205OpenAlexW3172438887MaRDI QIDQ2056698
Qiqi Lai, Feng-Hao Liu, Zhedong Wang
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_18
Related Items (5)
Towards a Simpler Lattice Gadget Toolkit ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Multi-client functional encryption with fine-grained access control ⋮ (Inner-product) functional encryption with updatable ciphertexts
Cites Work
- Generating shorter bases for hard random lattices
- On the concrete hardness of learning with errors
- Stronger security for reusable garbled circuits, general definitions and attacks
- Functional encryption for bounded collusions, revisited
- Optimal bounded-collusion secure functional encryption
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
- Inner-product functional encryption with fine-grained access control
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Functional Encryption: New Perspectives and Lower Bounds
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Functional Encryption: Definitions and Challenges
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
- Predicate Encryption for Circuits from LWE
- From Selective to Adaptive Security in Functional Encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- Classical hardness of learning with errors
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
