EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

More Efficient Lattice-based OLE

Leo de Castro, Duhyeong Kim, Miran Kim, Keewoo Lee, Seonhong Min, Yongsoo Song

IACR Communications in Cryptology · 04.05.2026 · 3 (1)

DOI: 10.62056/avivr-zn4 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IACR Communications in Cryptology, online erschienen am 04.05.2026. Verfasst von Leo de Castro und 5 weiteren Autor:innen. Die Arbeit nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We present a new and efficient method to obtain circuit privacy for lattice-based linearly homomorphic encryptions (LHE). In particular, our method does not involve noise-flooding with superpolynomially large errors or iterative bootstrapping. As a direct result, we obtain a semi-honest oblivious linear evaluation (OLE) protocol with the same efficiency, reducing the communication cost of the prior state of the art by 50%. Consequently, the amortized time of our protocol improves upon the prior work by 33% under a 100Mbps network setting. Our semi-honest OLE is the first to achieve both concrete efficiency and asymptotic quasi-optimality.

Zitieren

APA

Castro, L. D., Kim, D., Kim, M., Lee, K., Min, S., & Song, Y. (2026). More Efficient Lattice-based OLE. IACR Communications in Cryptology, 3(1). https://doi.org/10.62056/avivr-zn4

Vancouver

Castro LD, Kim D, Kim M, Lee K, Min S, Song Y. More Efficient Lattice-based OLE. IACR Communications in Cryptology. 2026;3(1). doi:10.62056/avivr-zn4

BibTeX
@article{Castro2026,
  author = {Castro, Leo de and Kim, Duhyeong and Kim, Miran and Lee, Keewoo and Min, Seonhong and Song, Yongsoo},
  title = {More Efficient Lattice-based OLE},
  journal = {IACR Communications in Cryptology},
  year = {2026},
  volume = {3},
  number = {1},
  doi = {10.62056/avivr-zn4}
}
Kostenlos starten →