Pages that link to "Item:Q1710687"
From MaRDI portal
The following pages link to Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687):
Displaying 15 items.
- Towards practical GGM-based PRF from (module-)learning-with-rounding (Q778973) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- More efficient lattice PRFs from keyed pseudorandom synthesizers (Q1738055) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Verifiable random functions with optimal tightness (Q2061948) (← links)
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding (Q2061963) (← links)
- Short identity-based signatures with tight security from lattices (Q2118556) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting (Q6041292) (← links)
- Towards tightly secure short linearly homomorphic signatures (Q6613999) (← links)
