New and improved key-homomorphic pseudorandom functions
From MaRDI portal
Recommendations
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Key homomorphic PRFs and their applications
- Key-homomorphic constrained pseudorandom functions
- A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
Cited in
(54)- Adaptively secure distributed PRFs from LWE
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Quantum algorithms for the \(k\)-XOR problem
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- More efficient lattice PRFs from keyed pseudorandom synthesizers
- Related-key security for pseudorandom functions beyond the linear barrier
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Multiparty reusable non-interactive secure computation from LWE
- Updatable signatures and message authentication codes
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Adaptively secure constrained pseudorandom functions in the standard model
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
- Non-commutative ring learning with errors from cyclic algebras
- Symmetric primitives with structured secrets
- Pseudorandom functions from LWE: RKA security and application
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Pseudorandom functions in NC class from the standard LWE assumption
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Improving speed and security in updatable encryption schemes
- Lattice-based e-cash, revisited
- Two-round maliciously secure computation with super-polynomial simulation
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
- A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems
- Key homomorphic PRFs and their applications
- Towards tightly secure lattice short signature and id-based encryption
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Pseudorandom functions: three decades later
- Privacy-preserving and yet robust collaborative filtering recommender as a service
- Limits on the efficiency of (ring) LWE based non-interactive key exchange
- Constraining and watermarking PRFs from milder assumptions
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Updatable encryption in distributed storage systems using key-homomorphic pseudorandom functions
- Key-homomorphic constrained pseudorandom functions
- Private puncturable PRFs from standard lattice assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Watermarking cryptographic functionalities from standard lattice assumptions
- Minicrypt primitives with algebraic structure and applications
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Towards tightly secure short linearly homomorphic signatures
- Time-lock puzzles with efficient batch solving
- Learning with errors over group rings constructed by semi-direct product
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
- Strongly secure universal thresholdizer
- Batch anonymous MAC tokens from lattices
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- When simple permutations mix poorly. Limited independence does not imply pseudorandomness
- Batched \& non-interactive blind signatures from lattices
This page was built for publication: New and improved key-homomorphic pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874514)
