A public-key threshold cryptosystem based on residue rings

Abstract

We present a generalization of Pedersen’s public-key threshold cryptosystem. Pedersen’s protocol relies on the field properties of ℤ _p . We generalize the protocol so that the calculations can be performed in residue rings that are not necessarily fields. The protocol presented here is polynomial-time equivalent to Pedersen’s.

Keywords and phrases:

• Threshold cryptosystem
• trusted party
• residue rings