Paper 2023/1695
Implementing Arbitrary Maps over Small Finite Domains using Ring Addition and Scalar Multiplication
, ReityAbstract
Many secure computation schemes and protocols (such as numerous variants of secure multi-party computation and homomorphic encryption) have favorable performance characteristics when they are used to evaluate addition and scalar multiplication operations on private values that can be represented as ring elements. A purely algebraic argument (with no references to any specific protocol or scheme) can be used to show that the ability to perform these operations is sufficient to implement any univariate map that operates on private values when that map's domain is finite. Such implementations of univariate maps can be composed in sequence any number of times. Other forms of composition for such implementations can be realized by using multiplication operations involving ring elements, but it is possible that these can be substituted with scalar multiplication operations within certain secure computation workflows.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- secure function evaluation
- Contact author(s)
- al @ reity org
- History
- 2023-11-03: approved
- 2023-11-01: received
- See all versions
- Short URL
- https://ia.cr/2023/1695
- License
-
CC0
BibTeX
@misc{cryptoeprint:2023/1695,
author = {Andrei Lapets},
title = {Implementing Arbitrary Maps over Small Finite Domains using Ring Addition and Scalar Multiplication},
howpublished = {Cryptology ePrint Archive, Paper 2023/1695},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1695}},
url = {https://eprint.iacr.org/2023/1695}
}
