Key-homomorphic pseudorandom functions from LWE with small modulus
From MaRDI portal
Recommendations
- New and improved key-homomorphic pseudorandom functions
- More efficient lattice PRFs from keyed pseudorandom synthesizers
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Pseudorandom functions and lattices
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
Cites work
- (R)CCA secure updatable encryption with integrity protection
- A Pseudorandom Generator from any One-way Function
- An algebraic framework for pseudorandom functions and applications to related-key security
- Bonsai trees, or how to delegate a lattice basis
- Classical hardness of learning with errors
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient lattice (H)IBE in the standard model
- Efficient pseudorandom functions via on-the-fly adaptation
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster Bootstrapping with Polynomial Error
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- Key homomorphic PRFs and their applications
- Key rotation for authenticated encryption
- Keying hash functions for message authentication
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice-based FHE as secure as PKE
- Learning with rounding, revisited. New reduction, properties and applications
- More efficient lattice PRFs from keyed pseudorandom synthesizers
- Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
- New and improved key-homomorphic pseudorandom functions
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the hardness of learning with rounding over small modulus
- Private constrained PRFs (and more) from LWE
- Private puncturable PRFs from standard lattice assumptions
- Pseudorandom functions and lattices
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-key cryptosystems from the worst-case shortest vector problem
- Riding on asymmetry: efficient ABE for branching programs
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Updatable encryption with post-compromise security
- Watermarking cryptographic functionalities from standard lattice assumptions
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
Cited in
(18)- Random small Hamming weight products with applications to cryptography
- More efficient lattice PRFs from keyed pseudorandom synthesizers
- 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
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
- Pseudorandom functions from LWE: RKA security and application
- Pseudorandom functions in NC class from the standard LWE assumption
- Efficient and fully secure lattice-based IBE with equality test
- Improving speed and security in updatable encryption schemes
- Key homomorphic PRFs and their applications
- New and improved key-homomorphic pseudorandom functions
- Pseudorandom functions and lattices
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Pseudorandom functions in almost constant depth from low-noise LPN
- Strongly secure universal thresholdizer
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Towards practical GGM-based PRF from (module-)learning-with-rounding
This page was built for publication: Key-homomorphic pseudorandom functions from LWE with small modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119025)
