Pages that link to "Item:Q5498721"
From MaRDI portal
The following pages link to Universally Composable Oblivious Transfer Based on a Variant of LPN (Q5498721):
Displaying 8 items.
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- An iterative correction method for practically LPN solving (Q6576954) (← links)
- Towards topology-hiding computation from oblivious transfer (Q6581794) (← links)
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer (Q6595938) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
