Key-homomorphic pseudorandom functions from LWE with small modulus

DOI10.1007/978-3-030-45724-2_20zbMath1492.94129OpenAlexW3012998019MaRDI QIDQ2119025

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_20

Related Items

Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions, Efficient and fully secure lattice-based IBE with equality test, Improving speed and security in updatable encryption schemes, Pseudorandom functions in NC class from the standard LWE assumption, Limits on the efficiency of (ring) LWE-based non-interactive key exchange, Updatable signatures and message authentication codes, Short identity-based signatures with tight security from lattices

Cites Work

Unnamed Item
Unnamed Item
On the concrete hardness of learning with errors
Synthesizers and their application to the parallel construction of pseudo-random functions
Watermarking PRFs under standard assumptions: public marking and security with extraction queries
Updatable encryption with post-compromise security
Key rotation for authenticated encryption
Private constrained PRFs (and more) from LWE
Simple and more efficient PRFs with tight security from LWE and matrix-DDH
More efficient lattice PRFs from keyed pseudorandom synthesizers
(R)CCA secure updatable encryption with integrity protection
Watermarking PRFs from lattices: stronger security via extractable PRFs
On the Hardness of Learning with Rounding over Small Modulus
Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
Riding on Asymmetry: Efficient ABE for Branching Programs
Learning with Rounding, Revisited
Key Homomorphic PRFs and Their Applications
Faster Bootstrapping with Polynomial Error
New and Improved Key-Homomorphic Pseudorandom Functions
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Pseudorandom Functions and Lattices
Lattice-based FHE as secure as PKE
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Keying Hash Functions for Message Authentication
Efficient Pseudorandom Functions via On-the-Fly Adaptation
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
Trapdoors for hard lattices and new cryptographic constructions
Bonsai Trees, or How to Delegate a Lattice Basis
Efficient Lattice (H)IBE in the Standard Model
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
A Pseudorandom Generator from any One-way Function
Fully homomorphic encryption using ideal lattices
Public-key cryptosystems from the worst-case shortest vector problem
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
Efficient Fully Homomorphic Encryption from (Standard) LWE
Classical hardness of learning with errors
Private Puncturable PRFs from Standard Lattice Assumptions
Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
New Proofs for NMAC and HMAC: Security Without Collision-Resistance
On lattices, learning with errors, random linear codes, and cryptography
Watermarking cryptographic functionalities from standard lattice assumptions