New and Improved Key-Homomorphic Pseudorandom Functions
From MaRDI portal
Publication:2874514
DOI10.1007/978-3-662-44371-2_20zbMath1314.94053OpenAlexW2105994318MaRDI QIDQ2874514
Chris Peikert, Abhishek Banerjee
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_20
Related Items (35)
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 ⋮ Adaptively secure distributed PRFs from LWE ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Non-commutative ring learning with errors from cyclic algebras ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ 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 ⋮ 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 ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption ⋮ 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 ⋮ Related-key security for pseudorandom functions beyond the linear barrier ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Limits on the efficiency of (ring) LWE-based non-interactive key exchange ⋮ A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems ⋮ 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 ⋮ Pseudorandom Functions: Three Decades Later ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus
This page was built for publication: New and Improved Key-Homomorphic Pseudorandom Functions
