Efficient permutation protocol for MPC in the head

Peeter Laud

Paper 2021/354

Efficient permutation protocol for MPC in the head

Peeter Laud

Abstract

The MPC-in-the-head construction (Ishai et al., STOC'07) give zero-knowledge proofs from secure multiparty computation (MPC) protocols. This paper presents an efficient MPC protocol for permuting a vector of values, making use of the relaxed communication model that can be handled by the MPC-in-the-head construction. Our construction allows more efficient ZK proofs for relations expressed in the Random Access Machine (RAM) model. As a standalone application of our construction, we present batch anonymizable ring signatures.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: zero knowledge public-key cryptography
Contact author(s): peeter laud @ cyber ee
History: 2021-03-18: received
Short URL: https://ia.cr/2021/354
License: CC BY

BibTeX

@misc{cryptoeprint:2021/354,
      author = {Peeter Laud},
      title = {Efficient permutation protocol for {MPC} in the head},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/354},
      year = {2021},
      url = {https://eprint.iacr.org/2021/354}
}