conference paper

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Satrajit Ghosh^a✉, J. Nielsen^a, Tobias Nilges^a

^aAarhus University, Aarhus, Denmark
✉Corresponding author

Lecture notes in computer science Springer Science+Business Media2017-01-01 55 citations33 references

Looking for the full paper…

Export

Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.

Abstract

No abstract is available from our sources. Use “Read paper” to view it.

TL;DRThis work presents a highly efficient and UC-secure construction of OLE in the OT-hybrid model that requires only O(1) OTs per OLE, and believes the protocol takes an important step towards basing practical active-secure arithmetic computations on OLEs. (Semantic Scholar)

Plain-language summary

AI illustration of the topic of “Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead”

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Abstract

Plain-language summary

Discussion