General Public Key Residue Cryptosystems and Mental Poker Protocols

This paper presents a general method how to construct public key cryptosystems based on the r-th residue problem. Based on the proposed method, we present the first mental poker protocol which can shuffle any set of cards. Its fault tolerant version is given, too. An efficient zero knowledge interactive proof system for quadratic non-residuosity is also shown.