Efficient lattice-based inner-product functional encryption

DOI10.1007/978-3-030-97131-1_6zbMath1519.94049MaRDI QIDQ6169033

Azam Soleimanian, Jose Maria Bermudo Mera, Angshuman Karmakar, Tilen Marc

Publication date: 10 August 2023

Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/20.500.12942/694495

zbMATH Keywords

lattice-based cryptography; functional encryption; multi-client functional encryption; inner-product; learning with errors over ring

Mathematics Subject Classification ID

94A60: Cryptography

68N20: Theory of compilers and interpreters

68P25: Data encryption (aspects in computer science)

Cites Work

• Unnamed Item
• Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
• Decentralized multi-client functional encryption for inner product
• Estimate all the {LWE, NTRU} schemes!
• Rounding in the rings
• Multi-client inner-product functional encryption in the random-oracle model
• From single-input to multi-client inner-product functional encryption
• FE for inner products and its application to decentralized ABE
• Decentralizing inner-product functional encryption
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Lattice Signatures without Trapdoors
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Simple Functional Encryption Schemes for Inner Products
• High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Functional Encryption: Definitions and Challenges
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• SWIFFT: A Modest Proposal for FFT Hashing
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Constant-Time Discrete Gaussian Sampling
• A Toolkit for Ring-LWE Cryptography
• Keccak
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
• Enhanced Lattice-Based Signatures on Reconfigurable Hardware
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Reusable garbled circuits and succinct functional encryption
• On lattices, learning with errors, random linear codes, and cryptography