Paper 2025/029
Highly Efficient Server-Aided Multiparty Subfield VOLE Distribution Protocol
, Beijing Institute of Mathematical Sciences and ApplicationsAbstract
In recent development of secure multi-party computation (MPC), pseudorandom correlations of subfield vector oblivious linear evaluation (sVOLE) type become popular due to their amazing applicability in multi-dimensional MPC protocols such as privacy-preserving biometric identification and privacy-preserving machine learning protocols. In this paper, we introduce a novel way of VOLE distribution in three-party and four-party honest majority settings with the aid of a trusted server. This new method significantly decreases the communication cost and the memory storage of random sVOLE instances. On the other hand, it also enables a streamline distribution process that can generate a sVOLE instance of an arbitrary length, which results in 100 percent of utility rate of random sVOLE in multi-dimensional MPC protocols while preserving complete precomputability.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- MPCserver-aided MPCtensor triplesubfield VOLE
- Contact author(s)
- wudongyu @ bimsa cn
- History
- 2025-01-09: approved
- 2025-01-08: received
- See all versions
- Short URL
- https://ia.cr/2025/029
- License
-
CC BY-NC-SA
BibTeX
@misc{cryptoeprint:2025/029,
author = {Dongyu Wu},
title = {Highly Efficient Server-Aided Multiparty Subfield {VOLE} Distribution Protocol},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/029},
year = {2025},
url = {https://eprint.iacr.org/2025/029}
}
