Efficient protocols for oblivious linear function evaluation from ring-LWE

DOI10.1007/978-3-030-57990-6_7MaRDI QIDQ2106636zbMATH OpenOpenAlexFDO

Authors Carsten Baum, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Troncoso-Pastoriza, Daniel E. Escudero

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57990-6_7

zbMATH Keywords

two-party protocolsecret-shared multiplication

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Two-round oblivious linear evaluation from learning with errors
• Maliciously secure oblivious linear function evaluation with constant overhead
• Secure arithmetic computation with constant computational overhead
• Linear-Complexity Private Function Evaluation is Practical
• Theory of Cryptography

Cited in

(8)

• Non-interactive secure computation of inner-product from LPN and LWE
• Maliciously secure oblivious linear function evaluation with constant overhead
• Sok: vector OLE-based zero-knowledge protocols
• Correlated pseudorandomness from the hardness of quasi-abelian decoding
• Two-round oblivious linear evaluation from learning with errors
• Asymptotically quasi-optimal cryptography
• Highly efficient OT-based multiplication protocols
• SLAP: simpler, improved private stream aggregation from ring learning with errors

This page was built for publication: Efficient protocols for oblivious linear function evaluation from ring-LWE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106636)