Universally Composable Oblivious Transfer Based on a Variant of LPN
From MaRDI portal
Publication:5498721
DOI10.1007/978-3-319-12280-9_10zbMath1378.94036OpenAlexW2156786434MaRDI QIDQ5498721
Rafael Dowsley, Anderson C. A. Nascimento, Bernardo David
Publication date: 10 February 2015
Published in: Cryptology and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12280-9_10
Related Items (5)
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
This page was built for publication: Universally Composable Oblivious Transfer Based on a Variant of LPN
