The Sampling Twice Technique for the RSA-based Cryptosystems with Anonymity : Extended Abstract (Theoretical Computer Science and its Applications)
Ryotaro Hayashi, Keisuke Tanaka · Kyoto University Research Information Repository (Kyoto University) · 2005
We say that an encryption scheme or asignature scheme provides anonymity when it is infeasible to determine which user generated aciphertext or asignature.To can struct the schemes with anonymity, it is necessary that the space of ciphertexts or signatures is common to each user.In this paper, we focus on the techniques which can be used to obtain this anonymity property, and propose anew technique for obtaini $\mathrm{n}\mathrm{g}$ the anonymity property on RSA-based cryptosystem, which we call "sampling $\mathrm{t}\mathrm{w}\mathrm{i}\mathrm{c}\mathrm{e}.'\dot{\mathrm{J}}$It generated the uni- form distribution over $[0, 2^{\mathrm{h}})$ by sampling the two elements from $E_{N}$ $\mathrm{w}$ here $|N1$ $=k$ .Then, by applying the sampling twice technique, we construct the schemes for encryption, undeniable and confirmer signature, and ring signature, which have some advantages to the previous schemes.