Efficient lattice-based inner-product functional encryption
From MaRDI portal
Recommendations
- Efficient functional encryption for inner-product values with full-hiding security
- On the practical security of inner product functional encryption
- Lattice-based hierarchical inner product encryption
- Functional encryption for inner product with full function privacy
- Simple functional encryption schemes for inner products
- Efficient function-hiding functional encryption: from inner-products to orthogonality
- Decentralizing inner-product functional encryption
- Improved (hierarchical) inner-product encryption from lattices
- Functional encryption for inner product based on matrix
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
Cites work
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- A toolkit for ring-LWE cryptography
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constant-Time Discrete Gaussian Sampling
- Decentralized multi-client functional encryption for inner product
- Decentralizing inner-product functional encryption
- Enhanced lattice-based signatures on reconfigurable hardware
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- FE for inner products and its application to decentralized ABE
- From single-input to multi-client inner-product functional encryption
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully secure functional encryption for inner products, from standard assumptions
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- Keccak
- Lattice signatures without trapdoors
- Making NTRU as secure as worst-case problems over ideal lattices
- Multi-client inner-product functional encryption in the random-oracle model
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Reusable garbled circuits and succinct functional encryption
- Rounding in the rings
- SWIFFT: A Modest Proposal for FFT Hashing
- Simple functional encryption schemes for inner products
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(12)- Dynamic decentralized functional encryptions from pairings in the standard model
- Module learning with errors with truncated matrices
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians
- Efficient updatable public-key encryption from lattices
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Efficient identity-based encryption with tight adaptive anonymity from RLWE
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Efficient identity-based inner product functional encryption from RLWE
- Impossibility results for lattice-based functional encryption schemes
- A refined hardness estimation of LWE in two-step mode
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
This page was built for publication: Efficient lattice-based inner-product functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169033)
