Paper 2019/768 Original: eprint.iacr.org/2019/768 ↗
Distributing any Elliptic Curve Based Protocol
Abstract
We show how to perform a full-threshold $n$-party actively secure MPC protocol over a subgroup of order $p$ of an elliptic curve group $E(K)$. This is done by utilizing a full-threshold $n$-party actively secure MPC protocol over $\mathbb{F}_p$ in the pre-processing model (such as SPDZ), and then locally mapping the Beaver triples from this protocol into equivalent triples for the elliptic curve. This allows us to transform essentially any one-party protocol over an elliptic curve, into an $n$-party one. As an example we show how to transform the shuffle protocol of Abe into an $n$-party protocol. This application requires us to also give an MPC protocol to derive the switches in a Waksman network from a generic permutation, which may be of independent interest.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2022-12-01: last updated
- 2019-07-02: published
- Short URL
- https://ia.cr/2019/768
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/768,
author = {Nigel P. Smart and Younes Talibi Alaoui},
title = {Distributing any Elliptic Curve Based Protocol},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/768},
year = {2019},
url = {https://eprint.iacr.org/2019/768}
}