CryptoDB
Efficient Conversion of Secret-shared Values Between Different Fields
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-17898, title={Efficient Conversion of Secret-shared Values Between Different Fields}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / conversion}, url={http://eprint.iacr.org/2008/221}, note={ thorbek@brics.dk 14027 received 16 May 2008, last revised 28 May 2008}, author={Ivan Damgård and Rune Thorbek}, year=2008 }