Paper 2024/963
Shared OT and Its Applications to Unconditional Secure Integer Equality, Comparison and Bit-Decomposition
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.
- Keywords
- unconditional securitysecure comparisonbit-decompositionequality testOT.
- Contact author(s)
-
lpiske @ asu edu
jeroenvandegraaf @ proton me
annascim @ visa com
nitrieu @ asu edu - History
- 2024-06-17: approved
- 2024-06-14: received
- See all versions
- Short URL
- https://ia.cr/2024/963
- License
-
CC0
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 to Unconditional Secure Integer Equality, Comparison and Bit-Decomposition},
howpublished = {Cryptology ePrint Archive, Paper 2024/963},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/963}},
url = {https://eprint.iacr.org/2024/963}
}
