New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
type: Item
instance of: scholarly article
title: New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
zbMATH Open document ID: 1479.94205
DOI: 10.1007/978-3-030-77870-5_18
author: Qiqi Lai
author: Feng-Hao Liu
author: Zhedong Wang
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7440590
zbMATH Keywords: lattice-based cryptography
zbMATH Keywords: trapdoor functions
MaRDI profile type: Publication
full work available at URL: 978-3-030-77870-5 18
OpenAlex ID: W3172438887
cites work: Inner-product functional encryption with fine-grained access control
cites work: Stronger security for reusable garbled circuits, general definitions and attacks
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Functional Encryption: New Perspectives and Lower Bounds
cites work: Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
cites work: Functional encryption for bounded collusions, revisited
cites work: On the concrete hardness of learning with errors
cites work: Generating shorter bases for hard random lattices
cites work: From Selective to Adaptive Security in Functional Encryption
cites work: Optimal bounded-collusion secure functional encryption
cites work: Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
cites work: Functional Encryption: Definitions and Challenges
cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
cites work: Classical hardness of learning with errors
cites work: Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
cites work: Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Improved Short Lattice Signatures in the Standard Model
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Reusable garbled circuits and succinct functional encryption
cites work: Functional Encryption with Bounded Collusions via Multi-party Computation
cites work: Attribute-based encryption for circuits
cites work: Predicate Encryption for Circuits from LWE
cites work: Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
cites work: Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: On lattices, learning with errors, random linear codes, and cryptography
description: scientific article; zbMATH DE number 7440590