Paper 2024/1394
SLAMP-FSS: Two-Party Multi-Point Function Secret Sharing from Simple Linear Algebra
, University of Tarty, University of Tartu, Cybernetica AS, University of Tartu, Cybernetica ASAbstract
Multi-point function secret sharing (FSS) is a building block for pseudo- random correlation generators used in the novel silent correlation generation methods for various secure multiparty computation applications. However, the main construction used so far is the naive approach to combining several single point functions. In this paper, we propose an efficient and natural generalization of the point function. FSS scheme of Boyle et al. 2016 [BGI16 ] using a tree structure, a pseudorandom generator and systems of linear equations. Our schemes are more efficient in the evaluation phase than other previously proposed multi-point FSS schemes while being also more flexible and being similar in other efficiency parameters. Our setup phase is similar in cost to previous best versions, while the full evaluation, which is by far the costliest step, is more efficient.
Note: Updated the description of the scheme, the security proof and efficiency analysis.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- function secret sharingsecret sharingdistributed multi-point function
- Contact author(s)
-
erki kulaots @ ut ee
toomas krips @ ut ee
henrik eerikson @ cyber ee
pille pullonen-raudvere @ cyber ee - History
- 2025-04-09: last of 2 revisions
- 2024-09-05: received
- See all versions
- Short URL
- https://ia.cr/2024/1394
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1394,
author = {Erki Külaots and Toomas Krips and Hendrik Eerikson and Pille Pullonen-Raudvere},
title = {{SLAMP}-{FSS}: Two-Party Multi-Point Function Secret Sharing from Simple Linear Algebra},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1394},
year = {2024},
url = {https://eprint.iacr.org/2024/1394}
}
