Pages that link to "Item:Q2874514"
From MaRDI portal
The following pages link to New and Improved Key-Homomorphic Pseudorandom Functions (Q2874514):
Displaying 34 items.
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- Related-key security for pseudorandom functions beyond the linear barrier (Q1994635) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Updatable signatures and message authentication codes (Q2061942) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions (Q2149832) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge (Q2416940) (← links)
- Improving speed and security in updatable encryption schemes (Q2691598) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography (Q2698337) (← links)
- A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems (Q2817833) (← links)
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784) (← links)
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption (Q3297610) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Privacy-Preserving and yet Robust Collaborative Filtering Recommender as a Service (Q5040389) (← links)
- Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange (Q5041164) (← links)
- Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
- Watermarking cryptographic functionalities from standard lattice assumptions (Q5918350) (← links)
- Towards tightly secure short linearly homomorphic signatures (Q6613999) (← links)
- Time-lock puzzles with efficient batch solving (Q6636509) (← links)
