Efficient Conversion of Secret-shared Values Between Different Fields

Ivan Damgard; Rune Thorbek

Paper 2008/221

Efficient Conversion of Secret-shared Values Between Different Fields

Ivan Damgard and Rune Thorbek

Abstract

We show how to effectively convert a secret-shared bit $b$ over a prime field to another field. If initially given a random replicated secret share this conversion can be done by the cost of revealing one secret shared value. By using a pseudo-random function it is possible to convert arbitrary many bit values from one initial random replicated share. Furthermore, we generalize the conversion to handle general values of a bounded size.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Unknown where it was published
Keywords: conversion
Contact author(s): thorbek @ brics dk
History: 2008-05-28: last of 2 revisions; 2008-05-25: received; See all versions
Short URL: https://ia.cr/2008/221
License: CC BY

BibTeX

@misc{cryptoeprint:2008/221,
      author = {Ivan Damgard and Rune Thorbek},
      title = {Efficient Conversion of Secret-shared Values Between Different Fields},
      howpublished = {Cryptology ePrint Archive, Paper 2008/221},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/221}},
      url = {https://eprint.iacr.org/2008/221}
}