Maliciously secure oblivious linear function evaluation with constant overhead
From MaRDI portal
Publication:2412886
DOI10.1007/978-3-319-70694-8_22zbMath1420.94067OpenAlexW2765370551MaRDI QIDQ2412886
Tobias Nilges, Jesper Buus Nielsen, Satrajit Ghosh
Publication date: 6 April 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70694-8_22
Related Items
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN, Somewhere statistically binding commitment schemes with applications, Full-threshold actively-secure multiparty arithmetic circuit garbling, Polynomial representation is tricky: maliciously secure private set intersection revisited, Highly efficient OT-based multiplication protocols, Batch-OT with optimal rate, Two-Round Oblivious Linear Evaluation from Learning with Errors, Actively secure arithmetic computation and VOLE with constant computational overhead, Private polynomial commitments and applications to MPC, Half-tree: halving the cost of tree expansion in COT and DPF, Indistinguishability obfuscation, Efficient, actively secure MPC with a dishonest majority: a survey, Finite interval-time transition system for real-time actors