Paper 2024/963 Original: eprint.iacr.org/2024/963 ↗

Shared OT and Its Applications

Lucas Piske
Jeroen van de Graaf
Anderson C. A. Nascimento
Ni Trieu
Abstract

We present unconditionally perfectly secure protocols in the semi-honest setting for several functionalities: (1) private elementwise equality; (2) private bitwise integer comparison; and (3) bit-decomposition. These protocols are built upon a new concept called Shared Oblivious Transfer (Shared OT). Shared OT extends the one-out-of-N String OT by replacing strings with integers modulo $M$ and allowing additive secret-sharing of all inputs and outputs. These extensions can be implemented by simple local computations without incurring additional OT invocations. We believe our Shared OT may be of independent interest. Our protocols demonstrate the best round, communication, and computational complexities compared to all other protocols secure in a similar setting. Moreover, all of our protocols involve either 2 or 3 rounds.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2025-07-02: last updated
2024-06-14: published
Short URL
https://ia.cr/2024/963
License
https://creativecommons.org/publicdomain/zero/1.0/

BibTeX

@misc{cryptoeprint:2024/963,
      author = {Lucas Piske and Jeroen van de Graaf and Anderson C. A. Nascimento and Ni Trieu},
      title = {Shared OT and Its Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/963},
      year = {2024},
      url = {https://eprint.iacr.org/2024/963}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.