Pages that link to "Item:Q5021131"
From MaRDI portal
The following pages link to Pseudorandom Functions: Three Decades Later (Q5021131):
Displaying 17 items.
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions (Q2061985) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions (Q2149832) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- From non-adaptive to adaptive pseudorandom functions (Q2344050) (← links)
- Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange (Q5041164) (← links)
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173) (← links)
- (Q5092467) (← links)
- (Q5121893) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Subversion-resilient authenticated encryption without random oracles (Q6535130) (← links)
- Limits of preprocessing (Q6581870) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)